Jeffrey Scott Vitter

Jeffrey Scott Vitter

Auto-generated profile, based on publicly available information

Jeffrey Scott Vitter

Univ Mississippi, Dept Comp & Informat Sci, University, MS 38677 USA

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 June 2003 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
YMYossi Matias
Yossi Matias
JVJeffrey Scott Vitter
Jeffrey Scott Vitter
WNWen-Chun Ni
Wen-Chun Ni

24 June 2023 in Computational Geometry
Verified
Journal Article
Closed access
SMSushovan Majhi
Sushovan Majhi
JVJeffrey Vitter
Jeffrey Vitter
CWCarola Wenk
Carola Wenk

20 November 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XCXiaoyang Chen
Xiaoyang Chen
HHHongwei Huo
Hongwei Huo
JHJun Huan
Jun Huan
JVJeffrey Scott Vitter
Jeffrey Scott Vitter
WZWeiguo Zheng
Weiguo Zheng
LZLei Zou
Lei Zou
Graph similarity search has received considerable attention in many applications, such as bioinformatics, pattern recognition and social networks. Existing methods have limited scalability because of the huge amount of memory they consume when handling very large graph databases with tens of millions of graphs. In this paper, we present a succinct index that incorporates succinct data structures and hybrid encoding to achieve improved query time performance with minimal space usage. Specifically, the space usage of our index requires only 5%-15% of the previous state-of-the-art indexing size while at the same time achieving several times acceleration in query time on the tested data. We also improve the query performance by augmenting the global filter with range searching, which allows us to search in a reduced region. Besides, we propose two effective lower bounds together with a boosting technique to obtain the possible smallest candidate set. Extensive experiments demonstrate that our proposed approach is superior both in space and filtering to the state-of-the-art approaches. To the best of our knowledge, our index is the first in-memory index that successfully scales to cope with the large dataset of 25 million chemical graphs from the PubChem dataset. The source code is available online.

1 July 2020 in Neurocomputing
Verified
Journal Article
Closed access
Zhigang SunZhigang Sun
Zhigang Sun
HHHongwei Huo
Hongwei Huo
JHJun Huan
Jun Huan
JVJeffrey Scott Vitter
Jeffrey Scott Vitter

1 June 1998
Verified
Conference Paper
Open access
PDF file
RBRakesh Barve
Rakesh Barve
ESElizabeth Shriver
Elizabeth Shriver
PGPhillip B. Gibbons
Phillip B. Gibbons
BHBruce K. Hillyer
Bruce K. Hillyer
YMYossi Matias
Yossi Matias
JVJeffrey Scott Vitter
Jeffrey Scott Vitter
For a wide variety of computational tasks, disk I/O continues to be a serious obstacle to high performance. The focus of the present paper is on systems that use multiple disks per SCSI bus. We measured the performance of concurrent random I/Os, and observed bus-related phenomena that impair performance. We describe these phenomena, and present a new I/O performance model that accurately predicts the average bandwidth achieved by a heavy workload of random reads from disks on a SCSI bus. This model, although relatively simple, predicts performance on several platforms to within 12% for I/O sizes in the range 16-128 KB. We describe a technique to improve the I/O bandwidth by 10-20% for random-access workloads that have large I/Os and high concurrency. This technique increases the percentage of disk head positioning time that is overlapped with data transfers, and increases the percentage of transfers that occur at bus bandwidth, rather than at disk-head bandwidth.

21 January 2020 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
HHHongwei Huo
Hongwei Huo
XCXiaoyang Chen
Xiaoyang Chen
XGXu Guo
Xu Guo
JVJeffrey Scott Vitter
Jeffrey Scott Vitter
In this paper, we focus upon the important problem of indexing and searching highly repetitive DNA sequence collections. Given a collection G of t sequences Si of length n each, we can represent G succinctly in 2nHk(T) + O(n'loglog n) + o(qn') + o(tn) bits using O(tn2 + qn') time, where Hk(T) is the k-order empirical entropy of the sequence T ∈ G that is used as the reference sequence, n' is the total number of variations between T and the sequences in G, and q is a small fixed constant. We can restore any length len substring S[sp, ..., sp + len - 1] of S ∈ G in O(ns' + len(log n)2/ log n) time and report all positions where P occurs in G in O(m·t + occ·t ·(log n)2/ log log n) time. In addition, we propose a dynamic programming method to find the variations between T and the sequences in G in a space-efficient way, with which we can build succinct structures to enable efficient search. For highly repetitive sequences, experimental results on the tested data demonstrate that the proposed method has significant advantages in space usage and retrieval time over the current state-of-the-art methods. The source code is available online.