Massive graph-structured data collections are ubiquitous in contemporary data management scenarios such as social networks, linked open data, and chemical compound databases.
The selection and manipulation of paths forms the core of querying graph datasets. Path indexing techniques can speed up this core functionality of querying graph datasets.
We propose a path-index based graph database engine.
|
Functionality regarding costing physical plans. |
|
|
Bundle all the data classes we will be using throughout the Telepath module. |
|
|
This package holds the wrapper to convert from and to the data classes from PathDB. |
|
|
Since we are dealing with pathIds instead of lists with edge labels, we've got stores to hold these mappings. |
|
|
Evaluate a physical plan in order to retrieve results. |
|
|
Wrapper for the path index from the PathDB module. |
|
|
Utilities regarding the path index. A GMark importer for example. |
|
|
We should have control over our data and caching mechanism. |
|
|
Spliterator extension for Java streams. |
|
|
com.github.giedomak.telepath.physicaloperators.sortmergejoin |
|
|
Enumerate and find the best physical-plan to give to the evaluation engine. |
|
|
Parse user input into a data-structure we can work with. |
|
|
Regular path query extension for the static parser package. |
|