zbMATH — the first resource for mathematics

Efficient cache answerability for XPath queries. (English) Zbl 1021.68729
Bressan, Stéphane (ed.) et al., Efficiency and effectiveness of XML tools and techniques and data integration over the web. VLDB 2002 workshop EEXTT and CAiSE 2002 workshop DIWeb. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2590, 183-199 (2003).
Summary: 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.
For the entire collection see [Zbl 1015.68864].
68U99 Computing methodologies and applications
68P05 Data structures
68P20 Information storage and retrieval of data
68P15 Database theory
Full Text: Link