Sciweavers

735 search results - page 4 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
VLDB
1990
ACM
116views Database» more  VLDB 1990»
14 years 1 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
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
14 years 11 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...
VLDB
2007
ACM
143views Database» more  VLDB 2007»
14 years 10 months ago
OLAP over Imprecise Data with Domain Constraints
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
Douglas Burdick, AnHai Doan, Raghu Ramakrishnan, S...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 1 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...
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 11 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham