J
Jeffrey Scott Vitter
Researcher at University of Mississippi
Publications - 342
Citations - 19164
Jeffrey Scott Vitter is an academic researcher from University of Mississippi. The author has contributed to research in topics: Data structure & Sorting. The author has an hindex of 66, co-authored 341 publications receiving 18546 citations. Previous affiliations of Jeffrey Scott Vitter include Texas A&M University & University of Kansas.
Papers
More filters
Book ChapterDOI
Optimal Color Range Reporting in One Dimension
TL;DR: An O(N)-space data structure is described that answers one-dimensional color reporting queries in optimal O(k + 1) time, where k is the number of colors in the answer and N is thenumber of points in the data structure.
Journal ArticleDOI
Deletion algorithms for hashing that preserve randomness
TL;DR: The main result of this paper shows that the deletion algorithm preserves randomness for the special case of standard coalesced hashing, in that deleting a record is in some sense like never having inserted it.
Proceedings ArticleDOI
Modeling and optimizing I/O throughput of multiple disks on a bus (summary)
Rakesh D. Barve,Elizabeth Shriver,Phillip B. Gibbons,Bruce K. Hillyer,Yossi Matias,Jeffrey Scott Vitter +5 more
TL;DR: A technique to improve the I/O bandwidth by 10-20% for random-access workloads that have large I/Os and high concurrency is described, and a model that accurately predicts the average bandwidth achieved by a heavy workload of random reads from disks on a SCSI bus is presented.
Journal ArticleDOI
Feature reduction based on semantic similarity for graph classification
TL;DR: A feature reduction algorithm based on semantic similarity for graph classification based on vector representations of subtree patterns using neural language models and then merge semantically similar subtrees into a new feature.
Posted Content
Dynamic Data Structures for Document Collections and Graphs
TL;DR: It is demonstrated that the gap between static and dynamic variants of the indexing problem can be almost closed, based on a novel framework for adding dynamism to static compressed data structures.