EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration
The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graph mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'
- Short Name / Acronym:
- EAGLE; 003500WKSTN00
- Version:
- 00
- Programming Language(s):
- Medium: X; OS: Linux; Compatibility: Workstation
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE
- Contributing Organization:
- Sreenivas R. Sukumar (ORNL) and Matt Sangkeun Lee (North Carolina State University)
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1232204
- Country of Origin:
- United States
Similar Records
Query optimization for graph analytics on linked data using SPARQL
Composing Data Parallel Code for a SPARQL Graph Engine