Abstract
XML data processing often relies on basic relations between two XML fragments like containment, subset, difference and intersection. Fast calculation of such relations based only on the representing XPath expression is known to be a major challenge. Recently XML patterns have been introduced to model and identify handy subclasses of XPath. We present the concept of ST-pattern segments that uses sets of adapted tree patterns in order to describe a finite and complete partitioning of the XML document’s data space. Based on such segmentations, we present a fast evaluation of XML relations and show how to compute a set of patterns for an optimal segmentation based on frequent XPath queries.
Chapter PDF
Similar content being viewed by others
References
Chin-Wan Chung, Jun-Ki Min, Kyuseok Shim: APEX: an adaptive path index for XML data. SIGMOD Conference 2002: 121–132 [DBLP:conf/sigmod/ChungMS02]
Torsten Grust: Accelerating XPath location steps. SIGMOD Conference 2002: 109–120
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth: Covering indexes for branching path queries. SIGMOD Conference 2002: 133–144
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Patel, Yuqing Wu, Nick Koudas, Divesh Srivastava: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. ICDE 2002
Nicolas Bruno, Nick Koudas, Divesh Srivastava: Holistic twig joins: optimal XML pattern matching. SIGMOD Conference 2002: 310–321
J. Clark and S. DeRose. XML Path Language (XPath) version 1.0 W3C recommendation, 1999.
D. Chamberlin, D. Florescu, J. Robie, J. Simon, and M. Stefanescu. XQuery: A Query Language for XML W3C working draft, 2001.
L._H. Yang, M. L. Lee, W. Hsu. Mining Frequent Query Patterns in XML. 8th Int. Conference on Database Systems for Advanced Applications (DASFAA), 2003.
Liang Huai Yang, Mong-Li Lee, Wynne Hsu: Efficient Mining of XML Query Patterns for Caching. VLDB 2003: 69–80
Stefan Böttcher, Adelhard Türling: XML Fragment Caching for Small Mobile Internet Devices. Web, Web-Services, and Database Systems 2002: 268–279
Franky Lam, Nicole Lam, Raymond K. Wong: Efficient synchronization for mobile XML data. CIKM 2002: 153–160
Douglas B. Terry, Venugopalan Ramasubramanian: Caching XML Web Services for Mobility. ACM Queue 1(1): (2003)
Jan Hidders: Satisfiability of XPath Expressions. DBPL 2003: 21–36
Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Query Evaluation: Improving Time and Space Efficiency. ICDE 2003: 379–390
Georg Gottlob, Christoph Koch, Reinhard Pichler: The complexity of XPath query evaluation. PODS 2003: 179–190
S. Böttcher: Testing Intersection of XPath Expressions under DTDs. International Database Engineering & Applications Symposium. Coimbra, Portugal, July 2004.
Yanlei Diao, Michael J. Franklin: Query Processing for High-Volume XML Message Brokering. VLDB 2003: 261–272
Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, Feng Tian, Stratis Viglas, Yuan Wang, Jeffrey F. Naughton, David J. DeWitt: Mixed Mode XML Query Processing. VLDB 2003: 225–236
S. Böttcher, Adelhard Türling: Caching XML Data for Mobile Web Clients. International Conference on Internet Computing IC’04, Las Vegas, USA, Juni 2004.
Serge Abiteboul, Luc Segoufin, Victor Vianu: Representing and Querying XML with Incomplete Information. PODS 2001 [DBLP:conf/pods/AbiteboulSV01]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Türling, A., Böttcher, S. (2005). Finite Segmentation for XML Caching. In: Lawrence, E., Pernici, B., Krogstie, J. (eds) Mobile Information Systems. MOBIS 2004. IFIP International Federation for Information Processing, vol 158. Springer, Boston, MA. https://doi.org/10.1007/0-387-22874-8_13
Download citation
DOI: https://doi.org/10.1007/0-387-22874-8_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-22851-8
Online ISBN: 978-0-387-22874-7
eBook Packages: Computer ScienceComputer Science (R0)