104 search results - page 18 / 21 » Index structures and algorithms for querying distributed RDF... |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
DAGSTUHL
2004
13 years 9 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
SIGMOD
2009
ACM
14 years 7 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...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...