Sciweavers

342 search results - page 25 / 69
» Conjunctive Queries over Trees
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 8 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SBBD
2004
106views Database» more  SBBD 2004»
13 years 9 months ago
Twisting the Metric Space to Achieve Better Metric Trees
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
César Feijó Nadvorny, Carlos A. Heus...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
Georg Gottlob, Thomas Schwentick
SIGMOD
1995
ACM
80views Database» more  SIGMOD 1995»
13 years 11 months ago
Join Queries with External Text Sources: Execution and Optimization Techniques
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
Surajit Chaudhuri, Umeshwar Dayal, Tak W. Yan