On supporting containment queries in relational database management systems

By Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, Qiong Luo, G. Lohman. ACM SIGMOD Conference, 2001

897 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/387e290dfd914cc2bfa4a8d76386cad4c0b882d0

How researchers see this paper

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

In Computer Networks and Communications

In Signal Processing

Citations in the corpus

Skew handling techniques in sort-merge join (2002, neutral): “Inequality predicates, such as found in band join(to be discussed in detail later), intemporal join[19] and temporal Cartesian product [22], and inmulti-predicate merge join[21] andEEJoin andEA-Join [14] proposed for queries on XML data, exacerbate the problem.”
Efficient Structural Joins on Indexed XML Documents (2002, background): “One approach is to assign to each tree node three numbers, namely: the node's preorder and postorder ranks as well as its level in the XML tree [13] [40] [24] [1] [19].”
Efficiently mining frequent trees in a forest: algorithms and applications (2005, methodology): “To efficiently answer ancestor-descendant queries various node numbering schemes similar to ours have been proposed [1], [22], [ 42 ].”
Storing and querying ordered XML using a relational database system (2002, background): “A recent study [24] concluded that a multi-predicate merge join should be used to evaluate containment predicates like the one above.”
Indexing and Querying XML Data for Regular Path Expressions (2001, methodology): “A recent work has proposed to use the position and depth of a tree node for indexing each occurrence of XML elements [25].”
eXist: An Open Source Native XML Database (2002, methodology): “Backend implementation details are completely hidden from eXist’s core (see figure 1).”
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].”
XMark: A Benchmark for XML Data Management (2002, background): “Some mappings like [26] which store the extent of tags, i.e. , not only the position of the start tag but also that of the corresponding end tag, may be able to exploit this additional information and achieve good running times.”
ORDPATHs: insert-friendly XML node labels (2004, neutral): “INTRODUCTION Relational database systems are now commonly used for XML data storage and update [9], [8], [11].”
From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching (2005, methodology): “Then Zhang et al.[27] introduced it to XML query processing using inverted list.”
Efficiently mining frequent trees in a forest (2002, methodology): “To efficiently answer ancestordescendant queries various node numbering schemes similar to ours have been proposed [15, 23, 1].”
APEX: an adaptive path index for XML data (2002, background): “Examples of such index structures include DataGuides [13], T-indexes [18], the Index Fabric [8], and extensions of inverted indexes [16, 22].”
Holistic Twig Joins on Indexed XML Documents (2003, methodology): “…the pattern into a set of binary structural relationships (parent-child or ancestor-descendant) between pairs of nodes, then match each of the binary structural relationships against the XML database and (cid:12)nally stitch together the results from those basic matches [20, 9, 14, 4, 8, 19].”
Accelerating XPath location steps (2002, background): “In [18], the authors discuss relational support for containment queries of which our XPath axes window queries are instances.”
Holistic twig joins: optimal XML pattern matching (2002, methodology): “A straightforward generalization of the MPMGJN algorithm [27] for path queries proceeds one stream at a time to get all solutions.”