File(s) under permanent embargo
Efficient computation of multiple XML keyword queries
conference contribution
posted on 2013-01-01, 00:00 authored by Liang Yao, Chengfei Liu, Jianxin LiJianxin Li, Rui ZhouAnswering keyword queries on XML data has been extensively studied. Current XML keyword search solutions primarily focus on single query setting where queries are answered individually. In many applications for searching information such as jobs and publications, an application server often receives a large number of keyword queries in a short period of time and many of them may share common keywords. Therefore, answering keyword queries in batches will significantly enhance the performance of these applications. In this paper, we investigate efficient approaches for computing multiple XML keyword queries. We first propose an approach that maximizes the sharing among keyword queries. We then consider useful data information and propose two data-aware algorithms: a short eager algorithm and a log based optimal algorithm. We evaluate the proposed algorithms on real and synthetic datasets and the experimental results demonstrate their efficiencies.
History
Event
Web Information Systems Engineering. International Conference (2013 : Nanjing, China)Volume
8180Series
Lecture Notes in Computer SciencePagination
368 - 381Publisher
SpringerLocation
Nanjing, ChinaPlace of publication
New York, N.Y.Publisher DOI
Start date
2013-10-13End date
2013-10-15ISBN-13
9783642412301Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2013, Springer-Verlag Berlin HeidelbergEditor/Contributor(s)
X Lin, Y Manolopoulos, D Srivastava, G HuangTitle of proceedings
WISE 2013 : International Conference on Web Information Systems EngineeringUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC