Sciweavers

929 search results - page 2 / 186
» Answering imprecise database queries: a novel approach
Sort
View
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 6 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 8 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
SSDBM
1999
IEEE
108views Database» more  SSDBM 1999»
13 years 9 months ago
Supporting Imprecision in Multidimensional Databases Using Granularities
On-Line Analytical Processing (OLAP) technologies are being used widely, but the lack of effective means of handling data imprecision, which occurs when exact values are not known...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
VLDB
1990
ACM
116views Database» more  VLDB 1990»
13 years 9 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
AAAI
2006
13 years 6 months ago
Supporting Queries with Imprecise Constraints
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
Ullas Nambiar, Subbarao Kambhampati