Please use this identifier to cite or link to this item:
|Title:||TJFast: Effective processing of XML twig pattern matching|
|Keywords:||Holistic twig join|
|Citation:||Lu, J.,Chen, T.,Ling, T.W. (2005). TJFast: Effective processing of XML twig pattern matching. 14th International World Wide Web Conference, WWW2005 : 1118-1119. ScholarBank@NUS Repository. https://doi.org/10.1145/1062745.1062897|
|Abstract:||Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process a twig query based on region encoding. In this paper, based on a novel labeling scheme: extended Dewey, we propose a novel and efficient holistic twig join algorithm, namely TJFast. Compared to previous work, our algorithm only needs to access the labels of leaf query nodes. We report our experimental results to show that our algorithms are superior to previous approaches in terms of the number of elements scanned and query performance.|
|Source Title:||14th International World Wide Web Conference, WWW2005|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 11, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.