Storing and querying ordered XML using a relational database system

1,917 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Labeling dynamic XML trees (2002, neutral): “The integer-based prefix labeling scheme [17], called the Dewey labeling scheme, assigns the integer i to the ith child of a node.”
XRANK: ranked keyword search over XML documents (2003, methodology): “The idea of Dewey IDs is not new, and it has been used in the context of general knowledge classification, tree addressing [20], querying LDAP hierarchies [22] and ordered XML data [31].”
MonetDB/XQuery: a fast XQuery processor powered by a relational engine (2006, background): “The database research and industry communities have developed a variety of possible alternatives, among these [30, 25, 41, 38].”
From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching (2005, methodology): “In this paper, motivated by the existing Dewey ID [22], we propose a new powerful labeling scheme, called extended Dewey ID (for short, extended Dewey ).”
Holistic Twig Joins on Indexed XML Documents (2003, background): “Finding all occurrences of a twig pattern is a core operation in XML query processing [6, 13, 10, 15].”