A survey of top-k query processing techniques in relational database systems
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 …
environments that involve massive amounts of data. In particular, efficient top-k processing …
Principles of dataspace systems
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 …
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
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying
information needs. Recently, answering keyword queries on graph-structured data has …
information needs. Recently, answering keyword queries on graph-structured data has …
Querying knowledge graphs by example entity tuples
We witness an unprecedented proliferation of knowledge graphs that record millions of
entities and their relationships. While knowledge graphs are structure-flexible and content …
entities and their relationships. While knowledge graphs are structure-flexible and content …
Effective keyword search for valuable lcas over xml documents
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 …
begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately …
Probabilistic information retrieval approach for ranking of database query results
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 …
are returned. In particular, we present methodologies to tackle the problem for conjunctive …
Language-model-based ranking for queries on RDF-graphs
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 …
automatic information extraction from textual and Web sources have made it possible to …
TopX: efficient and versatile top-k query processing for semistructured data
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 language of the INEX benchmark series reflect the emerging interest in IR-style …
Query relaxation for entity-relationship search
Entity-relationship-structured data is becoming more important on the Web. For example,
large knowledge bases have been automatically constructed by information extraction from …
large knowledge bases have been automatically constructed by information extraction from …
Relationship queries on extended knowledge graphs
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 …
tuples of related entities and where a query often requires joining cues from multiple …