Skip to main content

FLUX: Content and Structure Matching of XPath Queries with Range Predicates

  • Conference paper
Database and XML Technologies (XSym 2006)

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

Included in the following conference series:

Abstract

Range queries seek the objects residing in a constrained region of the data space. An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure range queries efficiently, an XML query processing engine needs to incorporate effective indexing and summarization techniques to efficiently partition the XML document and locate the results. In this paper, we describe a dynamic summarization and indexing method, FLUX, based on Bloom filters and B + -trees to tackle these problems. We present the results of extensive experimental evaluations which indicate the efficiency of the proposed technique.

This research was supported by the NSF under IIS-0223022 and CNF-0423336.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: ICDE, pp. 141–152 (2002)

    Google Scholar 

  2. Al-Khalifa, S., et al.: Querying Structured Text in an XML Database. In: SIGMOD, pp. 4–15 (2003)

    Google Scholar 

  3. Amer-Yahia, S., Lakshmanan, L.V.S., Pandit, S.: FleXPath: Flexible Structure and Full-Text Querying for XML. In: SIGMOD, pp. 83–94 (2004)

    Google Scholar 

  4. Bloom, B.H.: Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  5. Botev, C., Shanmugasundaram, J., Amer-Yahia, S.: A TeXQuery-Based XML Full-Text Search Engine. In: SIGMOD, pp. 943–944 (2004)

    Google Scholar 

  6. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD, pp. 310–321 (2002)

    Google Scholar 

  7. Chamberlin, D., Florescu, D., Robie, J., Siméon, J., Stefanescu, M.: XQuery: A Query Language for XML. W3C Working Draft (2001), http://www.w3.org/TR/xquery

  8. Chien, S., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: VLDB, pp. 263–274 (2002)

    Google Scholar 

  9. CiteSeer Scientific Literature Digital Library and Search Engine, http://citeseer.ist.psu.edu

  10. Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. In: SIGCOMM, pp. 254–265 (1998)

    Google Scholar 

  11. Grust, T.: Accelerating XPath location steps. In: SIGMOD, pp. 109–120 (2002)

    Google Scholar 

  12. Guo, L., Shanmugasundaram, J., Beyer, K.S., Shekita, E.J.: Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases. In: ICDE (2005)

    Google Scholar 

  13. Jiang, H., Wang, W., Lu, H., Xu Yu, J.: Holistic Twig Joins on Indexed XML Documents. In: VLDB, pp. 273–284 (2003)

    Google Scholar 

  14. Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Indexing Paths in Graph-Structured Data. In: ICDE, pp. 129–140 (2002)

    Google Scholar 

  15. DBLP Bibliography Server, http://dblp.uni-trier.de/

  16. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  17. Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: VLDB, pp. 361–370 (2001)

    Google Scholar 

  18. Lu, J., Chen, T., Ling, T.W.: Efficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach. In: CIKM, pp. 533–542 (2004)

    Google Scholar 

  19. Lu, J., Ling, T.W., Chan, C.Y., Chen, T.: From Region Encoding to Extended Dewey: On Efficient Processing of XML Twig Pattern Matching. In: VLDB, pp. 193–204 (2005)

    Google Scholar 

  20. Marian, A., Amer-Yahia, S., Koudas, N., Srivastava, D.: Adaptive Processing of Top-K Queries in XML. In: ICDE (2005)

    Google Scholar 

  21. Rao, P., Moon, B.: PRIX: Indexing And Querying XML Using Prüfer Sequences. In: ICDE, pp. 288–300 (2004)

    Google Scholar 

  22. Weigel, F., Meuss, H., Schulz, K.U., Bry, F.: Content and Structure in Indexing and Ranking XML. In: WebDB, pp. 67–72 (2004)

    Google Scholar 

  23. Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures. In: SIGMOD, pp. 110–121 (2003)

    Google Scholar 

  24. Schmidt, A.R., et al.: The XML Benchmark Project. Technical Report INS-R0103, CWI (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, HG., Aghili, S.A., Agrawal, D., El Abbadi, A. (2006). FLUX: Content and Structure Matching of XPath Queries with Range Predicates. In: Amer-Yahia, S., Bellahsène, Z., Hunt, E., Unland, R., Yu, J.X. (eds) Database and XML Technologies. XSym 2006. Lecture Notes in Computer Science, vol 4156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841920_5

Download citation

  • DOI: https://doi.org/10.1007/11841920_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38879-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics