184 search results - page 22 / 37 » A new range query algorithm for Universal B-trees |
113
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
215
click to vote
SIGMOD
2009
ACM
16 years 18 hour ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
102
click to vote
SSD
2009
Springer
15 years 6 months ago
2009
Springer
Outsourcing data to third party data providers is becoming a common practice for data owners to avoid the cost of managing and maintaining databases. Meanwhile, due to the populari...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
116
click to vote
STOC
2007
ACM
16 years 3 days ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...