958 search results - page 25 / 192 » Efficient data structures for range-aggregate queries on tre... |
238
click to vote
VLDB
2002
ACM
16 years 20 days ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
110
Voted
FUN
2010
Springer
15 years 5 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
109
Voted
SOFSEM
2004
Springer
15 years 5 months ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
106
Voted
ICDE
2010
IEEE
16 years 5 days ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
102
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...