8000 GitHub - chaozhang-cs/rlc-index: This repository provides the RLC index, a reachability index for processing graph queries with a concatenation of edge labels under the Kleene operator.
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

This repository provides the RLC index, a reachability index for processing graph queries with a concatenation of edge labels under the Kleene operator.

License

Notifications You must be signed in to change notification settings

chaozhang-cs/rlc-index

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

RLC Index

This repository provides the RLC index, a reachability index for processing graph queries with a concatenation of edge labels under the Kleene operator.

For the technical details about the RLC index, please refer to our technical report: https://arxiv.org/abs/2203.08606

Organization

core is an implementation of the RLC index.

demo shows a simple demonstration of building and querying the RLC index.

benchmark contains the source code of the experiments in the technical report.

Getting Started

  1. Clone the project.
  2. Execute mvn clean package.

Reproducibility

In the rest of this section, suppose that we are in benchmark/

  1. Download the rlc-benchmarks.tar.gz file (2.89GB) contains the datasets and workloads used in the experiments of the technical report.

  2. Execute tar -czvf rlc-benchmarks.tar.gz.

  3. benchmark/benchmarks contains the datasets and workloads. Please see the technical report for their details.

  4. configurations contains JSON files for configuring the performance test. For example, real-graphs-indexing.json is used to configure the experiments of indexing time and index size, and real-graphs-querying.json is for the experiments of querying time. The default parameters in the configuration files skip the large datasets. To include them in the test, remove the corresponding values under the 'skippedGraphNames' entry in JSON files. Before doing this, please ensure that there is enough memory, e.g., at least 32GB for the dataset '08-soc-pokec-relationships', '09-wiki-topcats', and '10-wiki-Talk', or at least 80GB for the dataset '11-sx-stackoverflow', '12-soc-LiveJournal1-50', and '13-wikipedia_link_fr-25'.

  5. Execute nohup java -Xms16g -Xmx16g -cp target/benchmark-1.0-SNAPSHOT.jar org.jrpq.rlci.benchamrk.App & to start the performance test. Increase the memory when the large datasets are included. Building the extended transitive closure can take around 30 minutes for the smallest dataset in the benchmarks and cannot finish in 24 hours for the other datasets. To skip the extended transitive closure in the test, remove 'Etc' under the 'method' entry in the configuration files.

  6. The benchmark results are available under the directory benchmark/benchmark-results, which contains sub-directories with results of different tests.

About

This repository provides the RLC index, a reachability index for processing graph queries with a concatenation of edge labels under the Kleene operator.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%
0