Sciweavers

103 search results - page 9 / 21
» Efficient Indexing Methods for Probabilistic Threshold Queri...
Sort
View
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 7 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 7 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 9 months ago
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
14 years 9 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
14 years 1 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...