theMonadicNomad / GraphQueries

Implementing GraphQueries in Haskell using Reachability Queries

GraphQueries

Implementing GraphQueries in Haskell using Reachability Queries. The Graph Queries are implemeted on top of Daison (DAta lISt comprehensiON). In this project we evaluate the following three algorithms,

1. Implementing Reachability Queries for Acyclic Statig graphs using AILabel (Augmented Interval Labelling) Approach (https://doi.org/10.1007/978-3-319-25255-1_46)
2. Implementing Reachability Queries for Acyclic Dynamic graphs using D-AILabel (Dynamic Augmented Interval Labelling) approach.
3. Implementing Reachability Queries for Acyclic Dynamic graphs using D-AILabel with smart relabelling technique (https://dl.acm.org/doi/10.5555/647912.740822)

Project structure

• app/ - Haskell source code.

  • MainProject.hs/ - Starts the program
  • AILabel.hs/ - Implementation of AILabel Algorithm
  • DAILabel.hs/ - Implementation of D-AILabel algorithm
  • DAILabelModified.hs/ - Implementation of D-AILabel with smart relabelling technique.

• Reports/ - reports

How to run the application

Go to /DAILabel folder

stack build --exec main-exe