Sciweavers

342 search results - page 2 / 69
» Conjunctive Queries over Trees
Sort
View
CSCLP
2006
Springer
13 years 9 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 6 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
IPL
2006
103views more  IPL 2006»
13 years 5 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 5 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton