Open AccessOnline mining of frequent query trees over XML data streams
Author(s) -
Hua-Fu Li,
Man-Kwan Shan,
Suh-Yin Lee
Publication year - 2006
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
ISBN - 1-59593-323-9
DOI - 10.1145/1135777.1135964
Subject(s) - computer science , data stream mining , data mining , xml , query optimization , xml database , tree (set theory) , streaming xml , information retrieval , data stream , query language , tree structure , sargable , data structure , web search query , database , search engine , world wide web , programming language , mathematics , telecommunications , mathematical analysis
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data stream. A new numbering method is proposed to represent the tree structure of a XML query tree. An effective sub-tree numeration approach is developed to extract the essential information from the XML data stream. The extracted information is stored in an effective summary data structure. Frequent query trees are mined from the current summary data structure by a depth-first-search manner.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom