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 …

Katara: A data cleaning system powered by knowledge bases and crowdsourcing

X Chu, J Morcos, IF Ilyas, M Ouzzani, P Papotti… - Proceedings of the …, 2015 - dl.acm.org
Classical approaches to clean data have relied on using integrity constraints, statistics, or
machine learning. These approaches are known to be limited in the cleaning accuracy …

[HTML][HTML] Seedb: Efficient data-driven visualization recommendations to support visual analytics

M Vartak, S Rahman, S Madden… - Proceedings of the …, 2015 - ncbi.nlm.nih.gov
Data analysts often build visualizations as the first step in their analytical workflow. However,
when working with high-dimensional datasets, identifying visualizations that show relevant …

Data-Centric Systems and Applications

MJ Carey, S Ceri, P Bernstein, U Dayal, C Faloutsos… - Italy: Springer, 2006 - Springer
The rapid growth of the Web in the past two decades has made it the largest publicly
accessible data source in the world. Web mining aims to discover useful information or …

Finding related tables in data lakes for interactive data science

Y Zhang, ZG Ives - Proceedings of the 2020 ACM SIGMOD International …, 2020 - dl.acm.org
Many modern data science applications build on data lakes, schema-agnostic repositories
of data files and data products that offer limited organization and management capabilities …

Managing uncertainty and vagueness in description logics for the semantic web

T Lukasiewicz, U Straccia - Journal of Web Semantics, 2008 - Elsevier
Ontologies play a crucial role in the development of the Semantic Web as a means for
defining shared terms in web resources. They are formulated in web ontology languages …

Top-k query processing in uncertain databases

MA Soliman, IF Ilyas, KCC Chang - 2007 IEEE 23rd …, 2006 - ieeexplore.ieee.org
Top-k processing in uncertain databases is semantically and computationally different from
traditional top-k processing. The interplay between score and uncertainty makes traditional …

Spark: top-k keyword query in relational databases

Y Luo, X Lin, W Wang, X Zhou - Proceedings of the 2007 ACM SIGMOD …, 2007 - dl.acm.org
With the increasing amount of text data stored in relational databases, there is a demand for
RDBMS to support keyword queries over text data. As a search result is often assembled …

Fairness in package-to-group recommendations

D Serbos, S Qi, N Mamoulis, E Pitoura… - Proceedings of the 26th …, 2017 - dl.acm.org
Recommending packages of items to groups of users has several applications, including
recommending vacation packages to groups of tourists, entertainment packages to groups of …

Continuous monitoring of top-k queries over sliding windows

K Mouratidis, S Bakiras, D Papadias - Proceedings of the 2006 ACM …, 2006 - dl.acm.org
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with
the highest scores according to f. Even though the problem is well-studied in conventional …