Please use this identifier to cite or link to this item:
|Title:||Holistic boolean-twig pattern matching for efficient XML query processing|
XML data querying
|Source:||Che, D., Ling, T.W., Hou, W.-C. (2012). Holistic boolean-twig pattern matching for efficient XML query processing. IEEE Transactions on Knowledge and Data Engineering 24 (11) : 2008-2024. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2011.128|
|Abstract:||Twig pattern matching is a critical operation for XML query processing, and the holistic computing approach has shown superior performance over other methods. Since Bruno et al. introduced the first holistic twig join algorithm, TwigStack, numerous so-called holistic twig join algorithms have been proposed. Yet practical XML queries often require support for more general twig patterns, such as the ones that allow arbitrary occurrences of an arbitrary number of logical connectives (AND, OR, and NOT); such types of twigs are referred to as B-twigs (i.e., Boolean-Twigs) or AND/OR/NOT-twigs. We have seen interesting work on generalizing the holistic twig join approach to AND/OR-twigs and AND/NOT-twigs, but have not seen any further effort addressing the problem of AND/OR/NOT-Twigs at the full scale, which therefore forms the main theme of this paper. In this paper, we investigate novel mechanisms for efficient B-twig pattern matching. In particular, we introduce &#x201C;B-twig normalization&#x201D; as an important first-step in our approach toward eventually conquering the complexity of B-twigs, and then present BTwigMerge&#x2014;the first holistic twig join algorithm designed for B-twigs. Both analytical and experimental results show that BTwigMerge is optimal for B-twig patterns with AD (Ancestor-Descendant) edges and/or PC (Parent-Child) edges. © 2012 IEEE.|
|Source Title:||IEEE Transactions on Knowledge and Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 7, 2017
WEB OF SCIENCETM
checked on Nov 29, 2017
checked on Dec 11, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.