Matija Santl 9ad7d82a54 Implement UNION query combinator
Summary:
Union query combinator implementation consists of:
 * adjustments to the AST and `cypher_main_visitor`
 * enabling `QueryStripper` to parse multiple `return` statements (not stopping after first)
 * symbol generation for union results
 * union logical operator
 * query plan generator adjustments

Reviewers: teon.banek, mislav.bradac

Reviewed By: teon.banek

Subscribers: pullbot, buda

Differential Revision: https://phabricator.memgraph.io/D1038
2017-12-13 09:54:00 +01:00
2017-12-12 14:59:54 +01:00
2017-12-13 09:54:00 +01:00
2017-11-23 09:20:53 +01:00
2017-12-12 14:59:54 +01:00
2017-12-13 09:54:00 +01:00
2017-12-13 09:54:00 +01:00
2017-12-12 20:14:30 +01:00
2017-12-12 14:59:54 +01:00
2017-12-06 14:28:34 +01:00
2017-12-13 09:54:00 +01:00
2017-12-12 14:59:54 +01:00
2017-11-06 10:54:15 +01:00
2016-12-20 15:49:52 +01: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%