A survey of top-k query processing techniques in relational database systems

IF Ilyas, G Beskales, MA Soliman - ACM Computing Surveys (CSUR), 2008 - dl.acm.org
Efficient processing of top-k queries is a crucial requirement in many interactive
environments that involve massive amounts of data. In particular, efficient top-k processing …

Data integration with uncertainty

XL Dong, A Halevy, C Yu - The VLDB Journal, 2009 - Springer
This paper reports our first set of results on managing uncertainty in data integration. We
posit that data-integration systems need to handle uncertainty at three levels and do so in a …

[PDF][PDF] Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data.

ML Yiu, N Mamoulis - VLDB, 2007 - vldb.org
The top-k dominating query returns k data objects which dominate the highest number of
objects in a dataset. This query is an important tool for decision support since it provides …

Weakly supervised discriminative localization and classification: a joint learning process

MH Nguyen, L Torresani… - 2009 IEEE 12th …, 2009 - ieeexplore.ieee.org
Visual categorization problems, such as object classification or action recognition, are
increasingly often approached using a detection strategy: a classifier function is first applied …

A survey on representation, composition and application of preferences in database systems

K Stefanidis, G Koutrika, E Pitoura - ACM Transactions on Database …, 2011 - dl.acm.org
Preferences have been traditionally studied in philosophy, psychology, and economics and
applied to decision making problems. Recently, they have attracted the attention of …

Best position algorithms for efficient top-k query processing

R Akbarinia, E Pacitti, P Valduriez - Information Systems, 2011 - Elsevier
The general problem of answering top-k queries can be modeled using lists of data items
sorted by their local scores. The main algorithm proposed so far for answering top-k queries …

[LIBRO][B] Foundations of fuzzy logic and semantic web languages

U Straccia - 2013 - library.oapen.org
This book is the first to combine coverage of fuzzy logic and Semantic Web languages. It
provides in-depth insight into fuzzy Semantic Web languages for non-fuzzy set theory and …

Multi-dimensional top-k dominating queries

ML Yiu, N Mamoulis - The VLDB Journal, 2009 - Springer
The top-k dominating query returns k data objects which dominate the highest number of
objects in a dataset. This query is an important tool for decision support since it provides …

Efficient algorithms for k-regret minimizing sets

PK Agarwal, N Kumar, S Sintos, S Suri - arxiv preprint arxiv:1702.01446, 2017 - arxiv.org
A regret minimizing set Q is a small size representation of a much larger database P so that
user queries executed on Q return answers whose scores are not much worse than those on …

Probabilistic top-k and ranking-aggregate queries

MA Soliman, IF Ilyas, KCC Chang - ACM Transactions on Database …, 2008 - dl.acm.org
Ranking and aggregation queries are widely used in data exploration, data analysis, and
decision-making scenarios. While most of the currently proposed ranking and aggregation …