Please use this identifier to cite or link to this item:
|Title:||Processing XML twig pattern query with wildcards|
|Citation:||Wu, H.,Lin, C.,Ling, T.W.,Lu, J. (2012). Processing XML twig pattern query with wildcards. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7446 LNCS (PART 1) : 326-341. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-32600-4_24|
|Abstract:||In this paper, we present a novel and complementary technique to optimize XML twig pattern queries with wildcards(*). Our approach is based on utilizing a new axis called AD-dis, to equivalently rewrite a query with wildcards (non-branching as well as branching wildcards) into a single query without any wildcards. We present efficient rewriting algorithms and also twig pattern matching algorithms to process the rewritten queries with AD-dis, which is proven to be I/O and CPU optimal. In addition, the experimental results not only verify the scalability and efficiency of our extended matching algorithms, but also demonstrate the effectiveness of our rewriting algorithms. © 2012 Springer-Verlag.|
|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 Dec 10, 2018
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.