EDBT 2026 Demo / reviewers in the wild / expert
Nigel Westbury
dblp:08/1699
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data models and query languages · 67% Data mining · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling › classification › structured classification
hierarchical labeling |
0.0 | 1 | 2004 | ORDPATHs: Insert-Friendly XML Node Labels · SIGMOD Conference 2004 |
Data models and query languages
XML data management |
0.0 | 1 | 2004 | ORDPATHs: Insert-Friendly XML Node Labels · SIGMOD Conference 2004 |
Data models and query languages › XML data management
XML labeling scheme |
0.0 | 1 | 2004 | ORDPATHs: Insert-Friendly XML Node Labels · SIGMOD Conference 2004 |
Methods — techniques the papers use, named apart from their topics
ORDPATH labeling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | ORDPATHs: Insert-Friendly XML Node LabelsabstractWe 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. Patrick E. O'Neil, Elizabeth J. O'Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, Nigel Westbury |
SIGMOD Conference | 6 |