Sciweavers

386 search results - page 2 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
WWW
2004
ACM
14 years 7 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...
CIDR
2003
178views Algorithms» more  CIDR 2003»
13 years 8 months ago
Automated Ranking of Database Query Results
Ranking and returning the most relevant results of a query is a popular paradigm in Information Retrieval. We discuss challenges and investigate several approaches to enable ranki...
Sanjay Agrawal, Surajit Chaudhuri, Gautam Das, Ari...
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 1 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 8 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi