Sciweavers

105 search results - page 8 / 21
» Probabilistic ranked queries in uncertain databases
Sort
View
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
14 years 12 days ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
SSDBM
2008
IEEE
113views Database» more  SSDBM 2008»
15 years 4 months ago
Query Selectivity Estimation for Uncertain Data
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (p...
Sarvjeet Singh, Chris Mayfield, Rahul Shah, Sunil ...
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
15 years 11 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...
EDBT
2009
ACM
174views Database» more  EDBT 2009»
15 years 4 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...
DEXAW
2004
IEEE
88views Database» more  DEXAW 2004»
15 years 1 months ago
A Possible World Approach to Uncertain Relational Data
Data exchange between embedded systems and other small or large computing devices increases. Since data in different data sources may refer to the same real world objects, data ca...
Ander de Keijzer, Maurice van Keulen