PAPER DIGEST
Most Influential SIGMOD 2004 Paper · 2026-03 edition

ORDPATHs: Insert-friendly XML Node Labels

Patrick O'Neil, Elizabeth O'Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, Nigel Westbury

Venue
ACM SIGMOD Conference (SIGMOD) 2004
Recognition
Most Influential SIGMOD 2004 Paper (Rank No. 4)
Edition
2026-03
Impact factor
6
Certificate ID
b5a9830257557789

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.

Download PDF certificate