Abstract
Several algorithms have focused on processing path expression queries. Following those algorithms, all the nodes, matched with path expressions, are participated in computing. In this paper, we propose a novel filter strategy to reduce the number of candidate nodes based on the structure of XML data. All nodes are clustered based on their labels, and path information of each node is kept in bit vectors. Our filter technology mainly depends on high performance of bit operations. The experimental results show that these filter algorithms are effective, scalable and efficient.
Supported by the Defence Pre-Research Project of the “Tenth Five-Year-Plan” of China No.41315.2.3; the National Natural Science Foundation of China, No. 60273082.
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
Jiang, H., Lu, H., Wang, W., Yu, J.X.: Holistic Twig Joins on Indexed XML Documents. In: VLDB, pp. 273–284 (2003)
Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: VLDB 2002, pp. 263–274 (2002)
Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-Tree: Indexing XML Data for Efficient Structural Joins. In: ICDE 2003, pp. 253–264 (2003)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: VLDB 2001, pp. 361–370 (2001)
Srivastava, D., Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Wu, Y.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: ICDE 2002, pp.141–152 (2002)
Wu, Y., Patel, J.M., Jagadish, H.V.: Structural Join Order Selection for XML Query Optimization. In: ICDE 2003, pp. 443–454 (2003)
Zhang, C., Naughton, J.F., Dewitt, D.J., Luo, Q., Lohman, G.M.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD 2001, pp. 425–436 (2001)
Bruno, N., Srivastava, D., Koudas, N.: Holistic Twig Joins: Optimal XML Pattern Matching. In: SIGMOD 2002, pp. 310–321 (2002)
Jiang, H., Lu, H., Wang, W.: Efficient Processing of XML Twig Queries with OR-Predicates. In: SIGMOD 2004, pp. 59–70 (2004)
Lu, J., Chen, T., Ling, T.W.: Efficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach. In: CIKM, 533–542 (2004)
Wong, H.K.T., Li, J.Z., Olken, F., Rotem, D., Wong, L.: Bit Transposition for Very Large Scientific and Statistical Databases. In: VLDB, pp. 3040–311 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, Z., Li, J., Wang, C., Ge, P., Chen, H. (2005). Using XML Structure to Reduce Candidate Nodes Participated in Query Processing. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_5
Download citation
DOI: https://doi.org/10.1007/11563952_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29227-2
Online ISBN: 978-3-540-32087-6
eBook Packages: Computer ScienceComputer Science (R0)