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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brian, F.C., Neal, S., Michael, F., Moshe, S.: A fast index for semistructured data. In: VLDB, pp. 341–350 (2001)
Wang, H.X., Park, S., Fan, W., Yu, P.S.: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures. In: ACM SIGMOD (2003)
Jie, Q., Shu, M.Z.: Querying XML Documents on Multi-processor. In: Sixth International Conference on Fuzzy Systems and Knowledge Discovery, pp. 327–331 (2009)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: ACM SIGMOD (2002)
McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23(2), 262–272 (1976)
Shasha, D., Wang, J.T.L., Rosalba, G.: Algorithmics and Applications of Tree and Graph Searching. In: ACM Symposium on Principles of Database Systems (PODS), pp. 39–52 (2002)
Leeuwen, J.V.: Algorithms for finding patterns in strings. In: Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 255–300. Elsevier (1990)
Sleepycat Software, The Berkeley Database (Berkeley DB), http://www.sleepycat.com
The DBLP Computer Science Bibliography (2009), http://www.informatik.uni-trier.de/~ley/db
XMark-An XML Benchmark Project (2009), http://www.xml-benchmark.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Z., Qin, J., Yan, F. (2012). An XML Data Query Method Based on Structure-Encoded. In: Wang, F.L., Lei, J., Gong, Z., Luo, X. (eds) Web Information Systems and Mining. WISM 2012. Lecture Notes in Computer Science, vol 7529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33469-6_87
Download citation
DOI: https://doi.org/10.1007/978-3-642-33469-6_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33468-9
Online ISBN: 978-3-642-33469-6
eBook Packages: Computer ScienceComputer Science (R0)