Please use this identifier to cite or link to this item:
Title: Efficient processing of XML twig pattern matching
Keywords: XML, query processing, algorithm, tree pattern, semi-structure data, holistic twig join
Issue Date: 23-Feb-2007
Citation: LU JIAHENG (2007-02-23). Efficient processing of XML twig pattern matching. ScholarBank@NUS Repository.
Abstract: With the rapidly increasing popularity of XML, more and more information is being stored, exchanged and presented in XML format. The ability to efficiently query XML data sources, therefore, becomes increasingly important. This thesis studies the query processing of a core subset of XML query languages: XML twig queries. An XML twig query, represented as a small query tree, is essentially a complex selection on the structure of an XML document. Matching a twig query means finding all the instances of the query tree embedded in the XML data tree. We present in this thesis a series of new holistic twig join algorithms by which query trees are matched as a whole so that the size of irrelevant intermediate results can be greatly reduced. Through an extensive performance study, the proposed solutions are shown to be effective, efficient and scalable, and should be helpful for the future research on efficient query processing in a large XML database.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis.pdf890.43 kBAdobe PDF



Page view(s)

checked on Dec 30, 2018


checked on Dec 30, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.