277 search results - page 49 / 56 » Opportunistic Data Structures for Range Queries |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
SIGCOMM
2005
ACM
14 years 1 months ago
2005
ACM
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
EDBT
2009
ACM
14 years 7 days ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
DEXA
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...