Title Discovering frequent tree patterns from XML queries
Authors Chen, Yi
Wang, Yu-Guo
Yang, Liang-Huai
Affiliation Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China
Dept. of Comp. Sci., Peking Univ., Beijing 100871, China
Issue Date 2004
Publisher ruan jian xue baojournal of software
Citation Ruan Jian Xue Bao/Journal of Software.2004,15,(SUPPL.),114-123.
Abstract With XML being the standard for data encoding and exchange over Internet, how to manage XML data efficiently becomes a critical issue. An effective approach to improve the performance of XML management systems is to discover frequent XML query patterns and cache their results. Since each XML query can be modeled as a tree structure, the problem of discovering frequent query patterns can be reduced to frequent structure mining. However, mining frequent query patterns is much more complex than simple structure mining since we have to consider the semantics of query patterns. In this paper, we present an approach to discover frequent XML query patterns efficiently. Compared with previous works, our approach is strictly based on the semantics of XML queries, its mining results are more precise, and can be more effectively utilized by caching system.
URI http://hdl.handle.net/20.500.11897/407321
ISSN 10009825
Indexed EI
Appears in Collections: 信息科学技术学院

Files in This Work
There are no files associated with this item.

Web of Science®


0

Checked on Last Week

百度学术™


0

Checked on Current Time




License: See PKU IR operational policies.