Efficient Structure Oriented Storage of XML Documents Using ORDBMS
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Column-oriented database systems
Proceedings of the VLDB Endowment
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
| Hi-index | 0.00 |
This paper considers schemaless XML data stored in a column-oriented storage, particularly in C-store. A two-level model of C-store based on XML-enabled relational databases is supposed. The axes of XPath language in this environment have been studied in [3]. A low level memory system enables the estimation of the number of two abstract operations providing an interface to an external memory. The algorithms developed are mostly of logarithmic complexity in n, where n is the number of nodes of XML tree associated with an XML document. Here we extend the approach to the XPath fragment using only child and descendant axes and estimate the complexity of evaluating its queries.