memgraph/tests/benchmark
Teon Banek b90375c3ae Remove GraphDbAccessor and storage types from Ast
Summary:
This diff removes the need for a database when parsing a query and
creating an Ast. Instead of storing storage::{Label,Property,EdgeType}
in Ast nodes, we store the name and an index into all of the names. This
allows for easy creation of a map from {Label,Property,EdgeType} index
into the concrete storage type. Obviously, this comes with a performance
penalty during execution, but it should be minor. The upside is that the
query/frontend minimally depends on storage (PropertyValue), which makes
writing tests easier as well as running them a lot faster (there is no
database setup). This is most noticeable in the ast_serialization test
which took a long time due to start up of a distributed database.

Reviewers: mtomic, llugovic

Reviewed By: mtomic

Subscribers: mferencevic, pullbot

Differential Revision: https://phabricator.memgraph.io/D1774
2019-01-16 09:47:42 +01:00
..
data_structures RingBuffer - buffer on heap instead of stack 2017-11-02 12:07:23 +01:00
query Remove GraphDbAccessor and storage types from Ast 2019-01-16 09:47:42 +01:00
CMakeLists.txt Add query profiling: Tree 2019-01-15 12:13:40 +01:00
edge_storage.cpp Edge storage benchmark added 2017-09-08 13:12:20 +02:00
expansion.cpp Remove virtual and pimpl from single node 2018-10-09 11:48:30 +02:00
mvcc.cpp Refactor storage file structure 2018-11-06 18:17:31 +01:00
rpc.cpp Generate TypeInfo object for all LCP defined classes 2018-11-16 13:27:58 +01:00
serialization.cpp Remove already defined Save/Load of Symbol 2019-01-14 16:11:01 +01:00
skip_list_common.hpp Implement new SkipList 2019-01-14 13:01:15 +01:00
skip_list_random.cpp Implement new SkipList 2019-01-14 13:01:15 +01:00
skip_list_real_world.cpp Implement new SkipList 2019-01-14 13:01:15 +01:00
skip_list_same_item.cpp Implement new SkipList 2019-01-14 13:01:15 +01:00
skip_list_vs_stl.cpp Implement new SkipList 2019-01-14 13:01:15 +01:00
tx_engine.cpp Remove virtual and pimpl from single node 2018-10-09 11:48:30 +02:00