Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/16193
Title: | Efficient processing of multiple XML twig queries | Authors: | LIU HUANZHANG | Keywords: | XML, Twig Pattern, Multiple Twig Queries, Super-twig, MTwigStack | Issue Date: | 24-May-2007 | Citation: | LIU HUANZHANG (2007-05-24). Efficient processing of multiple XML twig queries. ScholarBank@NUS Repository. | Abstract: | Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data interchange has spawned great interest in techniques for filtering and content-based routing of XML data. In this paper, we aim to use the state-of-art holistic twig join technique to address multiple twig queries in a large scale XML database. We propose a new twig query technique which is specially tailored to match documents with large numbers of twig pattern queries. We introduce the super-twig to represent multiple twig queries. We also design a two-tier B+ tree index to store parsed XML data. Then it is possible to process repeated nodes in the super-twig. Based on the super-twig, we design a holistic twig join algorithm, called MTwigStack, to find all matches for multiple twig queries by scanning an XML document only once. | URI: | http://scholarbank.nus.edu.sg/handle/10635/16193 |
Appears in Collections: | Master's Theses (Open) |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
thesis.pdf | 988.81 kB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.