b90375c3ae
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 |
||
---|---|---|
.. | ||
snapshot_generation | ||
antlr_parser.cpp | ||
antlr_sigsegv.cpp | ||
antlr_tree_pretty_print.cpp | ||
binomial.cpp | ||
bolt_client.cpp | ||
card_fraud_generate_snapshot.cpp | ||
card_fraud_local.cpp | ||
CMakeLists.txt | ||
distributed_common.hpp | ||
distributed_query_planner.cpp | ||
distributed_repl.cpp | ||
endinan.cpp | ||
generate_snapshot.cpp | ||
graph_500_generate_snapshot.cpp | ||
interactive_planning.cpp | ||
interactive_planning.hpp | ||
kvstore_console.cpp | ||
query_hash.cpp | ||
query_planner.cpp | ||
repl.cpp | ||
single_query.cpp | ||
sl_position_and_count.cpp | ||
snapshot_explorer.cpp | ||
ssl_client.cpp | ||
ssl_server.cpp | ||
stripped_timing.cpp | ||
test_antlr_sigsegv | ||
wal_explorer.cpp | ||
xorshift.cpp |