An XML data query method based on structure-encoded

Authors:
Zhaohui Xu;Jie Qin;Fuliang Yan
Affiliations:
School of Computer, Wuhan University of Technology, Wuhan, China,Grain Information Processing and Control Key Laboratory of Ministry of Education, Henan University of Technology, Zhengzhou, Henan, ...;Grain Information Processing and Control Key Laboratory of Ministry of Education, Henan University of Technology, Zhengzhou, Henan, China;Grain Information Processing and Control Key Laboratory of Ministry of Education, Henan University of Technology, Zhengzhou, Henan, China
Venue:
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Year:
2012

Citing 6
Cited 0

Algorithms for finding patterns in strings

Handbook of theoretical computer science (vol. A)
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Algorithmics and applications of tree and graph searching

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Fast Index for Semistructured Data

Proceedings of the 27th International Conference on Very Large Data Bases
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Aiming the special tree-structure of XML data, a triples-encoded method for searching XML documents is proposed. By representing both XML documents and XML queries in triples-encoded sequences, querying XML data is equivalent to finding subsequence matches. Triples-encoded method uses tree structures as the basic unit of query to avoid expensive join operations. The proposed method also provides a unified index on both content and structure of the XML documents; hence it has a performance advantage over methods indexing either just content or structure. Experiments show that the proposed method is more effective, scalable, and efficient in supporting structural queries than traditional XML data query ways which based on Join operations.