Name
Abstract | ||
|---|---|---|
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies on using scores to prune irrelevant answers as early as possible in the evaluation process. In this context, evaluating the same query plan for all answers might be too rigid because, at any time in the evaluation, answers have gone through the same number and sequence of operations, which limits the speed at which scores grow. Therefore, adaptive query processing that permits different plans for different partial matches and maximizes the best scores is more appropriate. In this paper, we propose an architecture and adaptive algorithms for efficiently computing top-k matches to XML queries. Our techniques can be used to evaluate both exact and approximate matches where approximation is defined by relaxing XPath axes. In order to compute the scores of query answers, we extend the traditional tf*idf measure to account for document structure. We conduct extensive experiments on a variety of benchmark data and queries, and demonstrate the usefulness of the adaptive approach for computing top-k queries in XML. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICDE.2005.18 | ICDE |
Keywords | Field | DocType |
XML,query processing,XML queries,adaptive query processing,top-k queries | Query optimization,Data mining,Efficient XML Interchange,Streaming XML,Information retrieval,XML validation,Computer science,Document Structure Description,XML database,Web query classification,XPath,Database | Conference |
ISSN | ISBN | Citations |
1084-4627 | 0-7695-2285-8 | 59 |
PageRank | References | Authors |
2.55 | 21 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amélie Marian | 1 | 1280 | 77.92 |
| Sihem Amer-Yahia | 2 | 2400 | 176.15 |
| Nick Koudas | 3 | 6424 | 566.00 |
| Divesh Srivastava | 4 | 8984 | 1191.22 |