Advertisement

Efficient Cache Answerability for XPath Queries

  • Pedro José Marrón
  • Georg Lausen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2590)

Abstract

The problem of cache answerability has traditionally been studied over conjunctive queries performed on top of a relational database system. However, with the proliferation of semistructured data and, in particular, of XML as the de facto standard for information interchange on the Internet, most of the assumptions and methods used for traditional systems—and cache answerability is no exception—need to be revisited from the point of view of the semistructured data and query model. In this paper, we present a formal framework for the efficient processing of XPath queries over XML documents in a cache environment that is based on the classic rewriting approach. Furthermore, we provide details on the implementation of our formal methods on top of HLCaches, an LDAP-based distributed caching system for XML, and argue that our approach is more efficient than traditional query rewriting algorithms while, at the same time, supporting the full expressive power of XPath queries.

Keywords

Semistructured data cache answerability query rewritability XML XPath LDAP 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BPSMM00]
    Tim Bray, Jean Paoli, C. M. Sperberg-McQueen, and Eve Maler. Extensible markup language (XML) 1.0 (second edition). http://www.w3.org/TR/2000/REC-xml-20001006, October 2000. 183, 190
  2. [CD99]
    James Clark and Steve DeRose. XML path language (XPath) version 1.0. http://www.w3c.org/TR/xpath, November 1999. 183, 184, 186, 189, 194
  3. [CGLV00]
    Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. View-based query processing for regular path queries with inverse. In Proceedings of the Nineteenth ACM SIGMOD-SIGACTSIGART Symposium on Principles of Database Systems, pages 58–66, Dallas, Texas, USA, May 2000. ACM Press. 183Google Scholar
  4. [DFJ+96]
    Shaul Dar, Michael J. Franklin, Björn Jónsson, Divesh Srivastava, and Michael Tan. Semantic data caching and replacement. In T.M. Vijayaraman, Alejandro P. Buchmann, C. Mohan, and Nandlal L. Sarda, editors, Proceedings of 22th International Conference on Very Large Data Bases (VLDB) 1996, pages 330–341, Mumbai, Bombai, India, Septemter 1996. Morgan Kaufmann. 183Google Scholar
  5. [ea00]
    L. Wood et al. Document object model (DOM) level 1specification (2nd ed.). http://www.w3.org/TR/2000/WD-DOM-Level-1-20000929/, September 2000. 194
  6. [Fal01]
    David C. Fallside. XML Schema part 0: Primer. http://www.w3.org/TR/xmlschema-0/, May 2001. 190
  7. [HHW+00]
    Arnaud Le Hors, Philippe Le Hégaret, Lauren Wood, Gavin Nicol, Jonathan Robie, Mike Champion, and Steve Byrne. Document object model (DOM) level 2 core specification. http://www.w3.org/TR/2000/REC-DOM-Level-2-Core-20001113/, November 2000. 194
  8. [HSG99]
    T. A. Howes, M.C. Smith, and G. S. Good. Understanding and Deploying LDAP Directory Services. Macmillan Network Architecture and Development. Macmillan Technical Publishing U. S.A., 1999. 189Google Scholar
  9. S99]
    Yaron Kanza, Werner Nutt, and Yehoshua Sagiv. Queries with incomplete answers over semistructured data. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 227–236, Philadelphia, Pennsylvania, USA, May 1999. ACM Press. 183Google Scholar
  10. [Lev00]
    A. Levy. Logic-based techniques in data integration. In J. Minker, editor, Logic-Based Artificial Intelligence. Kluwer Publishers, 2000. 183Google Scholar
  11. [LMSS95]
    Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. Answering queries using views. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 95–104, San Jose, California, USA, May 1995. ACM Press. 197Google Scholar
  12. [LRO96]
    Alon Y. Levy, Anand Rajaraman, and Joann J. Ordille. Querying heterogeneous information sources using source descriptions. In T.M. Vijayaraman, Alejandro P. Buchmann, C. Mohan, and Nandlal L. Sarda, editors, Proceedings of 22th International Conference on Very Large Data Bases (VLDB) 1996, pages 251–262, Mumbai, Bombai, India, Septemter 1996. Morgan Kaufmann. 183, 197Google Scholar
  13. [Mar01]
    Pedro José Marrón. Processing XML in LDAP and its Application to Caching. PhD thesis, Universität Freiburg, October 2001. 184Google Scholar
  14. [May]
    Wolfgang May. Mondial database. http://www.informatik.uni-freiburg.de/~may/Mondial. 188, 193
  15. [ML01]
    Pedro José Marrón and Georg Lausen. On processing XML in LDAP. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB), pages 601–610, Rome, Italy, September 2001. Morgan Kaufmann. 184, 189, 191Google Scholar
  16. [MvOV97]
    Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997. 194, 197Google Scholar
  17. [PV99]
    Yannis Papakonstantinou and Vasilis Vassalos. Query rewriting for semistructured data. In Alex Delis, Christos Faloutsos, and Shahram Ghandeharizadeh, editors, Proceedings of the ACM SIGMOD International Conference 1999, pages 455–466, Philadephia, Pennsylvania, USA, June 1999. ACM Press. 183Google Scholar
  18. [QCR00]
    Luping Quan, Li Chen, and Elke A. Rundensteiner. Argos: Efficient refresh in an XQL-based web caching system. In Proceedings of the Third International Workshop on the Web and Databases, pages 23–28, Dallas, Texas, May 2000. 183Google Scholar
  19. [TBMM01]
    Henry S. Thompson, David Beech, Murray Maloney, and Noah Mendelsohn. Xml schema part 1: Structures. http://www.w3.org/TR/xmlschema-1/, May 2001. 190
  20. [WHK97]
    M. Wahl, T. Howes, and S. Kille. Lightweight directory access protocol (v3). RFC 2251, December 1997. 189Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Pedro José Marrón
    • 1
  • Georg Lausen
    • 1
  1. 1.Institute of Computer ScienceUniversity of FreiburgFreiburgGermany

Personalised recommendations