958 search results - page 53 / 192 » Efficient data structures for range-aggregate queries on tre... |
SIGMOD
2004
ACM
16 years 20 days ago
2004
ACM
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...
96
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
216
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
280
Voted
IBPRIA
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
DAWAK
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...