Sciweavers

250 search results - page 14 / 50
» Tree pattern query minimization
Sort
View
ISMIS
2000
Springer
13 years 10 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
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...
C. A. Johnson
VLDB
2005
ACM
85views Database» more  VLDB 2005»
14 years 15 days ago
Pattern Tree Algebras: Sets or Sequences?
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...
Stelios Paparizos, H. V. Jagadish
DOCENG
2003
ACM
14 years 8 days ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
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 ...
Jean-Yves Vion-Dury
EDBT
2006
ACM
130views Database» more  EDBT 2006»
14 years 7 months ago
Querying and Updating Probabilistic Information in XML
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...
Serge Abiteboul, Pierre Senellart
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
14 years 1 months ago
TwigList : Make Twig Pattern Matching Fast
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...
Lu Qin, Jeffrey Xu Yu, Bolin Ding