Sciweavers

6 search results - page 1 / 2
» Probabilistic top-k and ranking-aggregate queries
Sort
View
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 11 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
13 years 1 months 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...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 11 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
14 years 11 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
13 years 2 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang