Designing fair ranking schemes

A Asudeh, HV Jagadish, J Stoyanovich… - Proceedings of the 2019 …, 2019 - dl.acm.org
Items from a database are often ranked based on a combination of criteria. The weight given
to each criterion in the combination can greatly affect the fairness of the produced ranking …

Social professional networks: A survey and taxonomy

MA Brandão, MM Moro - Computer Communications, 2017 - Elsevier
Social professional networks provide features not available in other networks. For example,
LinkedIn and AngelList facilitate professional networking, and GitHub enables committing …

SnipSuggest: Context-aware autocompletion for SQL

N Khoussainova, YC Kwon, M Balazinska… - Proceedings of the …, 2010 - dl.acm.org
In this paper, we present SnipSuggest, a system that provides on-the-go, context-aware
assistance in the SQL composition process. SnipSuggest aims to help the increasing …

[PDF][PDF] Klee: A framework for distributed top-k query algorithms

S Michel, P Triantafillou, G Weikum - … conference on Very large data bases, 2005 - Citeseer
This paper addresses the efficient processing of top-k queries in wide-area distributed data
repositories where the index lists for the attribute values (or text terms) of a query are …

Keyword search in relational databases

J Park, S Lee - Knowledge and Information Systems, 2011 - Springer
This paper surveys research on enabling keyword search in relational databases. We
present fundamental characteristics and discuss research dimensions, including data …

Probabilistic information retrieval approach for ranking of database query results

S Chaudhuri, G Das, V Hristidis, G Weikum - ACM Transactions on …, 2006 - dl.acm.org
We investigate the problem of ranking the answers to a database query when many tuples
are returned. In particular, we present methodologies to tackle the problem for conjunctive …

Interactive query refinement

C Mishra, N Koudas - Proceedings of the 12th International Conference …, 2009 - dl.acm.org
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the
query result. This has applications to the many/few answers problems often faced by …

Context-sensitive ranking

R Agrawal, R Rantzau, E Terzi - Proceedings of the 2006 ACM SIGMOD …, 2006 - dl.acm.org
Contextual preferences take the form that item i1 is preferred to item i 2 in the context of X.
For example, a preference might state the choice for Nicole Kidman over Penelope Cruz in …

Précis: from unstructured keywords as queries to structured databases as answers

A Simitsis, G Koutrika, Y Ioannidis - The VLDB Journal, 2008 - Springer
Précis queries represent a novel way of accessing data, which combines ideas and
techniques from the fields of databases and information retrieval. They are free-form …

Addressing diverse user preferences in sql-query-result navigation

Z Chen, T Li - Proceedings of the 2007 ACM SIGMOD international …, 2007 - dl.acm.org
Database queries are often exploratory and users often find their queries return too many
answers, many of them irrelevant. Existing work either categorizes or ranks the results to …