Sciweavers

785 search results - page 11 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
14 years 9 months ago
QPIAD: Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kamb...
CIKM
2010
Springer
13 years 6 months ago
Skyline query processing for uncertain data
Recently, several research efforts have addressed answering skyline queries efficiently over large datasets. However, this research lacks methods to compute these queries over un...
Mohamed E. Khalefa, Mohamed F. Mokbel, Justin J. L...
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
14 years 9 months ago
Confidence-Aware Join Algorithms
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
Parag Agrawal, Jennifer Widom
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav