File(s) under permanent embargo
Efficient top-k search across heterogeneous XML data sources
conference contribution
posted on 2008-01-01, 00:00 authored by Jianxin LiJianxin Li, Chengfei Liu, Jeffrey Xu Yu, Rui ZhouAn important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cost, i.e., finding the k matches with the highest computed scores by only traversing part of the documents. This paper resolves this issue by proposing a bound-threshold based scheduling strategy. It can answer a top-k XML query as early as possible by dynamically scheduling the query over XML documents. In this work, the total amount of documents that need to be visited can be greatly reduced by skipping those documents that will not produce the desired results with the bound-threshold strategy. Furthermore, most of the candidates in each visited document can also be pruned based on the intermediate results. Most importantly, the partial results can be output immediately during the query execution, rather than waiting for the end of all results to be determined. Our experimental results show that our query scheduling and processing strategies are both practical and efficient.
History
Event
Database Systems for Advanced Applications. Conference (13th : 2008 : New Delhi, India)Series
Database Systems for Advanced Applications ConferencePagination
314 - 329Publisher
SpringerLocation
New Delhi, IndiaPlace of publication
Berlin, GermanyPublisher DOI
Start date
2008-03-19End date
2008-03-21ISBN-13
978-3-540-78567-5Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2008, Springer-Verlag Berlin HeidelbergEditor/Contributor(s)
J Harista, R Kotagiri, V PudiTitle of proceedings
DASFAA 2008 : Proceedings of the 13th International Conference Database Systems for Advanced ApplicationsUsage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC