250 search results - page 14 / 50 » Tree pattern query minimization |
164
click to vote
ISMIS
2000
Springer
15 years 9 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
142
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
178
click to vote
DOCENG
2003
ACM
15 years 11 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
157
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
175
click to vote
DASFAA
2007
IEEE
16 years 5 days ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...