Please use this identifier to cite or link to this item:
|Title:||Efficient processing of ordered XML twig pattern||Authors:||Lu, J.
|Issue Date:||2005||Citation:||Lu, J.,Ling, T.W.,Yu, T.,Li, C.,Ni, W. (2005). Efficient processing of ordered XML twig pattern. Lecture Notes in Computer Science 3588 : 300-309. ScholarBank@NUS Repository.||Abstract:||Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results. The existing holistic join algorithms, however, cannot deal with ordered twig queries. A straightforward approach that first matches the unordered twig queries and then prunes away the undesired answers is obviously not optimal in most cases. In this paper, we study a novel holistic-processing algorithm, called OrderedTJ, for ordered twig queries. We show that OrderedTJ can identify a large query class to guarantee the I/O optimality. Finally, our experiments show the effectiveness, scalability and efficiency of our proposed algorithm. © Springer-Verlag Berlin Heidelberg 2005.||Source Title:||Lecture Notes in Computer Science||URI:||http://scholarbank.nus.edu.sg/handle/10635/40930||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 Sep 22, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.