Abstract
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. 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.