Please use this identifier to cite or link to this item:
|Title:||A hybrid approach for general XML query processing||Authors:||Wu, H.
|Issue Date:||2012||Citation:||Wu, H.,Tang, R.,Ling, T.W.,Zeng, Y.,Bressan, S. (2012). A hybrid approach for general XML query processing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7446 LNCS (PART 1) : 10-25. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-32600-4_3||Abstract:||The state-of-the-art XML twig pattern query processing algorithms focus on matching a single twig pattern to a document. However, many practical queries are modeled by multiple twig patterns with joins to link them. The output of twig pattern matching is tuples of labels, while the joins between twig patterns are based on values. The inefficiency of integrating label-based structural joins in twig pattern matching and value-based joins to link patterns becomes an obstacle preventing those structural join algorithms in literatures from being adopted in practical XML query processors. In this paper, we propose a hybrid approach to bridge this gap. In particular, we introduce both relational tables and inverted lists to organize values and elements respectively. General XML queries involving several twig patterns are processed by the both data structures. We further analyze join order selection for a general query with both pattern matching and value-based join, which is essential for the generation of a good query plan. © 2012 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/41744||ISBN:||9783642325991||ISSN:||03029743||DOI:||10.1007/978-3-642-32600-4_3|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.