Project to compress RDF data. The idea is to avoid redundant triples by learning rules to be applied on to sub graphs (which are essentially sets of subjects). These rules we will replace the triples and will produce the same triples on decompression. Further decompression is acchieved by rule subsumption hierachies through our notion of super rules.

This Project is a research prototype. Developed by the AKSW research group at the University of Leipzig: http://aksw.org/About.html

##Installation :one: Clone the latest version: git clone -b master https://github.com/KLyko/RDFCompressor-SCARO.git 2️⃣ ???

##Requirements Java 7, Maven 3

##Documentation [http://aksw.org/projects/SCARO]

##Bugs Found a 🐛 bug? Open an issue.