ORDPATHs
Patrick Eugene O'Neil, Elizabeth J. O'Neil, Shankar Pal et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 2004
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft® SQL Server™. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case---a schema simplifies the problem). An example of an ORDPATH value display format is "1.5.3.9.1". A compressed binary representation of ORDPATH provides document order by simple byte-by-byte comparison and ancestry relationship equally simply. In addition, the ORDPATH scheme supports insertion of new nodes at arbitrary positions in the XML tree, their ORDPATH values "careted in" between ORDPATHs of sibling nodes, without relabeling any old nodes.
Cited by 378 works. doi:10.1145/1007568.1007686
Authors
References
- Data Structures and Algorithms
- Data Structures and Algorithms
- Storing and querying ordered XML using a relational database system
- UTF-8, a transformation format of ISO 10646
- On supporting containment queries in relational database management systems
- XMark
- Accelerating XPath location steps
- From XML schema to relations: a cost-based approach to XML storage
- A general technique for querying XML documents using a relational database system
- The XML web