Skip to main content

A Path-Based Approach for Efficient Structural Join with Not-Predicates

  • Conference paper
Advances in Databases: Concepts, Systems and Applications (DASFAA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4443))

Included in the following conference series:

  • 1515 Accesses

Abstract

There has been much research on XML query processing. However, there has been little work on the evaluation of XML queries involving not-predicates. Such queries are useful and common in many real-life applications. In this paper, we present a model called XQuery tree to model queries involving not-predicates and describe a path-based method to evaluate such queries efficiently. A comprehensive set of experiments is carried out to demonstrate the effectiveness and efficiency of the proposed solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. http://www.ibiblio.org/xml/examples/shakespeare

  2. http://www.informatik.uni-trier.de/~ley/db/

  3. http://monetdb.cwi.nl/

  4. Al-Khalifa, A., Jagadish, H.V., Patel, J.M., et al.: Structural joins: A primitive for efficient xml query pattern matching. In: IEEE ICDE (2002)

    Google Scholar 

  5. Al-Khalifa, S., Jagadish, H.V.: Multi-level operator combination in xml query processing. In: ACM CIKM (2002)

    Google Scholar 

  6. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal xml pattern matching. In: ACM SIGMOD (2002)

    Google Scholar 

  7. Chien, S.-Y., Vagena, Z., Zhang, D., et al.: Efficient structural joins on indexed xml documents. In: VLDB (2002)

    Google Scholar 

  8. Jiang, H., Lu, H., Wang, W., Ooi, B.C.: Xr-tree: Indexing xml data for efficient structural joins. In: IEEE ICDE (2003)

    Google Scholar 

  9. Jiang, H., Wang, W., Lu, H.: Holistic twig joins on indexed xml documents. In: VLDB (2003)

    Google Scholar 

  10. Jiao, E., Ling, T.-W., Chan, C.-Y.: Pathstack¬: A holistic path join algorithm for path query with not-predicates on xml data. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 113–124. Springer, Heidelberg (2005)

    Google Scholar 

  11. Li, H., Lee, M.-L., Hsu, W.: A path-based labeling scheme for efficient structural join. In: International Symposium on XML Databases (2005)

    Google Scholar 

  12. Li, Q., Moon, B.: Indexing and querying xml data for regular path expressions. In: VLDB (2001)

    Google Scholar 

  13. Lu, J., Chen, T., Ling, T.-W.: Efficient processing of xml twig patterns with parent child edges: A look-ahead approach. In: CIKM (2004)

    Google Scholar 

  14. Yu, T., Ling, T.-W., Lu, J.: Twigstacklist¬: A holistic twig join algorithm for twig query with not-predicates on xml data. In: Lee, M.L., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 249–263. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ramamohanarao Kotagiri P. Radha Krishna Mukesh Mohania Ekawit Nantajeewarawat

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Li Lee, M., Hsu, W., Li, L. (2007). A Path-Based Approach for Efficient Structural Join with Not-Predicates. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71703-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71702-7

  • Online ISBN: 978-3-540-71703-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics