DMCA
Path query processing on very large rdf graphs (2011)
| Venue: | In WebDB |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Gubichev11pathquery,
author = {Andrey Gubichev and Technische Universität München and Thomas Neumann and Technische Universität München},
title = {Path query processing on very large rdf graphs},
booktitle = {In WebDB},
year = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Finding the shortest path between two nodes in an RDF graph is a fundamental operation that allows to discover complex relationships between entities. In this paper we consider the path queries over graphs from a database perspective. We provide the full-fledge database solution to execute path queries over very large RDF graphs. We present low-level techniques to speed-up shortest paths algorithms, and a robust method to estimate selectivities of path queries. We perform extended experiments on several large RDF collections, including the UniProt collection, demonstrating that our approach outperforms the path query capabilities of modern systems by a large margin. 1.
Keyphrases
large rdf graph path query path query processing large margin extended experiment fundamental operation modern system complex relationship path query capability database perspective uniprot collection several large rdf collection rdf graph robust method speed-up shortest path full-fledge database solution present low-level technique
