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
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Column-stores vs. row-stores: how different are they really?
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Column-store support for RDF data management: not all swans are white
Proceedings of the VLDB Endowment
SW-Store: a vertically partitioned DBMS for Semantic Web data management
The VLDB Journal — The International Journal on Very Large Data Bases
Column-oriented database systems
Proceedings of the VLDB Endowment
XPath fragments on XML in columns
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
| Hi-index | 0.00 |
C-store environment uses a relational database for storing table tuples on the disk by columns. Can it be effectively used as XML database? This paper considers XML data without a schema. A two-level model of C-store based on XML-enabled relational databases is proposed. A measure of the model suitability is the possibility of evaluating effectively XPath queries. The XPath fragment considered allows the node-test not referring to attribute values and text values. Child, descendant, parent, ancestor, siblings, and following (preceding) are just the XPath axes used here. Low level memory system enabling the estimation of the number of two abstract operations providing an interface to an external memory is characteristic for algorithms for each axis. We will show that our algorithms are mostly of logarithmic complexity in n, where n is the number of nodes of XML tree associated with a XML document.