Please use this identifier to cite or link to this item:
|Title:||Efficient processing of multiple XML twig queries|
|Citation:||Liu, H.,Ling, T.W.,Yu, T.,Wu, J. (2006). Efficient processing of multiple XML twig queries. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4080 LNCS : 1-11. 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. 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. © Springer-Verlag Berlin Heidelberg 2006.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.