What is it about?
A novel and scalable approach to index and query large data graphs. The idea is that they summarize a graph and instead of executing the query on the original graph, they execute it on the summaries. The authors experiments with Yago (16M triples) have shown that e.g., a query with 4 levels costs 62 sec using Oracle but it only costs about 0.6 sec with their index. Their index can be implemented on top of any Graph database, but they chose to implement it as an extension to Oracle on top of the SEM_MATCH table function. The paper also introduces disk-based versions of the Trace Equivalence and Bisimilarity algorithms to summarize data graphs, and discusses their complexity and usability for RDF graphs.
Featured Image
Why is it important?
Fast and easy way for querying RDF graph data using Oracle!
Perspectives
Novel and scalable approach for querying RDF graph data using Oracle!
Dr Mustafa Jarrar
Birzeit University
Read the Original
This page is a summary of: The Graph Signature, International Journal on Semantic Web and Information Systems, April 2015, IGI Global,
DOI: 10.4018/ijswis.2015040102.
You can read the full text:
Contributors
The following have contributed to this page
