Discovering Diversified Paths in Knowledge Bases

  title={Discovering Diversified Paths in Knowledge Bases},
  author={Christian Aebeloe and Gabriela Montoya and Vinay Setty and Katja Hose},
  journal={Proc. VLDB Endow.},
Vast amounts of world knowledge is now accessible through Knowledge Graphs (KGs) in RDF format and can be queried using SPARQL. Yet, finding paths between nodes in such graphs is not part of the official SPARQL 1.1 standard; only the simpler functionality of checking reachability is supported, i.e., assessing whether two nodes are connected based on certain conditions formalized as property paths but without providing information on how they are actually connected. To close this gap of… 

Figures from this paper

Query-Based Entity Comparison in Knowledge Graphs Revisited

This paper expands the language of similarity queries to consider a richer fragment of SPARQL allowing for numeric filter expressions, and proposes and implements a scalable algorithm that is guaranteed to compute a similarity query, but not necessarily a most specific one.

Integrating connection search in graph queries

This work formally shows how to integrate connecting tree patterns (CTPs) within a graph query language such as SPARQL or Cypher, leading to an Extended Query Language (or EQL), and proposes an efficient pruning technique to cope with very large search spaces.

Top-K Diversification for Path Queries in Knowledge Graphs

A generalized topk ranking technique that balances the trade-off between relevance and diversity and a shortest path based relevance scoring in combination with several path similarity measures for diversification is proposed.



Counting to k or how SPARQL1.1 Property Paths Can Be Extended to Top-k Path Queries

This paper extends SPARQL 1.1 property paths in a manner that allows to compute and return the k shortest paths matching a property path expression between two nodes, showing that a relatively simple approach works more efficiently than other, more complex algorithms in the literature in practical use cases.

Explaining and Querying Knowledge Graphs by Relatedness

We demonstrate RECAP, a tool that explains relatedness between entities in Knowledge Graphs (KGs) and implements a query by relatedness paradigm that allows to retrieve entities related to those in

Processing Aggregate Queries in a Federation of SPARQL Endpoints

This work proposes a set of query processing strategies and the associated Cost-based Optimizer for Distributed Aggregate queries (CoDA) for executing aggregate SParQL queries over federations of SPARQL endpoints and shows that CoDA significantly improves performance over current state-of-the-art systems.

Optimizing Aggregate SPARQL Queries Using Materialized RDF Views

The approach consists of a view selection algorithm based on an associated RDF-specific cost model, a view definition syntax, and an algorithm for rewriting SPARQL queries using materialized RDF views that can improve query response time while effectively handling RDF specifics.

Instant Espresso: Interactive Analysis of Relationships in Knowledge Graphs

The demonstrated InstantEspresso system can be used to provide background information on the current state ofaffairs between real-world entities such as politicians, organizations, and the like, e.g. to a journalist preparing an article involving the entities of interest.

The Odyssey Approach for Optimizing Federated SPARQL Queries

O Odyssey is presented, an approach that uses statistics that allow for a more accurate cost estimation for federated queries and therefore enables Odyssey to produce better query execution plans that are better in terms of data transfer and execution time than state-of-the-art optimizers.

DBpedia: A Nucleus for a Web of Open Data

The extraction of the DBpedia datasets is described, and how the resulting information is published on the Web for human-andmachine-consumption and how DBpedia could serve as a nucleus for an emerging Web of open data.

YAGO3: A Knowledge Base from Multilingual Wikipedias

This work fuses the multilingual information with the English WordNet to build one coherent knowledge base that combines the information from the Wikipedias in multiple languages, and enlarges YAGO by 1m new entities and 7m new facts.

An analysis of approximations for maximizing submodular set functions—I

It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.