Please use this identifier to cite or link to this item:
|Title:||Prefix path streaming: A new clustering method for optimal holistic XML twig pattern matching||Authors:||Chen, T.
|Issue Date:||2004||Citation:||Chen, T.,Ling, T.W.,Chan, C.-Y. (2004). Prefix path streaming: A new clustering method for optimal holistic XML twig pattern matching. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3180 : 801-810. ScholarBank@NUS Repository.||Abstract:||Searching for all occurrences of a twig pattern in a XML document is an important operation in XML query processing. Recently a class of holistic twig pattern matching algorithms has been proposed. Compared with the prior approaches, the holistic method avoids generating large intermediate results which do not contribute to the final answer. The method is CPU and I/O optimal when twig patterns only have ancestor-descendant relationships.The holistic twig-pattern matching method proposed earlier  operates on element streams which cluster all XML elements with the same tag name together. In this paper we introduce a clustering method called Prefix Path Streaming (PPS) and new holistic twig pattern matching algorithms based on PPS. PPS clusters elements of XML documents according to the paths from root to the elements. This clustering approach avoids unnecessary scanning of irrelevant portion of XML documents.More importantly, we develop optimal algorithms based on PPS streaming which can process a large class of twig patterns consisting of both ancestor-descendant and parent-child relationships. © Springer-Verlag Berlin Heidelberg 2004.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/39166||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.