• Publications
  • Influence
FedX: Optimization Techniques for Federated Query Processing on Linked Data
Motivated by the ongoing success of Linked Data and the growing amount of semantic data sources available on theWeb, new challenges to query processing are emerging. Especially in distributedExpand
  • 307
  • 60
Efficient creation and incremental maintenance of the HOPI index for complex XML document collections
The HOPI index, a connection index for XML documents based on the concept of a 2-hop cover, provides space- and time-efficient reachability tests along the ancestor, descendant, and link axes toExpand
  • 113
  • 16
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2–hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work onExpand
  • 162
  • 13
WARP: Workload-aware replication and partitioning for RDF
  • K. Hose, R. Schenkel
  • Computer Science
  • IEEE 29th International Conference on Data…
  • 8 April 2013
With the increasing popularity of the Semantic Web, more and more data becomes available in RDF with SPARQL as a query language. Data sets, however, can become too big to be managed and queried on aExpand
  • 78
  • 13
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, personal blogs,Expand
  • 159
  • 12
YAWN: A Semantically Annotated Wikipedia XML Corpus
The paper presents YAWN, a system to convert the well-known and widely used Wikipedia collection into an XML corpus with semantically rich, self-explaining tags. We introduce algorithms to annotateExpand
  • 121
  • 11
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 ranked retrieval overExpand
  • 103
  • 11
Exploiting social relations for query expansion and result ranking
Online communities have recently become a popular tool for publishing and searching content, as well as for finding and connecting to other users that share common interests. The content is typicallyExpand
  • 95
  • 11
RankReduce - Processing K-Nearest Neighbor Queries on Top of MapReduce
We consider the problem of processing K-Nearest Neighbor (KNN) queries over large datasets where the index is jointly maintained by a set of machines in a computing cluster. The proposed RankReduceExpand
  • 91
  • 10
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algorithm for evaluatingExpand
  • 264
  • 9