958 search results - page 115 / 192 » Efficient data structures for range-aggregate queries on tre... |
101
click to vote
DATESO
2008
14 years 11 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
ALENEX
2003
14 years 11 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
178
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
190
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
105
click to vote
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...