Sciweavers

189 search results - page 4 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
COOPIS
2004
IEEE
14 years 9 days ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
PPDP
2010
Springer
13 years 7 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
14 years 8 months ago
On Query Algebras for Probabilistic Databases
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
Christoph Koch
PODS
2004
ACM
131views Database» more  PODS 2004»
14 years 8 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
Piero A. Bonatti
PODS
1999
ACM
151views Database» more  PODS 1999»
14 years 26 days ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin