TY - GEN
T1 - Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
AU - Sean, Boon Siew
AU - Widjanarko, Klarinda G.
AU - Bhowmick, Sourav S.
AU - Choi, Byron
AU - Leonardi, Erwin
PY - 2007/3/27
Y1 - 2007/3/27
N2 - In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage scheme which comprises only leaf nodes, their corresponding data values, order encodings and their root-to-leaf paths, (b) We propose an algorithm for mapping ordered XPATH queries into SQL queries over the storage scheme, (c) We propose an optimization technique that enforces all mapped SQL queries to be evaluated in a "left-to-right" join order. By employing these techniques, we show, through a comprehensive experiment, that our approach not only scales well but also performs better than some representative tree-unaware approaches on more than 65% of our benchmark queries with the highest observed gain factor being 1939. In addition, our approach reduces significantly the performance gap between tree-aware and tree-unaware approaches and even outperforms a state-of-the-art tree-aware approach for certain benchmark queries.
AB - In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage scheme which comprises only leaf nodes, their corresponding data values, order encodings and their root-to-leaf paths, (b) We propose an algorithm for mapping ordered XPATH queries into SQL queries over the storage scheme, (c) We propose an optimization technique that enforces all mapped SQL queries to be evaluated in a "left-to-right" join order. By employing these techniques, we show, through a comprehensive experiment, that our approach not only scales well but also performs better than some representative tree-unaware approaches on more than 65% of our benchmark queries with the highest observed gain factor being 1939. In addition, our approach reduces significantly the performance gap between tree-aware and tree-unaware approaches and even outperforms a state-of-the-art tree-aware approach for certain benchmark queries.
UR - http://www.scopus.com/inward/record.url?scp=38049156409&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-71703-4_66
DO - 10.1007/978-3-540-71703-4_66
M3 - Conference proceeding
AN - SCOPUS:38049156409
SN - 9783540717027
T3 - Lecture Notes in Computer Science
SP - 793
EP - 806
BT - Advances in Databases: Concepts, Systems and Applications
A2 - Kotagiri, Ramamohanarao
A2 - Krishna, P. Radha
A2 - Mohania, Mukesh
A2 - Nantajeewarawat, Ekawit
PB - Springer Berlin Heidelberg
T2 - 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007
Y2 - 9 April 2007 through 12 April 2007
ER -