Lore: a database management system for semistructured data
ACM SIGMOD Record
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Honey, I shrunk the XQuery!: an XML algebra optimization approach
Proceedings of the 4th international workshop on Web information and data management
Navigation-Driven Evaluation of Virtual Mediated Views
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
The VLDB Journal — The International Journal on Very Large Data Bases
Anatomy of a native XML base management system
The VLDB Journal — The International Journal on Very Large Data Bases
A comprehensive XQuery to SQL translation using dynamic interval encoding
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
TIMBER: a native system for querying XML
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Tree logical classes for efficient evaluation of XQuery
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Pattern tree algebras: sets or sequences?
VLDB '05 Proceedings of the 31st international conference on Very large data bases
| Hi-index | 0.00 |
Relational algebra has been a crucial foundation for relational database systems, and has played a large role in enabling their success. A corresponding XML algebra for XML query processing has been more elusive, due to the comparative complexity of XML, and its history. We argue that having a sound algebraic basis remains important nonetheless. In this paper, we show how the complexity of XML can be modeled effectively in a simple algebra, and how the conceptual clarity attained thereby can lead to significant benefits.