Please use this identifier to cite or link to this item:
|Title:||On label stream partition for efficient holistic twig join|
|Authors:||Chen, B. |
|Citation:||Chen, B.,Ling, T.W.,Özsu, M.T.,Zhu, Z. (2007). On label stream partition for efficient holistic twig join. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4443 LNCS : 807-818. ScholarBank@NUS Repository.|
|Abstract:||Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme is effective for non-recursive XML documents, but inefficient for deep recursive XML documents due to the high CPU cost of pruning and merging too many streams for some twig pattern queries involving recursive tags. In this paper, we propose a general stream partition scheme called Recursive Path Stream (RPS), to control the total number of streams while providing pruning power. In particular, each recursive path in RPS represents a set of prefix paths which can be recursively expanded from the recursive path. We present the algorithms to build RPS scheme and prune RPS streams for queries. We also discuss the adaptability of RPS and provide a framework for performance tuning with general RPS based on different application requirements. © Springer-Verlag Berlin Heidelberg 2007.|
|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 Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.