ACM Home Page
Please provide us with feedback. Feedback
ORDPATHs: insert-friendly XML node labels
Full text PdfPdf (101 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Industrial sessions: the marriage of XML and relational databases table of contents
Pages: 903 - 908  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Patrick O'Neil  University of Massachusetts Boston
Elizabeth O'Neil  University of Massachusetts Boston
Shankar Pal  Microsoft Corporation
Istvan Cseri  Microsoft Corporation
Gideon Schaller  Microsoft Corporation
Nigel Westbury  Microsoft Corporation
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 124,   Citation Count: 50
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1007568.1007686
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
P. Bohannon, J. Freire, P. Roy, J. Simeon. From XML Schema to Relations: A Cost-Based Approach to XML Storage. ICDE 2002.
 
3
E. Cohen, H. Kaplan, T. Milo. Labeling Dynamic XML. PODS 2002.
4
5
 
6
E. Rahm., T. Böhme: XMach-1: A Multi-User Benchmark for XML Data Management. Proc. VLDB workshop Efficiency and Effectiveness of XML Tools, and Techniques (EEXTT2002), Hong Kong, August 2002.
 
7
A. R. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, R. Busse. XMark: A Benchmark for XML Data Management. Proc. VLDB, Hong Kong, August 2002.
 
8
J. Shanmugasundaram, R. Krishnamurthy, I. Tatarinov. A General Technique for Querying XML Documents using a Relational Database System, SIGMOD 2001.
9
 
10
F. Yergeau, UTF-8, A Transformation Format of ISO 10646. Request for Comments 2279, January 1998.
11

CITED BY  50
Collaborative Colleagues:
Patrick O'Neil: colleagues
Elizabeth O'Neil: colleagues
Shankar Pal: colleagues
Istvan Cseri: colleagues
Gideon Schaller: colleagues
Nigel Westbury: colleagues