Mining frequent query patterns from XML queries

As XML prevails over the Internet, the efficient retrieval of XML data becomes important. Research to improve query response times has been largely concentrate on indexing XML documents and processing regular path expressions. Another approach is to discover frequent query patterns since the answers...

Full description

Saved in:
Bibliographic Details
Published inEighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings pp. 355 - 362
Main Authors Liang Huai Yang, Mong Li Lee, Wynne, H., Sumit Acharya
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Delay
Frequency
History
Indexing
Information retrieval
Internet
Pattern matching
Scalability
XML
Online AccessGet full text

Cover

More Information
Summary:As XML prevails over the Internet, the efficient retrieval of XML data becomes important. Research to improve query response times has been largely concentrate on indexing XML documents and processing regular path expressions. Another approach is to discover frequent query patterns since the answers to these queries can be stored and indexed. Mining frequent query patterns requires more than simple tree matching since the XML queries involves special characters such as "*" or "//". In addition, the matching process can be expensive since the search space is exponential to the size of XML schema. In this paper, we present two mining algorithms, XQPMiner and XQPMinerTID, to discover frequent query pattern frees from a large collection of XML queries efficiently. Both algorithms exploit schema information to guide the enumeration of candidate subtrees, thus eliminating unnecessary node expansions. Experiments results show that the proposed methods are efficient and have good scalability.
ISBN:0769518958
9780769518954
DOI:10.1109/DASFAA.2003.1192401