Abstract
Querying XML has been the subject of much recent investigation. A formal bulk algebra is essential for applying database-style optimization to XML queries. We develop such an algebra, called TAX (Tree Algebra for XML), for manipulating XML data, modeled as forests of labeled ordered trees. Motivated both by aesthetic considerations of intuitiveness, and by efficient computability and amenability to optimization, we develop TAX as a natural extension of relational algebra, with a small set of operators. TAX is complete for relational algebra extended with aggregation, and can express most queries expressible in popular XML query languages. It forms the basis for the Timber XML database system currently under development by us.
Cite
CITATION STYLE
Jagadish, H. V., Lakshmanan, L. V. S., Srivastava, D., & Thompson, K. (2002). TAX: A tree algebra for XML. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2397, pp. 149–164). Springer Verlag. https://doi.org/10.1007/3-540-46093-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
