104 search results - page 6 / 21 » Range queries over skip tree graphs |
JOLLI
2010
13 years 5 months ago
2010
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
TKDE
2010
13 years 2 months ago
2010
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...