Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data - SIGMOD '02 2002
DOI: 10.1145/564712.564715
|View full text |Cite
|
Sign up to set email alerts
|

Storing and querying ordered XML using a relational database system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
209
0
2

Year Published

2005
2005
2015
2015

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 150 publications
(211 citation statements)
references
References 0 publications
0
209
0
2
Order By: Relevance
“…1, we assign each node an ID, which is its depthfirst visiting order, based on which we can get the variant of its Dewey label [9] by concatenating all IDs of its ancestors, e.g., for node 7, we denote its Dewey label as "1.2.5.7". Given two nodes u and v, u ≺ a v denotes u is an ancestor node of v, u a v denotes u ≺ a v or u = v. Hereafter, we do not differentiate a node's ID and its Dewey label if without ambiguity.…”
Section: Data Modelmentioning
confidence: 99%
“…1, we assign each node an ID, which is its depthfirst visiting order, based on which we can get the variant of its Dewey label [9] by concatenating all IDs of its ancestors, e.g., for node 7, we denote its Dewey label as "1.2.5.7". Given two nodes u and v, u ≺ a v denotes u is an ancestor node of v, u a v denotes u ≺ a v or u = v. Hereafter, we do not differentiate a node's ID and its Dewey label if without ambiguity.…”
Section: Data Modelmentioning
confidence: 99%
“…This positional representation can be easily implemented using either region encoding [13] or Dewey ID [14] . In the first case, pre(v) equals a tuple of three fields: (start; end; level).…”
Section: Data Model and Numbering Schemesmentioning
confidence: 99%
“…Wu used Dewey ID [14] to expedite the twig pattern matching on Version Tree [15] . Lu [5] proposed extended Dewey scheme to derive paths of any element.…”
Section: Related Workmentioning
confidence: 99%