76 search results - page 1 / 16 » Boolean ranking: querying a database by k-constrained opti... |
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
VLDB
2007
ACM
13 years 11 months ago
2007
ACM
A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this q...