Loading...
Please wait, while we are loading the content...
Similar Documents
ORDPATHs: Insert-Friendly XML Node Labels
| Content Provider | CiteSeerX |
|---|---|
| Author | Westbury, Nigel |
| 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. 1. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Ordpath Value Display Format Simple Byte-by-byte Comparison Insert-friendly Xml Node Label Xml Tree Ordpath Scheme Upcoming Version New Node Ordpath Label Node Old Node Ancestry Relationship Microsoft Sql Server Ordpath Value Compressed Binary Representation Hierarchical Labeling Scheme Document Order |
| Content Type | Text |