J. McHugh and J.Widom. Optimizing Branching Path Expressions. Technical report, Stanford University, Database Group, June 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Warp-Edge Optimization in XPath - He, Dyreson (Correct)
....of queries) to prune the search space. Gardarin, Gruser and Tang propose a technique to optimize linear path expressions and produce a cheap query execution plan [14] Compile time path expansion [15] utilizes a DataGuide (a schema) to prune the search space, while branching path optimization [16] recognizes that queries that follow the same branch in a tree can share the cost of exploring that branch, as does warp edge optimization. Optimization in StruQL [17] combines both indexing and query rewriting. Warp edge optimization dynamically implements branching path optimization. 3 ....
J. McHugh and J.Widom. Optimizing Branching Path Expressions. Technical report, Stanford University, Database Group, June 1999.
View-Based Query Answering and Query Containment.. - Calvanese, De.. (2001) (4 citations) (Correct)
....queries (T2RPQ c s) in which the body of the query has the structure of a tree, if we view each variable as a node and each atom in the query as an edge. T2RPQ c s are a generalization of several subclasses of queries, including generalized path expressions [11, 3] and branching path queries [42, 44], which have been studied extensively both in semistructured and XML data. Notably, XPath expressions [26] can be captured by T2RPQ c s in which the transitive closure operator is used in a limited way. Semistructured data pose challenging problems to the research on databases [56] Among them, ....
J. McHugh and J. Widom. Optimizing branching path expressions. Technical report, Stanford University, 1999. Available at http://www-db.stanford.edu/pub/papers/mp.ps.
Following the paths of XML Data: An algebraic.. - Galanis, Viglas.. (2001) (6 citations) (Correct)
....significant shortcomings of both of these approaches, which led us to decide to define a new algebra. The problems we faced are summarized below: Schema information. Previous proposals for algebras require information on the structure of the XML document being queried. For example, MAG 97, MW99a] are heavily dependent on the existence of data guides, which provide a priori information on the interconnections between the graph s vertices. 5 Even though data guides are dynamic, they need to be consulted at query compile time. Our algebra does not rely on an underlying schema. The ....
J. McHugh and J. Widom. Optimizing branching path expressions. Technical report, Stanford University, June 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC