958 search results - page 31 / 192 » Efficient data structures for range-aggregate queries on tre... |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...
DASFAA
2004
IEEE
14 years 1 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
ACSC
2002
IEEE
14 years 2 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...