Sciweavers

173 search results - page 6 / 35
» Efficient Rank Based KNN Query Processing Over Uncertain Dat...
Sort
View
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
15 years 9 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...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
14 years 11 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
15 years 11 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
TKDE
2008
234views more  TKDE 2008»
14 years 9 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
SIGMOD
2009
ACM
125views Database» more  SIGMOD 2009»
15 years 10 months ago
Top-k queries on uncertain data: on score distribution and typical answers
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
Tingjian Ge, Stanley B. Zdonik, Samuel Madden