Sciweavers

493 search results - page 8 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
VLDB
2004
ACM
96views Database» more  VLDB 2004»
14 years 21 days ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
14 years 8 months ago
Answering Imprecise Queries over Autonomous Web Databases
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
Ullas Nambiar, Subbarao Kambhampati
ICDE
2010
IEEE
272views Database» more  ICDE 2010»
14 years 7 months ago
SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information abo...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
VLDB
1999
ACM
91views Database» more  VLDB 1999»
13 years 11 months 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
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 7 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