Sciweavers

735 search results - page 2 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 10 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 3 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 10 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
ICDM
2010
IEEE
130views Data Mining» more  ICDM 2010»
13 years 6 months ago
Using Taxonomies to Perform Aggregated Querying over Imprecise Data
-- In this paper, we put forward our approach for answering aggregated queries over imprecise data using domain specific taxonomies. A new concept we call the weighted hierarchical...
Atanu Roy, Chandrima Sarkar, Rafal A. Angryk
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
15 years 8 months ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...