Paper Info
Title
Improving XML Querying with Maximal Frequent Query Patterns
Abstract
Querying on XML data is a computational-expensive process due to the complex nature of both the XML data and the query. In this paper, we propose an approach to expedite XML query processing by caching the results of a specific class of queries, namely the maximal frequent queries. We mine the maximal frequent query patterns from user-issued queries and cache the results of such queries. We propose a recursive algorithm for query processing using the cached query results. Query rewriting is employed to deal with four kinds of similar queries namely exact matching, exact containment, semantic matching and semantic containment. We perform experiments on the XMARK datasets and show that the proposed methods are both effective and efficient in improving the performance of XML queries.
Year
DOI
Venue
2007
10.1007/978-3-540-72584-8_34
International Conference on Computational Science (1)
Keywords
Field
DocType
frequent query patterns,similar query,xml query,improving xml,exact containment,user-issued query,cached query result,xml data,maximal frequent query,xml query processing,maximal frequent query pattern,query processing,recursive algorithm
Query optimization,Web search query,Query language,Streaming XML,Query expansion,Information retrieval,Computer science,Sargable,Web query classification,Spatial query
Conference
Volume
ISSN
Citations 
4487
0302-9743
0
PageRank 
References 
Authors
0.34
10
3
Name
Order
Citations
PageRank
Yijun Bei1666.48
Gang Chen271275.60
Jinxiang Dong331165.36