Furthermore, we develop a practical algorithm for the tree homeomorphism decision problem that is both space- and time-efficient. The algorithm is in LOGDCFL ...
[PDF] Efficient algorithms for descendant-only tree pattern queries
www.cs.cornell.edu › ~goetz › pdf
Tree pattern matching is a fundamental problem that has a wide range of applications in. Web data management, XML processing, and selective data ...
Abstract. Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data ...
Efficient algorithms for descendant-only tree pattern queries. Tree pattern matching is a fundamental problem that has a wide range of applications in Web ...
Jan 20, 2015 · I'm looking for the most efficient algorithm to take a tree (stored as either a list of edges; OR as a list of mappings from parent node to a list of child ...
Missing: pattern | Show results with:pattern
Sep 20, 2010 · I want to place a representation of this graph in a relational database so that it's fast to compute all ancestors of a node, and all descendants of a node.
of only required-child and required-descendant ICs (i.e., no subtypes). These three algorithms represent substantial im- provement over the previously known ...
May 23, 2011 · The idea is simple - start a DFS from each person, finding the furthest descendant down in the family tree that was born before that person's death date.
Missing: queries. | Show results with:queries.
$29.90 Free delivery
Efficient algorithms for descendant-only tree pattern queries. Götz, M.; Koch, C.; Martens, W. Information Systems 34(7): 602-623. 2009. ISSN/ISBN: 0306-4379.
This corresponds to the well known semantics of XPath queries with descendant. Page 5. Algorithm 1 Tree pattern matching with descendant axes: Top-down ...