0aee18544db2a7f05ef29fa4bcb3f48aa4775538
Summary: Benchmark planning and estimating indexed ScanAll. According to the benchmark, caching speeds up the whole process of planning and estimation by a factor of 2. Most of the performance gain is in the `CostEstimator` itself, due to plenty of calls to `VerticesCount` when estimating all of the generated plans. Reviewers: mislav.bradac, florijan Reviewed By: mislav.bradac Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D765
memgraph
Memgraph is an ACID compliant high performance transactional distributed in-memory graph database featuring runtime native query compiling, lock free data structures, multi-version concurrency control and asynchronous IO.
dependencies
Memgraph can be compiled using any modern c++ compiler. It mostly relies on the standard template library, however, some things do require external libraries.
Some code contains linux-specific libraries and the build is only supported on a 64 bit linux kernel.
- linux
- clang 3.8 (good c++11 support, especially lock free atomics)
- antlr (compiler frontend)
- cppitertools
- fmt format
- google benchmark
- google test
- glog
- gflags
Description
Open-source graph database, built for real-time streaming data, compatible with Neo4j.
cyphergraphgraph-algorithmsgraph-analysisgraph-databasekafkakafka-streamsnosqlopencypherstream-processingstreaming-data
Readme
62 MiB
Languages
C++
70.6%
Python
14.1%
Gherkin
6.7%
Shell
2.9%
Common Lisp
1.5%
Other
4.2%