Edinburgh Research Explorer

Vectorizing and Querying Large XML Repositories

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationData Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages261-272
Number of pages12
ISBN (Print)0-7695-2285-8
DOIs
Publication statusPublished - 2005

Abstract

Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to store each column separately. We use a generalization of vectorization as the basis for a native XML store. The idea is to decompose an XML document into a set of vectors that contain the data values and a compressed skeleton that describes the structure. In order to query this representation and produce results in the same vectorized format, we consider a practical fragment of XQuery and introduce the notion of query graphs and a novel graph reduction algorithm that allows us to leverage relational optimization techniques as well as to reduce the unnecessary loading of data vectors and decompression of skeletons. A preliminary experimental study based on some scientific and synthetic XML data repositories in the order of gigabytes supports the claim that these techniques are scalable and have the potential to provide performance comparable with established relational database technology.

ID: 10624451