Exploiting the structure of update fragments for efficient XML index maintenance

Authors:
Katharina Grün;Michael Schrefl
Affiliations:
Department of Business Informatics, Data & Knowledge Engineering, Johannes Kepler University Linz, Austria;Department of Business Informatics, Data & Knowledge Engineering, Johannes Kepler University Linz, Austria
Venue:
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Year:
2007

Citing 7
Cited 0

An algebraic approach for incremental maintenance of materialized XQuery views

Proceedings of the 4th international workshop on Web information and data management
XML Data Management: Native XML and XML Enabled DataBase Systems

XML Data Management: Native XML and XML Enabled DataBase Systems
Index Organizations for Object-Oriented Database Systems

IEEE Transactions on Knowledge and Data Engineering
Path sharing and predicate evaluation for high-performance XML filtering

ACM Transactions on Database Systems (TODS)
A Fast Tree Pattern Matching Algorithm for XML Query

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
XML Document Indexes: A Classification

IEEE Internet Computing
The tree inclusion problem: in optimal space and faster

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML databases provide index structures to accelerate queries on the content and structure of XML documents. As index structures must be consistent with the documents on which they are defined, updates on documents need to be propagated to affected index structures. This paper presents an index maintenance algorithm that is solely based on index definitions and update fragments instead of on the maintenance of auxiliary data structures. The use of index definitions assures that the algorithm supports arbitrary index structures defined on arbitrary document fragments. By exploiting the structure of update fragments, the algorithm directly extracts the nodes which are required for index maintenance from the fragments. Source queries are only necessary if the fragment does not contain all nodes required for indexing. The presented performance studies demonstrate the advantages of this approach over previous work that propagates each updated node individually.