Sciweavers

1588 search results - page 26 / 318
» Consistent query answering in databases
Sort
View
VLDB
1999
ACM
91views Database» more  VLDB 1999»
14 years 23 days ago
Probabilistic Optimization of Top N Queries
The problem of nding the best answers to a query quickly, rather than nding all answers, is of increasing importance as relational databases are applied in multimedia and decision...
Donko Donjerkovic, Raghu Ramakrishnan
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 8 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 8 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
WAIM
2010
Springer
13 years 6 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
ICDT
2001
ACM
110views Database» more  ICDT 2001»
14 years 29 days ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang