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 …

Principles of dataspace systems

A Halevy, M Franklin, D Maier - Proceedings of the twenty-fifth ACM …, 2006 - dl.acm.org
The most acute information management challenges today stem from organizations relying
on a large number of diverse, interrelated data sources, but having no means of managing …

Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data

T Tran, H Wang, S Rudolph… - 2009 IEEE 25th …, 2009 - ieeexplore.ieee.org
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying
information needs. Recently, answering keyword queries on graph-structured data has …

Querying knowledge graphs by example entity tuples

N Jayaram, A Khan, C Li, X Yan… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
We witness an unprecedented proliferation of knowledge graphs that record millions of
entities and their relationships. While knowledge graphs are structure-flexible and content …

Effective keyword search for valuable lcas over xml documents

G Li, J Feng, J Wang, L Zhou - … of the sixteenth ACM conference on …, 2007 - dl.acm.org
In this paper, we study the problem of effective keyword search over XML documents. We
begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately …

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 …

Language-model-based ranking for queries on RDF-graphs

S Elbassuoni, M Ramanath, R Schenkel… - Proceedings of the 18th …, 2009 - dl.acm.org
The success of knowledge-sharing communities like Wikipedia and the advances in
automatic information extraction from textual and Web sources have made it possible to …

TopX: efficient and versatile top-k query processing for semistructured data

M Theobald, H Bast, D Majumdar, R Schenkel… - The VLDB Journal, 2008 - Springer
Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI
query language of the INEX benchmark series reflect the emerging interest in IR-style …

Query relaxation for entity-relationship search

S Elbassuoni, M Ramanath, G Weikum - … , Crete, Greece, May 29–June 2 …, 2011 - Springer
Entity-relationship-structured data is becoming more important on the Web. For example,
large knowledge bases have been automatically constructed by information extraction from …

Relationship queries on extended knowledge graphs

M Yahya, D Barbosa, K Berberich, Q Wang… - Proceedings of the …, 2016 - dl.acm.org
Entity search over text corpora is not geared for relationship queries where answers are
tuples of related entities and where a query often requires joining cues from multiple …