Top-K Shortest Paths in Large Typed RDF Datasets Challenge

  title={Top-K Shortest Paths in Large Typed RDF Datasets Challenge},
  author={Ioannis Papadakis and Michalis Stefanidakis and Phivos Mylonas and Brigitte Endres-Niggemeyer and Spyridon Kazanas},
Perhaps the most widely appreciated linked data principle instructs linked data providers to provide useful information using the standards (i.e., RDF and SPARQL). Such information corresponds to patterns expressed as SPARQL queries that are matched against the RDF graph. Until recently, patterns had to specify the exact path that would match against the underlying graph. The advent of the SPARQL 1.1 Recommendation introduced property paths as a new graph matching paradigm that allows the… 
Navigational queries as property path queries employing the Kleene star operator
This paper proposes a generic SPARQL rewriting method that facilitates the execution of property path queries employing Kleene star * (and it's variant +) unary operators and is further extended through the employment of the RDF-Type Summary graph in an effort to reduce query execution time.
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.
FedS: Towards Traversing Federated RDF Graphs
This paper proposes a federated approach – called FedS – that retrieves paths from multiple RDF triple stores in a peer-to-peer manner thus reducing the computational burden on a centralised query processing server.
Linked open knowledge organization systems: definition of a method for reducing the traversing
This paper proposes a method to identify irrelevant nodes on an open graph, thus reducing the time and the scope of the graph path and maximizing the possibilities of finding more relevant results.


Sparqling kleene: fast property paths in RDF-3X
This paper presents a detailed account of integrating the recently proposed highly compact reachability index called FERRARI into the RDF-3X engine to support property path evaluation and develops a set of queries over real-world RDF data that can serve as benchmark set for evaluating the efficiency of property path queries.
G-SPARQL: a hybrid engine for querying large attributed graphs
An algebraic compilation mechanism for the proposed query language, G-SPARQL, which is extended from the relational algebra and based on the basic construct of building SPARQL queries, the Triple Pattern is described.
Top-k Shortest Paths in Directed Labeled Multigraphs
This paper implemented a solution method based on Eppstein’s algorithm which was able to solve all tasks of the ESWC 2016 Top-k Shortest Path Challenge while achieving only moderate overhead compared to the original version.
Using Triple Pattern Fragments to Enable Streaming of Top-k Shortest Paths via the Web
An approach to top-k shortest pathfinding, which optimally translates a pathfinding query into sequences of triple pattern fragment requests, and how this approach behaves using a training dataset, a subset of DBpedia with 10 million triples, and the trade-offs to a SPARQL approach.
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
It is shown that any implementation that adheres to the SPARQL 1.1 specification is doomed to show the same behavior, the key issue being the need for counting solutions imposed by the current specification.
Modified MinG Algorithm to Find Top-K Shortest Paths from large RDF Graphs
MinG algorithm indexes large RDF graphs in an efficient way and then uses the index to answer all path queries between two nodes of the graph and was modified to answer top-K shortest paths.
Querying Semantic Data on the Web?
The goal of this paper is to introduce SPARQL, which is a fundamental technology for the development of the Semantic Web, and to present some interesting and non-trivial problems on RDF data management at a Web scale, that the database community should address.
Maintaining order in a linked list
The paper concludes with two applications: determining ancestor relationships in a growing tree and maintaining a tree structured environment (context tree) for linked lists.
Improving Semantic Relatedness in Paths for Storytelling with Linked Data on the Web
This work proposes to improve the semantic relatedness of concepts mentioned in a story by increasing the relevance of links between nodes through additional domain delineation and refinement steps and proposes the implementation of an optimized algorithm controlling the pathfinding process to obtain more homogeneous search domain and retrieve more links between adjacent hops in each path.
Fast Algorithms for Solving Path Problems
A method to compute path expressions by dividing G into components, computing path expressions on the components by Gaussian elimination, and combining the solutions is described, which requires O(m $\alpha$(m,n) time on a reducible flow graph.