Sciweavers

912 search results - page 16 / 183
» Inductive Databases as Ranking
Sort
View
TKDE
2010
274views more  TKDE 2010»
13 years 6 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
WWW
2004
ACM
14 years 8 months ago
Providing ranked relevant results for web database queries
Often Web database users experience difficulty in articulating their needs using a precise query. Providing ranked set of possible answers would benefit such users. We propose to ...
Ullas Nambiar, Subbarao Kambhampati
SSDBM
2008
IEEE
107views Database» more  SSDBM 2008»
14 years 1 months ago
ProUD: Probabilistic Ranking in Uncertain Databases
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
SSD
1995
Springer
97views Database» more  SSD 1995»
13 years 11 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
ICALP
2007
Springer
14 years 1 months ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel