florijan 8e1626d4fb LongRunning - batched edge creation improved. Verification before loop
Summary:
Batch creation now does not iterate over V**2 vertex pairs, but over V vertices and generates E/V random edges for each one. Assuming there is an index over :V(id), this is much more efficient and supports larger vertex counts (Ferenc: modify the test config as desired).

An additional requirement is that E/V (for each worker) is a whole number.

Reviewers: mferencevic

Reviewed By: mferencevic

Subscribers: pullbot

Differential Revision: https://phabricator.memgraph.io/D860
2017-10-05 13:51:54 +02:00
2017-09-27 09:04:31 +02:00
2017-10-05 13:12:39 +02:00
2017-10-04 17:29:53 +02:00
2017-10-03 16:40:40 +02:00
2017-08-24 10:45:35 +02:00
2017-03-03 13:33:45 +01:00
2017-09-27 16:25:19 +02:00
2017-06-02 08:59:49 +02:00
2016-12-20 15:49:52 +01:00
2017-08-28 10:19:14 +02:00
2017-07-29 17:46:24 +02:00

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.
Readme 62 MiB
Languages
C++ 70.6%
Python 14.1%
Gherkin 6.7%
Shell 2.9%
Common Lisp 1.5%
Other 4.2%