189 search results - page 1 / 38 » Approximating predicates and expressive queries on probabili... |
PODS
2008
ACM
14 years 4 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
VLDB
1998
ACM
13 years 8 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
SIGMOD
2007
ACM
14 years 4 months ago
2007
ACM
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
PODS
2010
ACM
13 years 6 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
DASFAA
2007
IEEE
13 years 11 months ago
2007
IEEE
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...