Use new delete resource

.github/workflows/daily_benchmark.yaml

@@ -42,6 +42,16 @@ jobs:
             --groups aggregation 1000_create unwind_create dense_expand match \
             --no-strict
 
+      - name: Get branch name (merge)
+        if: github.event_name != 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_REF#refs/heads/} | tr / -)" >> $GITHUB_ENV
+
+      - name: Get branch name (pull request)
+        if: github.event_name == 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_HEAD_REF} | tr / -)" >> $GITHUB_ENV
+
       - name: Upload macro benchmark results
         run: |
           cd tools/bench-graph-client
@@ -51,7 +61,8 @@ jobs:
           ./main.py --benchmark-name "macro_benchmark" \
                     --benchmark-results-path "../../tests/macro_benchmark/.harness_summary" \
                     --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}"
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"
 
       - name: Run mgbench
         run: |
@@ -67,4 +78,5 @@ jobs:
           ./main.py --benchmark-name "mgbench" \
                     --benchmark-results-path "../../tests/mgbench/benchmark_result.json" \
                     --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}"
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"

.github/workflows/diff.yaml

@@ -1,13 +1,16 @@
 name: Diff
 
 on:
+  push:
+    branches:
+      - master
   workflow_dispatch:
   pull_request:
     paths-ignore:
-      - 'docs/**'
-      - '**/*.md'
-      - '.clang-format'
-      - 'CODEOWNERS'
+      - "docs/**"
+      - "**/*.md"
+      - ".clang-format"
+      - "CODEOWNERS"
 
 jobs:
   community_build:
@@ -374,6 +377,16 @@ jobs:
             --groups aggregation 1000_create unwind_create dense_expand match \
             --no-strict
 
+      - name: Get branch name (merge)
+        if: github.event_name != 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_REF#refs/heads/} | tr / -)" >> $GITHUB_ENV
+
+      - name: Get branch name (pull request)
+        if: github.event_name == 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_HEAD_REF} | tr / -)" >> $GITHUB_ENV
+
       - name: Upload macro benchmark results
         run: |
           cd tools/bench-graph-client
@@ -383,7 +396,8 @@ jobs:
           ./main.py --benchmark-name "macro_benchmark" \
                     --benchmark-results-path "../../tests/macro_benchmark/.harness_summary" \
                     --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}"
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"
 
       - name: Run mgbench
         run: |
@@ -399,4 +413,5 @@ jobs:
           ./main.py --benchmark-name "mgbench" \
                     --benchmark-results-path "../../tests/mgbench/benchmark_result.json" \
                     --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}"
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"

CMakeLists.txt

@@ -66,7 +66,7 @@ if (MG_ENTERPRISE)
 else()
   set(get_version_offering "--open-source")
 endif()
-set(get_version_script "${CMAKE_SOURCE_DIR}/release/get_version.py")
+set(get_version_script "${CMAKE_CURRENT_SOURCE_DIR}/release/get_version.py")
 
 # Get version that should be used in the binary.
 execute_process(
@@ -76,7 +76,7 @@ execute_process(
                 "${MEMGRAPH_OVERRIDE_VERSION}"
                 "${MEMGRAPH_OVERRIDE_VERSION_SUFFIX}"
                 "--memgraph-root-dir"
-                "${CMAKE_SOURCE_DIR}"
+                "${CMAKE_CURRENT_SOURCE_DIR}"
 )
 if(MEMGRAPH_VERSION_RESULT AND NOT MEMGRAPH_VERSION_RESULT EQUAL 0)
     message(FATAL_ERROR "Unable to get Memgraph version.")
@@ -93,7 +93,7 @@ execute_process(
                 "${MEMGRAPH_OVERRIDE_VERSION}"
                 "${MEMGRAPH_OVERRIDE_VERSION_SUFFIX}"
                 "--memgraph-root-dir"
-                "${CMAKE_SOURCE_DIR}"
+                "${CMAKE_CURRENT_SOURCE_DIR}"
 )
 if(MEMGRAPH_VERSION_DEB_RESULT AND NOT MEMGRAPH_VERSION_DEB_RESULT EQUAL 0)
     message(FATAL_ERROR "Unable to get Memgraph DEB version.")
@@ -110,7 +110,7 @@ execute_process(
                 "${MEMGRAPH_OVERRIDE_VERSION}"
                 "${MEMGRAPH_OVERRIDE_VERSION_SUFFIX}"
                 "--memgraph-root-dir"
-                "${CMAKE_SOURCE_DIR}"
+                "${CMAKE_CURRENT_SOURCE_DIR}"
 )
 if(MEMGRAPH_VERSION_RPM_RESULT AND NOT MEMGRAPH_VERSION_RPM_RESULT EQUAL 0)
     message(FATAL_ERROR "Unable to get Memgraph RPM version.")
@@ -331,8 +331,13 @@ add_subdirectory(src)
 # Release configuration
 add_subdirectory(release)
 
-enable_testing()
-add_subdirectory(tests)
+option(MG_ENABLE_TESTING "Set this to OFF to disable building test binaries" ON)
+message(STATUS "MG_ENABLE_TESTING: ${MG_ENABLE_TESTING}")
+
+if (MG_ENABLE_TESTING)
+  enable_testing()
+  add_subdirectory(tests)
+endif()
 
 if(TOOLS)
   add_subdirectory(tools)

environment/os/debian-11.sh

@@ -24,6 +24,7 @@ TOOLCHAIN_RUN_DEPS=(
     zlib1g # zlib library used for all builds
     libexpat1 libipt2 libbabeltrace1 liblzma5 python3 # for gdb
     libcurl4 # for cmake
+    file # for CPack
     libreadline8 # for cmake and llvm
     libffi7 libxml2 # for llvm
 )

release/debian/copyright

@@ -1 +1 @@
-../LICENSE.md
+../../LICENSE

release/get_version.py

@@ -1,10 +1,11 @@
 #!/usr/bin/env python3
 import argparse
+import os
 import re
 import subprocess
 import sys
-import os
-
+import time
+from functools import wraps
 
 # This script is used to determine the current version of Memgraph. The script
 # determines the current version using `git` automatically. The user can also
@@ -93,16 +94,29 @@ import os
 #   https://fedoraproject.org/wiki/Package_Versioning_Examples
 
 
+def retry(retry_limit, timeout=100):
+    def inner_func(func):
+        @wraps(func)
+        def wrapper(*args, **kwargs):
+            for _ in range(retry_limit):
+                try:
+                    return func(*args, **kwargs)
+                except Exception:
+                    time.sleep(timeout)
+            return func(*args, **kwargs)
+        return wrapper
+    return inner_func
+
+
+@retry(3)
 def get_output(*cmd, multiple=False):
     ret = subprocess.run(cmd, stdout=subprocess.PIPE, check=True)
     if multiple:
-        return list(map(lambda x: x.strip(),
-                        ret.stdout.decode("utf-8").strip().split("\n")))
+        return list(map(lambda x: x.strip(), ret.stdout.decode("utf-8").strip().split("\n")))
     return ret.stdout.decode("utf-8").strip()
 
 
-def format_version(variant, version, offering, distance=None, shorthash=None,
-                   suffix=None):
+def format_version(variant, version, offering, distance=None, shorthash=None, suffix=None):
     if not distance:
         # This is a release version.
         if variant == "deb":
@@ -135,8 +149,7 @@ def format_version(variant, version, offering, distance=None, shorthash=None,
             return ret
         elif variant == "rpm":
             # <VERSION>_0.<DISTANCE>.<SHORTHASH>.<OFFERING>[.<SUFFIX>]
-            ret = "{}_0.{}.{}{}".format(
-                version, distance, shorthash, "." + offering if offering else "")
+            ret = "{}_0.{}.{}{}".format(version, distance, shorthash, "." + offering if offering else "")
             if suffix:
                 ret += "." + suffix
             return ret
@@ -149,27 +162,23 @@ def format_version(variant, version, offering, distance=None, shorthash=None,
 
 
 # Parse arguments.
-parser = argparse.ArgumentParser(
-    description="Get the current version of Memgraph.")
+parser = argparse.ArgumentParser(description="Get the current version of Memgraph.")
+parser.add_argument("--open-source", action="store_true", help="set the current offering to 'open-source'")
+parser.add_argument("version", help="manual version override, if supplied the version isn't " "determined using git")
+parser.add_argument("suffix", help="custom suffix for the current version being built")
 parser.add_argument(
-    "--open-source", action="store_true",
-    help="set the current offering to 'open-source'")
+    "--variant",
+    choices=("binary", "deb", "rpm"),
+    default="binary",
+    help="which variant of the version string should be generated",
+)
 parser.add_argument(
-    "version", help="manual version override, if supplied the version isn't "
-    "determined using git")
-parser.add_argument(
-    "suffix", help="custom suffix for the current version being built")
-parser.add_argument(
-    "--variant", choices=("binary", "deb", "rpm"), default="binary",
-    help="which variant of the version string should be generated")
-parser.add_argument(
-    "--memgraph-root-dir", help="The root directory of the checked out "
-    "Memgraph repository.", default=".")
+    "--memgraph-root-dir", help="The root directory of the checked out " "Memgraph repository.", default="."
+)
 args = parser.parse_args()
 
 if not os.path.isdir(args.memgraph_root_dir):
-    raise Exception("The root directory ({}) is not a valid directory".format(
-        args.memgraph_root_dir))
+    raise Exception("The root directory ({}) is not a valid directory".format(args.memgraph_root_dir))
 
 os.chdir(args.memgraph_root_dir)
 
@@ -179,8 +188,7 @@ offering = "open-source" if args.open_source else None
 if args.version:
     if not re.match(r"^[0-9]+\.[0-9]+\.[0-9]+$", args.version):
         raise Exception("Invalid version supplied '{}'!".format(args.version))
-    print(format_version(args.variant, args.version, offering,
-                         suffix=args.suffix), end="")
+    print(format_version(args.variant, args.version, offering, suffix=args.suffix), end="")
     sys.exit(0)
 
 # Within CI, after the regular checkout, master is sometimes (e.g. in the case
@@ -234,33 +242,28 @@ versions.sort(reverse=True)
 current_version = None
 for version in versions:
     version_tuple, branch, master_branch_merge = version
-    current_branch_merge = get_output(
-        "git", "merge-base", current_hash, branch)
-    master_current_merge = get_output(
-        "git", "merge-base", current_hash, "master")
+    current_branch_merge = get_output("git", "merge-base", current_hash, branch)
+    master_current_merge = get_output("git", "merge-base", current_hash, "master")
     # The first check checks whether this commit is a child of `master` and
     # the version branch was created before us.
     # The second check checks whether this commit is a child of the version
     # branch.
-    if master_branch_merge == current_branch_merge or \
-            master_branch_merge == master_current_merge:
+    if master_branch_merge == current_branch_merge or master_branch_merge == master_current_merge:
         current_version = version
         break
 
 # Determine current version.
 if current_version is None:
-    raise Exception("You are attempting to determine the version for a very "
-                    "old version of Memgraph!")
+    raise Exception("You are attempting to determine the version for a very " "old version of Memgraph!")
 version, branch, master_branch_merge = current_version
-distance = int(get_output("git", "rev-list", "--count", "--first-parent",
-                          master_branch_merge + ".." + current_hash))
+distance = int(get_output("git", "rev-list", "--count", "--first-parent", master_branch_merge + ".." + current_hash))
 version_str = ".".join(map(str, version)) + ".0"
 if distance == 0:
-    print(format_version(args.variant, version_str, offering,
-                         suffix=args.suffix),
-          end="")
+    print(format_version(args.variant, version_str, offering, suffix=args.suffix), end="")
 else:
-    print(format_version(args.variant, version_str, offering,
-                         distance=distance, shorthash=current_hash_short,
-                         suffix=args.suffix),
-          end="")
+    print(
+        format_version(
+            args.variant, version_str, offering, distance=distance, shorthash=current_hash_short, suffix=args.suffix
+        ),
+        end="",
+    )

release/package/run.sh

@@ -18,14 +18,21 @@ print_help () {
 
 make_package () {
     os="$1"
+
+    build_container="mgbuild_$os"
+    echo "Building Memgraph for $os on $build_container..."
+
     package_command=""
     if [[ "$os" =~ ^"centos".* ]]; then
+        docker exec "$build_container" bash -c "yum -y update"
         package_command=" cpack -G RPM --config ../CPackConfig.cmake && rpmlint memgraph*.rpm "
     fi
     if [[ "$os" =~ ^"debian".* ]]; then
+        docker exec "$build_container" bash -c "apt update"
         package_command=" cpack -G DEB --config ../CPackConfig.cmake "
     fi
     if [[ "$os" =~ ^"ubuntu".* ]]; then
+        docker exec "$build_container" bash -c "apt update"
         package_command=" cpack -G DEB --config ../CPackConfig.cmake "
     fi
     telemetry_id_override_flag=""
@@ -39,8 +46,6 @@ make_package () {
           exit
         fi
     fi
-    build_container="mgbuild_$os"
-    echo "Building Memgraph for $os on $build_container..."
 
     echo "Copying project files..."
     # If master is not the current branch, fetch it, because the get_version

src/lisp/CMakeLists.txt

@@ -2,19 +2,19 @@
 
 # Don't forget to repeat this list below in `define_add_lcp`.
 set(lcp_src_files
-    ${CMAKE_SOURCE_DIR}/src/lisp/lcp.asd
-    ${CMAKE_SOURCE_DIR}/src/lisp/compile-lcp
-    ${CMAKE_SOURCE_DIR}/src/lisp/package.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/names.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/types.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/clone.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/code-gen.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/slk.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/lcp.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/debug.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/test.lisp
-    ${CMAKE_SOURCE_DIR}/src/lisp/util.lisp
-    ${CMAKE_SOURCE_DIR}/tools/lcp)
+    ${PROJECT_SOURCE_DIR}/src/lisp/lcp.asd
+    ${PROJECT_SOURCE_DIR}/src/lisp/compile-lcp
+    ${PROJECT_SOURCE_DIR}/src/lisp/package.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/names.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/types.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/clone.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/code-gen.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/slk.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/lcp.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/debug.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/test.lisp
+    ${PROJECT_SOURCE_DIR}/src/lisp/util.lisp
+    ${PROJECT_SOURCE_DIR}/tools/lcp)
 
 # Make `lcp_src_files` a persistent (cache) variable so that
 # tests/unit/CMakeLists.txt can see it.
@@ -65,21 +65,21 @@ macro(define_add_lcp name main_src_files generated_lcp_files)
     # Repeat the `lcp_src_files` because this is a macro and the variable is
     # not visible when invoked in another file.
     set(lcp_src_files
-        ${CMAKE_SOURCE_DIR}/src/lisp/lcp.asd
-        ${CMAKE_SOURCE_DIR}/src/lisp/compile-lcp
-        ${CMAKE_SOURCE_DIR}/src/lisp/package.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/names.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/types.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/clone.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/code-gen.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/slk.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/lcp.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/debug.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/test.lisp
-        ${CMAKE_SOURCE_DIR}/src/lisp/util.lisp
-        ${CMAKE_SOURCE_DIR}/tools/lcp)
+        ${PROJECT_SOURCE_DIR}/src/lisp/lcp.asd
+        ${PROJECT_SOURCE_DIR}/src/lisp/compile-lcp
+        ${PROJECT_SOURCE_DIR}/src/lisp/package.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/names.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/types.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/clone.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/code-gen.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/slk.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/lcp.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/debug.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/test.lisp
+        ${PROJECT_SOURCE_DIR}/src/lisp/util.lisp
+        ${PROJECT_SOURCE_DIR}/tools/lcp)
     add_custom_command(OUTPUT ${h_file} ${cpp_file}
-      COMMAND ${CMAKE_SOURCE_DIR}/tools/lcp ${lcp_file} ${slk_serialize}
+      COMMAND ${PROJECT_SOURCE_DIR}/tools/lcp ${lcp_file} ${slk_serialize}
       VERBATIM
       DEPENDS ${lcp_src_files} lcp ${lcp_file}
       WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR})

src/memgraph.cpp

@@ -188,7 +188,7 @@ DEFINE_bool(telemetry_enabled, false,
 
 // NOLINTNEXTLINE (cppcoreguidelines-avoid-non-const-global-variables)
 DEFINE_string(kafka_bootstrap_servers, "",
-              "List of Kafka brokers as a comma separated list of broker host or host:port.");
+              "List of default Kafka brokers as a comma separated list of broker host or host:port.");
 
 // Audit logging flags.
 #ifdef MG_ENTERPRISE
@@ -999,8 +999,8 @@ int main(int argc, char **argv) {
       auto gil = py::EnsureGIL();
       auto maybe_exc = py::AppendToSysPath(py_support_dir.c_str());
       if (maybe_exc) {
-        spdlog::error(
-            utils::MessageWithLink("Unable to load support for embedded Python: {}.", *maybe_exc, "https://memgr.ph/python"));
+        spdlog::error(utils::MessageWithLink("Unable to load support for embedded Python: {}.", *maybe_exc,
+                                             "https://memgr.ph/python"));
       }
     } else {
       spdlog::error(utils::MessageWithLink("Unable to load support for embedded Python: missing directory {}.",

src/query/frontend/ast/ast.lcp

@@ -2514,6 +2514,9 @@ cpp<#
              :slk-save #'slk-save-ast-pointer
              :slk-load (slk-load-ast-pointer "Expression"))
    (timeout "Expression *" :initval "nullptr" :scope :public
+             :slk-save #'slk-save-ast-pointer
+             :slk-load (slk-load-ast-pointer "Expression"))
+   (bootstrap_servers "Expression *" :initval "nullptr" :scope :public
              :slk-save #'slk-save-ast-pointer
              :slk-load (slk-load-ast-pointer "Expression")))
 

src/query/frontend/ast/cypher_main_visitor.cpp

@@ -523,6 +523,12 @@ antlrcpp::Any CypherMainVisitor::visitCreateStream(MemgraphCypher::CreateStreamC
     }
     stream_query->batch_size_ = ctx->batchSize->accept(this);
   }
+  if (ctx->BOOTSTRAP_SERVERS()) {
+    if (!ctx->bootstrapServers->StringLiteral()) {
+      throw SemanticException("Bootstrap servers should be a string!");
+    }
+    stream_query->bootstrap_servers_ = ctx->bootstrapServers->accept(this);
+  }
 
   return stream_query;
 }

src/query/frontend/opencypher/grammar/MemgraphCypher.g4

@@ -29,6 +29,7 @@ memgraphCypherKeyword : cypherKeyword
                       | BATCH_LIMIT
                       | BATCH_SIZE
                       | BEFORE
+                      | BOOTSTRAP_SERVERS
                       | CHECK
                       | CLEAR
                       | COMMIT
@@ -301,7 +302,8 @@ createStream : CREATE STREAM streamName
                TRANSFORM transformationName=procedureName
                ( CONSUMER_GROUP consumerGroup=symbolicNameWithDotsAndMinus ) ?
                ( BATCH_INTERVAL batchInterval=literal ) ?
-               ( BATCH_SIZE batchSize=literal ) ? ;
+               ( BATCH_SIZE batchSize=literal ) ?
+               ( BOOTSTRAP_SERVERS bootstrapServers=literal) ? ;
 
 dropStream : DROP STREAM streamName ;
 

src/query/frontend/opencypher/grammar/MemgraphCypherLexer.g4

@@ -25,81 +25,82 @@ import CypherLexer ;
 
 UNDERSCORE : '_' ;
 
-AFTER          : A F T E R ;
-ALTER          : A L T E R ;
-ASYNC          : A S Y N C ;
-AUTH           : A U T H ;
-BAD            : B A D ;
-BATCH_INTERVAL : B A T C H UNDERSCORE I N T E R V A L ;
-BATCH_LIMIT    : B A T C H UNDERSCORE L I M I T ;
-BATCH_SIZE     : B A T C H UNDERSCORE S I Z E ;
-BEFORE         : B E F O R E ;
-CHECK          : C H E C K ;
-CLEAR          : C L E A R ;
-COMMIT         : C O M M I T ;
-COMMITTED      : C O M M I T T E D ;
-CONFIG         : C O N F I G ;
-CONSUMER_GROUP : C O N S U M E R UNDERSCORE G R O U P ;
-CSV            : C S V ;
-DATA           : D A T A ;
-DELIMITER      : D E L I M I T E R ;
-DATABASE       : D A T A B A S E ;
-DENY           : D E N Y ;
-DIRECTORY      : D I R E C T O R Y ;
-DROP           : D R O P ;
-DUMP           : D U M P ;
-DURABILITY     : D U R A B I L I T Y ;
-EXECUTE        : E X E C U T E ;
-FOR            : F O R ;
-FREE           : F R E E ;
-FREE_MEMORY    : F R E E UNDERSCORE M E M O R Y ;
-FROM           : F R O M ;
-GLOBAL         : G L O B A L ;
-GRANT          : G R A N T ;
-GRANTS         : G R A N T S ;
-HEADER         : H E A D E R ;
-IDENTIFIED     : I D E N T I F I E D ;
-IGNORE         : I G N O R E ;
-ISOLATION      : I S O L A T I O N ;
-LEVEL          : L E V E L ;
-LOAD           : L O A D ;
-LOCK           : L O C K ;
-MAIN           : M A I N ;
-MODE           : M O D E ;
-NEXT           : N E X T ;
-NO             : N O ;
-PASSWORD       : P A S S W O R D ;
-PORT           : P O R T ;
-PRIVILEGES     : P R I V I L E G E S ;
-READ           : R E A D ;
-READ_FILE      : R E A D UNDERSCORE F I L E ;
-REGISTER       : R E G I S T E R ;
-REPLICA        : R E P L I C A ;
-REPLICAS       : R E P L I C A S ;
-REPLICATION    : R E P L I C A T I O N ;
-REVOKE         : R E V O K E ;
-ROLE           : R O L E ;
-ROLES          : R O L E S ;
-QUOTE          : Q U O T E ;
-SESSION        : S E S S I O N ;
-SETTING        : S E T T I N G ;
-SETTINGS       : S E T T I N G S ;
-SNAPSHOT       : S N A P S H O T ;
-START          : S T A R T ;
-STATS          : S T A T S ;
-STOP           : S T O P ;
-STREAM         : S T R E A M ;
-STREAMS        : S T R E A M S ;
-SYNC           : S Y N C ;
-TIMEOUT        : T I M E O U T ;
-TO             : T O ;
-TOPICS         : T O P I C S;
-TRANSACTION    : T R A N S A C T I O N ;
-TRANSFORM      : T R A N S F O R M ;
-TRIGGER        : T R I G G E R ;
-TRIGGERS       : T R I G G E R S ;
-UNCOMMITTED    : U N C O M M I T T E D ;
-UNLOCK         : U N L O C K ;
-UPDATE         : U P D A T E ;
-USER           : U S E R ;
-USERS          : U S E R S ;
+AFTER               : A F T E R ;
+ALTER               : A L T E R ;
+ASYNC               : A S Y N C ;
+AUTH                : A U T H ;
+BAD                 : B A D ;
+BATCH_INTERVAL      : B A T C H UNDERSCORE I N T E R V A L ;
+BATCH_LIMIT         : B A T C H UNDERSCORE L I M I T ;
+BATCH_SIZE          : B A T C H UNDERSCORE S I Z E ;
+BEFORE              : B E F O R E ;
+BOOTSTRAP_SERVERS   : B O O T S T R A P UNDERSCORE S E R V E R S ;
+CHECK               : C H E C K ;
+CLEAR               : C L E A R ;
+COMMIT              : C O M M I T ;
+COMMITTED           : C O M M I T T E D ;
+CONFIG              : C O N F I G ;
+CONSUMER_GROUP      : C O N S U M E R UNDERSCORE G R O U P ;
+CSV                 : C S V ;
+DATA                : D A T A ;
+DELIMITER           : D E L I M I T E R ;
+DATABASE            : D A T A B A S E ;
+DENY                : D E N Y ;
+DIRECTORY           : D I R E C T O R Y ;
+DROP                : D R O P ;
+DUMP                : D U M P ;
+DURABILITY          : D U R A B I L I T Y ;
+EXECUTE             : E X E C U T E ;
+FOR                 : F O R ;
+FREE                : F R E E ;
+FREE_MEMORY         : F R E E UNDERSCORE M E M O R Y ;
+FROM                : F R O M ;
+GLOBAL              : G L O B A L ;
+GRANT               : G R A N T ;
+GRANTS              : G R A N T S ;
+HEADER              : H E A D E R ;
+IDENTIFIED          : I D E N T I F I E D ;
+IGNORE              : I G N O R E ;
+ISOLATION           : I S O L A T I O N ;
+LEVEL               : L E V E L ;
+LOAD                : L O A D ;
+LOCK                : L O C K ;
+MAIN                : M A I N ;
+MODE                : M O D E ;
+NEXT                : N E X T ;
+NO                  : N O ;
+PASSWORD            : P A S S W O R D ;
+PORT                : P O R T ;
+PRIVILEGES          : P R I V I L E G E S ;
+READ                : R E A D ;
+READ_FILE           : R E A D UNDERSCORE F I L E ;
+REGISTER            : R E G I S T E R ;
+REPLICA             : R E P L I C A ;
+REPLICAS            : R E P L I C A S ;
+REPLICATION         : R E P L I C A T I O N ;
+REVOKE              : R E V O K E ;
+ROLE                : R O L E ;
+ROLES               : R O L E S ;
+QUOTE               : Q U O T E ;
+SESSION             : S E S S I O N ;
+SETTING             : S E T T I N G ;
+SETTINGS            : S E T T I N G S ;
+SNAPSHOT            : S N A P S H O T ;
+START               : S T A R T ;
+STATS               : S T A T S ;
+STOP                : S T O P ;
+STREAM              : S T R E A M ;
+STREAMS             : S T R E A M S ;
+SYNC                : S Y N C ;
+TIMEOUT             : T I M E O U T ;
+TO                  : T O ;
+TOPICS              : T O P I C S;
+TRANSACTION         : T R A N S A C T I O N ;
+TRANSFORM           : T R A N S F O R M ;
+TRIGGER             : T R I G G E R ;
+TRIGGERS            : T R I G G E R S ;
+UNCOMMITTED         : U N C O M M I T T E D ;
+UNLOCK              : U N L O C K ;
+UPDATE              : U P D A T E ;
+USER                : U S E R ;
+USERS               : U S E R S ;

src/query/frontend/stripped_lexer_constants.hpp

@@ -89,61 +89,117 @@ class Trie {
 
 const int kBitsetSize = 65536;
 
-const trie::Trie kKeywords = {"union",       "all",
-                              "optional",    "match",
-                              "unwind",      "as",
-                              "merge",       "on",
-                              "create",      "set",
-                              "detach",      "delete",
-                              "remove",      "with",
-                              "distinct",    "return",
-                              "order",       "by",
-                              "skip",        "limit",
-                              "ascending",   "asc",
-                              "descending",  "desc",
-                              "where",       "or",
-                              "xor",         "and",
-                              "not",         "in",
-                              "starts",      "ends",
-                              "contains",    "is",
-                              "null",        "case",
-                              "when",        "then",
-                              "else",        "end",
-                              "count",       "filter",
-                              "extract",     "any",
-                              "none",        "single",
-                              "true",        "false",
-                              "reduce",      "coalesce",
-                              "user",        "password",
-                              "alter",       "drop",
-                              "show",        "stats",
-                              "unique",      "explain",
-                              "profile",     "storage",
-                              "index",       "info",
-                              "exists",      "assert",
-                              "constraint",  "node",
-                              "key",         "dump",
-                              "database",    "call",
-                              "yield",       "memory",
-                              "mb",          "kb",
-                              "unlimited",   "free",
-                              "procedure",   "query",
-                              "free_memory", "read_file",
-                              "lock_path",   "after",
-                              "before",      "execute",
-                              "transaction", "trigger",
-                              "triggers",    "update",
-                              "comitted",    "uncomitted",
-                              "global",      "isolation",
-                              "level",       "next",
-                              "read",        "session",
-                              "snapshot",    "transaction",
-                              "batch_limit", "batch_interval",
-                              "batch_size",  "consumer_group",
-                              "start",       "stream",
-                              "streams",     "transform",
-                              "topics",      "check",
-                              "setting",     "settings"};
+const trie::Trie kKeywords = {"union",
+                              "all",
+                              "optional",
+                              "match",
+                              "unwind",
+                              "as",
+                              "merge",
+                              "on",
+                              "create",
+                              "set",
+                              "detach",
+                              "delete",
+                              "remove",
+                              "with",
+                              "distinct",
+                              "return",
+                              "order",
+                              "by",
+                              "skip",
+                              "limit",
+                              "ascending",
+                              "asc",
+                              "descending",
+                              "desc",
+                              "where",
+                              "or",
+                              "xor",
+                              "and",
+                              "not",
+                              "in",
+                              "starts",
+                              "ends",
+                              "contains",
+                              "is",
+                              "null",
+                              "case",
+                              "when",
+                              "then",
+                              "else",
+                              "end",
+                              "count",
+                              "filter",
+                              "extract",
+                              "any",
+                              "none",
+                              "single",
+                              "true",
+                              "false",
+                              "reduce",
+                              "coalesce",
+                              "user",
+                              "password",
+                              "alter",
+                              "drop",
+                              "show",
+                              "stats",
+                              "unique",
+                              "explain",
+                              "profile",
+                              "storage",
+                              "index",
+                              "info",
+                              "exists",
+                              "assert",
+                              "constraint",
+                              "node",
+                              "key",
+                              "dump",
+                              "database",
+                              "call",
+                              "yield",
+                              "memory",
+                              "mb",
+                              "kb",
+                              "unlimited",
+                              "free",
+                              "procedure",
+                              "query",
+                              "free_memory",
+                              "read_file",
+                              "lock_path",
+                              "after",
+                              "before",
+                              "execute",
+                              "transaction",
+                              "trigger",
+                              "triggers",
+                              "update",
+                              "comitted",
+                              "uncomitted",
+                              "global",
+                              "isolation",
+                              "level",
+                              "next",
+                              "read",
+                              "session",
+                              "snapshot",
+                              "transaction",
+                              "batch_limit",
+                              "batch_interval",
+                              "batch_size",
+                              "consumer_group",
+                              "start",
+                              "stream",
+                              "streams",
+                              "transform",
+                              "topics",
+                              "check",
+                              "setting",
+                              "settings",
+                              "bootstrap_servers"};
 
 // Unicode codepoints that are allowed at the start of the unescaped name.
 const std::bitset<kBitsetSize> kUnescapedNameAllowedStarts(

src/query/interpreter.cpp

@@ -106,6 +106,17 @@ std::optional<TResult> GetOptionalValue(query::Expression *expression, Expressio
   return {};
 };
 
+std::optional<std::string> GetOptionalStringValue(query::Expression *expression, ExpressionEvaluator &evaluator) {
+  if (expression != nullptr) {
+    auto value = expression->Accept(evaluator);
+    MG_ASSERT(value.IsNull() || value.IsString());
+    if (value.IsString()) {
+      return {std::string(value.ValueString().begin(), value.ValueString().end())};
+    }
+  }
+  return {};
+};
+
 class ReplQueryHandler final : public query::ReplicationQueryHandler {
  public:
   explicit ReplQueryHandler(storage::Storage *db) : db_(db) {}
@@ -520,21 +531,28 @@ Callback HandleStreamQuery(StreamQuery *stream_query, const Parameters &paramete
       std::string consumer_group{stream_query->consumer_group_.empty() ? kDefaultConsumerGroup
                                                                        : stream_query->consumer_group_};
 
-      callback.fn =
-          [interpreter_context, stream_name = stream_query->stream_name_, topic_names = stream_query->topic_names_,
-           consumer_group = std::move(consumer_group),
-           batch_interval = GetOptionalValue<std::chrono::milliseconds>(stream_query->batch_interval_, evaluator),
-           batch_size = GetOptionalValue<int64_t>(stream_query->batch_size_, evaluator),
-           transformation_name = stream_query->transform_name_, owner = StringPointerToOptional(username)]() mutable {
-            interpreter_context->streams.Create(stream_name,
-                                                query::StreamInfo{.topics = std::move(topic_names),
-                                                                  .consumer_group = std::move(consumer_group),
-                                                                  .batch_interval = batch_interval,
-                                                                  .batch_size = batch_size,
-                                                                  .transformation_name = std::move(transformation_name),
-                                                                  .owner = std::move(owner)});
-            return std::vector<std::vector<TypedValue>>{};
-          };
+      auto bootstrap = GetOptionalStringValue(stream_query->bootstrap_servers_, evaluator);
+      if (bootstrap && bootstrap->empty()) {
+        throw SemanticException("Bootstrap servers must not be an empty string!");
+      }
+      callback.fn = [interpreter_context, stream_name = stream_query->stream_name_,
+                     topic_names = stream_query->topic_names_, consumer_group = std::move(consumer_group),
+                     batch_interval =
+                         GetOptionalValue<std::chrono::milliseconds>(stream_query->batch_interval_, evaluator),
+                     batch_size = GetOptionalValue<int64_t>(stream_query->batch_size_, evaluator),
+                     transformation_name = stream_query->transform_name_, bootstrap_servers = std::move(bootstrap),
+                     owner = StringPointerToOptional(username)]() mutable {
+        std::string bootstrap = bootstrap_servers ? std::move(*bootstrap_servers) : "";
+        interpreter_context->streams.Create(stream_name,
+                                            query::StreamInfo{.topics = std::move(topic_names),
+                                                              .consumer_group = std::move(consumer_group),
+                                                              .batch_interval = batch_interval,
+                                                              .batch_size = batch_size,
+                                                              .transformation_name = std::move(transformation_name),
+                                                              .owner = std::move(owner),
+                                                              .bootstrap_servers = std::move(bootstrap)});
+        return std::vector<std::vector<TypedValue>>{};
+      };
       return callback;
     }
     case StreamQuery::Action::START_STREAM: {
@@ -573,8 +591,11 @@ Callback HandleStreamQuery(StreamQuery *stream_query, const Parameters &paramete
       return callback;
     }
     case StreamQuery::Action::SHOW_STREAMS: {
-      callback.header = {"name",  "topics",    "consumer_group", "batch_interval", "batch_size", "transformation_name",
-                         "owner", "is running"};
+      callback.header = {"name",           "topics",
+                         "consumer_group", "batch_interval",
+                         "batch_size",     "transformation_name",
+                         "owner",          "bootstrap_servers",
+                         "is running"};
       callback.fn = [interpreter_context]() {
         auto streams_status = interpreter_context->streams.GetStreamInfo();
         std::vector<std::vector<TypedValue>> results;
@@ -588,8 +609,8 @@ Callback HandleStreamQuery(StreamQuery *stream_query, const Parameters &paramete
           return typed_topics;
         };
 
-        auto stream_info_as_typed_stream_info_emplace_in = [topics_as_typed_topics](auto &typed_status,
-                                                                                    const auto &stream_info) {
+        auto stream_info_as_typed_stream_info_emplace_in = [topics_as_typed_topics, interpreter_context](
+                                                               auto &typed_status, const auto &stream_info) {
           typed_status.emplace_back(topics_as_typed_topics(stream_info.topics));
           typed_status.emplace_back(stream_info.consumer_group);
           if (stream_info.batch_interval.has_value()) {
@@ -608,11 +629,16 @@ Callback HandleStreamQuery(StreamQuery *stream_query, const Parameters &paramete
           } else {
             typed_status.emplace_back();
           }
+          if (stream_info.bootstrap_servers.empty()) {
+            typed_status.emplace_back(interpreter_context->streams.BootstrapServers());
+          } else {
+            typed_status.emplace_back(stream_info.bootstrap_servers);
+          }
         };
 
         for (const auto &status : streams_status) {
           std::vector<TypedValue> typed_status;
-          typed_status.reserve(7);
+          typed_status.reserve(8);
           typed_status.emplace_back(status.name);
           stream_info_as_typed_stream_info_emplace_in(typed_status, status.info);
           typed_status.emplace_back(status.is_running);
@@ -804,14 +830,14 @@ std::optional<plan::ProfilingStatsWithTotalTime> PullPlan::Pull(AnyStream *strea
   // Also, we want to throw only when the query engine requests more memory and not the storage
   // so we add the exception to the allocator.
   // TODO (mferencevic): Tune the parameters accordingly.
-  utils::PoolResource pool_memory(128, 1024, &monotonic_memory);
+  utils::FixedSizePoolResource pool_memory(128, 1024, &monotonic_memory);
   std::optional<utils::LimitedMemoryResource> maybe_limited_resource;
 
   if (memory_limit_) {
-    maybe_limited_resource.emplace(&pool_memory, *memory_limit_);
+    maybe_limited_resource.emplace(utils::NewDeleteResource(), *memory_limit_);
     ctx_.evaluation_context.memory = &*maybe_limited_resource;
   } else {
-    ctx_.evaluation_context.memory = &pool_memory;
+    ctx_.evaluation_context.memory = utils::NewDeleteResource();
   }
 
   // Returns true if a result was pulled.

src/query/plan/operator.cpp

@@ -49,6 +49,7 @@
 #include "utils/pmr/vector.hpp"
 #include "utils/readable_size.hpp"
 #include "utils/string.hpp"
+#include "utils/temporal.hpp"
 
 // macro for the default implementation of LogicalOperator::Accept
 // that accepts the visitor and visits it's input_ operator
@@ -1445,7 +1446,7 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
     // satisfy the "where" condition. if so, places them in the priority
     // queue.
     auto expand_pair = [this, &evaluator, &frame, &create_state](const EdgeAccessor &edge, const VertexAccessor &vertex,
-                                                                 double weight, int64_t depth) {
+                                                                 const TypedValue &total_weight, int64_t depth) {
       auto *memory = evaluator.GetMemoryResource();
       if (self_.filter_lambda_.expression) {
         frame[self_.filter_lambda_.inner_edge_symbol] = edge;
@@ -1457,27 +1458,48 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
       frame[self_.weight_lambda_->inner_edge_symbol] = edge;
       frame[self_.weight_lambda_->inner_node_symbol] = vertex;
 
-      TypedValue typed_weight = self_.weight_lambda_->expression->Accept(evaluator);
+      TypedValue current_weight = self_.weight_lambda_->expression->Accept(evaluator);
 
-      if (!typed_weight.IsNumeric()) {
-        throw QueryRuntimeException("Calculated weight must be numeric, got {}.", typed_weight.type());
+      if (!current_weight.IsNumeric() && !current_weight.IsDuration()) {
+        throw QueryRuntimeException("Calculated weight must be numeric or a Duration, got {}.", current_weight.type());
       }
-      if ((typed_weight < TypedValue(0, memory)).ValueBool()) {
+
+      const auto is_valid_numeric = [&] {
+        return current_weight.IsNumeric() && (current_weight >= TypedValue(0, memory)).ValueBool();
+      };
+
+      const auto is_valid_duration = [&] {
+        return current_weight.IsDuration() && (current_weight >= TypedValue(utils::Duration(0), memory)).ValueBool();
+      };
+
+      if (!is_valid_numeric() && !is_valid_duration()) {
         throw QueryRuntimeException("Calculated weight must be non-negative!");
       }
 
       auto next_state = create_state(vertex, depth);
-      auto next_weight = TypedValue(weight, memory) + typed_weight;
-      auto found_it = total_cost_.find(next_state);
-      if (found_it != total_cost_.end() && found_it->second.ValueDouble() <= next_weight.ValueDouble()) return;
 
-      pq_.push({next_weight.ValueDouble(), depth + 1, vertex, edge});
+      TypedValue next_weight = std::invoke([&] {
+        if (total_weight.IsNull()) {
+          return current_weight;
+        }
+
+        ValidateWeightTypes(current_weight, total_weight);
+
+        return TypedValue(current_weight, memory) + total_weight;
+      });
+
+      auto found_it = total_cost_.find(next_state);
+      if (found_it != total_cost_.end() && (found_it->second.IsNull() || (found_it->second <= next_weight).ValueBool()))
+        return;
+
+      pq_.push({next_weight, depth + 1, vertex, edge});
     };
 
     // Populates the priority queue structure with expansions
     // from the given vertex. skips expansions that don't satisfy
     // the "where" condition.
-    auto expand_from_vertex = [this, &expand_pair](const VertexAccessor &vertex, double weight, int64_t depth) {
+    auto expand_from_vertex = [this, &expand_pair](const VertexAccessor &vertex, const TypedValue &weight,
+                                                   int64_t depth) {
       if (self_.common_.direction != EdgeAtom::Direction::IN) {
         auto out_edges = UnwrapEdgesResult(vertex.OutEdges(storage::View::OLD, self_.common_.edge_types));
         for (const auto &edge : out_edges) {
@@ -1522,7 +1544,7 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
         total_cost_.clear();
         yielded_vertices_.clear();
 
-        pq_.push({0.0, 0, vertex, std::nullopt});
+        pq_.push({TypedValue(), 0, vertex, std::nullopt});
         // We are adding the starting vertex to the set of yielded vertices
         // because we don't want to yield paths that end with the starting
         // vertex.
@@ -1622,17 +1644,38 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
   // Keeps track of vertices for which we yielded a path already.
   utils::pmr::unordered_set<VertexAccessor> yielded_vertices_;
 
+  static void ValidateWeightTypes(const TypedValue &lhs, const TypedValue &rhs) {
+    if (!((lhs.IsNumeric() && lhs.IsNumeric()) || (rhs.IsDuration() && rhs.IsDuration()))) {
+      throw QueryRuntimeException(utils::MessageWithLink(
+          "All weights should be of the same type, either numeric or a Duration. Please update the weight "
+          "expression or the filter expression.",
+          "https://memgr.ph/wsp"));
+    }
+  }
+
   // Priority queue comparator. Keep lowest weight on top of the queue.
   class PriorityQueueComparator {
    public:
-    bool operator()(const std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &lhs,
-                    const std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &rhs) {
-      return std::get<0>(lhs) > std::get<0>(rhs);
+    bool operator()(const std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &lhs,
+                    const std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &rhs) {
+      const auto &lhs_weight = std::get<0>(lhs);
+      const auto &rhs_weight = std::get<0>(rhs);
+      // Null defines minimum value for all types
+      if (lhs_weight.IsNull()) {
+        return false;
+      }
+
+      if (rhs_weight.IsNull()) {
+        return true;
+      }
+
+      ValidateWeightTypes(lhs_weight, rhs_weight);
+      return (lhs_weight > rhs_weight).ValueBool();
     }
   };
 
-  std::priority_queue<std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>>,
-                      utils::pmr::vector<std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>>>,
+  std::priority_queue<std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>>,
+                      utils::pmr::vector<std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>>>,
                       PriorityQueueComparator>
       pq_;
 

src/query/procedure/mg_procedure_impl.cpp

@@ -1218,7 +1218,7 @@ mgp_error mgp_local_time_get_hour(mgp_local_time *local_time, int *hour) {
   return WrapExceptions([local_time] { return local_time->local_time.hour; }, hour);
 }
 
-mgp_error mgp_local_time_get_minue(mgp_local_time *local_time, int *minute) {
+mgp_error mgp_local_time_get_minute(mgp_local_time *local_time, int *minute) {
   return WrapExceptions([local_time] { return local_time->local_time.minute; }, minute);
 }
 

src/query/streams.cpp

@@ -118,6 +118,7 @@ const std::string kBatchSizeKey{"batch_size"};
 const std::string kIsRunningKey{"is_running"};
 const std::string kTransformationName{"transformation_name"};
 const std::string kOwner{"owner"};
+const std::string kBoostrapServers{"bootstrap_servers"};
 
 void to_json(nlohmann::json &data, StreamStatus &&status) {
   auto &info = status.info;
@@ -145,6 +146,8 @@ void to_json(nlohmann::json &data, StreamStatus &&status) {
   } else {
     data[kOwner] = nullptr;
   }
+
+  data[kBoostrapServers] = std::move(info.bootstrap_servers);
 }
 
 void from_json(const nlohmann::json &data, StreamStatus &status) {
@@ -174,6 +177,8 @@ void from_json(const nlohmann::json &data, StreamStatus &status) {
   } else {
     info.owner = {};
   }
+
+  info.owner = data.value(kBoostrapServers, "");
 }
 
 Streams::Streams(InterpreterContext *interpreter_context, std::string bootstrap_servers,
@@ -410,10 +415,13 @@ Streams::StreamsMap::iterator Streams::CreateConsumer(StreamsMap &map, const std
       .batch_size = stream_info.batch_size,
   };
 
+  auto bootstrap_servers =
+      stream_info.bootstrap_servers.empty() ? bootstrap_servers_ : std::move(stream_info.bootstrap_servers);
   auto insert_result = map.insert_or_assign(
-      stream_name, StreamData{std::move(stream_info.transformation_name), std::move(stream_info.owner),
-                              std::make_unique<SynchronizedConsumer>(bootstrap_servers_, std::move(consumer_info),
-                                                                     std::move(consumer_function))});
+      stream_name,
+      StreamData{std::move(stream_info.transformation_name), std::move(stream_info.owner),
+                 std::make_unique<SynchronizedConsumer>(std::move(bootstrap_servers), std::move(consumer_info),
+                                                        std::move(consumer_function))});
   MG_ASSERT(insert_result.second, "Unexpected error during storing consumer '{}'", stream_name);
   return insert_result.first;
 }
@@ -425,4 +433,5 @@ void Streams::Persist(StreamStatus &&status) {
   }
 }
 
+std::string_view Streams::BootstrapServers() const { return bootstrap_servers_; }
 }  // namespace query

src/query/streams.hpp

@@ -40,6 +40,7 @@ struct StreamInfo {
   std::optional<int64_t> batch_size;
   std::string transformation_name;
   std::optional<std::string> owner;
+  std::string bootstrap_servers;
 };
 
 struct StreamStatus {
@@ -139,6 +140,9 @@ class Streams final {
                              std::optional<std::chrono::milliseconds> timeout = std::nullopt,
                              std::optional<int64_t> batch_limit = std::nullopt) const;
 
+  /// Return the configuration value passed to memgraph.
+  std::string_view BootstrapServers() const;
+
  private:
   using StreamsMap = std::unordered_map<std::string, StreamData>;
   using SynchronizedStreamsMap = utils::Synchronized<StreamsMap, utils::WritePrioritizedRWLock>;

src/utils/memory.cpp

@@ -13,6 +13,7 @@
 
 #include <algorithm>
 #include <cmath>
+#include <cstddef>
 #include <cstdint>
 #include <limits>
 #include <type_traits>
@@ -164,8 +165,9 @@ void *Pool::Allocate() {
     --chunk->blocks_available;
     return available_block;
   };
-  if (last_alloc_chunk_ && last_alloc_chunk_->blocks_available > 0U)
+  if (last_alloc_chunk_ && last_alloc_chunk_->blocks_available > 0U) {
     return allocate_block_from_chunk(last_alloc_chunk_);
+  }
   // Find a Chunk with available memory.
   for (auto &chunk : chunks_) {
     if (chunk.blocks_available > 0U) {
@@ -347,4 +349,141 @@ void PoolResource::Release() {
 
 // PoolResource END
 
+namespace impl {
+namespace {
+constexpr size_t kInitialChunkSize = 1;
+}  // namespace
+FixedSizePool::FixedSizePool(const size_t block_size, const size_t max_blocks_per_chunk_,
+                             utils::MemoryResource *upstream)
+    : block_size_{block_size},
+      max_blocks_per_chunk_{max_blocks_per_chunk_},
+      chunk_size_{kInitialChunkSize},
+      upstream_{upstream} {
+  internal_block_size_ = RoundUp(block_size, alignof(std::max_align_t));
+}
+
+void *FixedSizePool::Allocate() {
+  if (begin_ == end_) {
+    if (free_list_) {
+      Link *p = free_list_;
+      free_list_ = p->next;
+      return p;
+    }
+
+    Replenish();
+  }
+
+  auto *p = begin_;
+  begin_ += internal_block_size_;
+  return p;
+}
+
+void FixedSizePool::Deallocate(void *p) {
+  static_cast<Link *>(p)->next = free_list_;
+  free_list_ = static_cast<Link *>(p);
+}
+
+void FixedSizePool::Release() {
+  chunk_list_.Release(upstream_);
+
+  chunk_size_ = kInitialChunkSize;
+  begin_ = nullptr;
+  end_ = nullptr;
+  free_list_ = nullptr;
+}
+
+FixedSizePool::~FixedSizePool() { Release(); }
+
+void FixedSizePool::Replenish() {
+  begin_ = static_cast<std::byte *>(chunk_list_.Allocate(chunk_size_ * internal_block_size_, upstream_));
+  end_ = begin_ + chunk_size_ * internal_block_size_;
+
+  // TODO (antonio2368): Add more growth strategies
+  const auto next_chunk_size = chunk_size_ * 2;
+  if (next_chunk_size <= max_blocks_per_chunk_) {
+    chunk_size_ = next_chunk_size;
+  }
+}
+
+}  // namespace impl
+
+namespace {
+inline uint64_t CeilLog2(const uint64_t x) { return utils::Log2(x) + !utils::IsPow2(x); }
+}  // namespace
+
+FixedSizePoolResource::FixedSizePoolResource(const size_t max_blocks_per_chunk, const size_t max_block_size,
+                                             utils::MemoryResource *upstream)
+    : upstream_{upstream} {
+  max_block_size_ = min_block_size_;
+
+  num_pools_ = CeilLog2(max_block_size) - CeilLog2(min_block_size_) + 1;
+  MG_ASSERT(num_pools_ > 0, "Invalid max size of the block.");
+
+  auto allocator = Allocator<impl::FixedSizePool>(upstream_);
+  pools_ = allocator.allocate(num_pools_);
+
+  for (size_t i = 0; i < num_pools_; ++i) {
+    allocator.construct(pools_ + i, max_block_size_, max_blocks_per_chunk, upstream);
+    MG_ASSERT(max_block_size_ <= std::numeric_limits<size_t>::max() / 2);
+    max_block_size_ *= 2;
+  }
+
+  max_block_size_ /= 2;
+}
+
+void *FixedSizePoolResource::DoAllocate(const size_t bytes, const size_t alignment) {
+  MG_ASSERT(bytes > 0);
+  void *ret{nullptr};
+  if (bytes <= max_block_size_) {
+    auto *pool = FindPool(bytes);
+    ret = pool->Allocate();
+  } else {
+    // add to the list of allocated chunks
+    ret = large_blocks_.Allocate(bytes, upstream_);
+  }
+
+  return ret;
+}
+
+void FixedSizePoolResource::DoDeallocate(void *p, const size_t bytes, const size_t alignment) {
+  auto *pool = FindPool(bytes);
+
+  if (pool == nullptr) {
+    large_blocks_.Deallocate(p, upstream_);
+  } else {
+    pool->Deallocate(p);
+  }
+}
+
+impl::FixedSizePool *FixedSizePoolResource::FindPool(const size_t size) const {
+  if (size > max_block_size_) {
+    return nullptr;
+  }
+
+  auto *pool = pools_;
+  while (size > pool->BlockSize()) {
+    ++pool;
+  }
+
+  return pool;
+}
+
+void FixedSizePoolResource::Release() {
+  for (size_t i = 0; i < num_pools_; ++i) {
+    pools_[i].Release();
+  }
+
+  large_blocks_.Release(upstream_);
+}
+
+FixedSizePoolResource::~FixedSizePoolResource() {
+  Release();
+
+  for (size_t i = 0; i < num_pools_; ++i) {
+    pools_[i].~FixedSizePool();
+  }
+
+  upstream_->Deallocate(pools_, sizeof(impl::FixedSizePool) * num_pools_, alignof(impl::FixedSizePool));
+}
+
 }  // namespace utils

src/utils/memory.hpp

@@ -16,6 +16,7 @@
 #pragma once
 
 #include <cstddef>
+#include <list>
 #include <memory>
 #include <mutex>
 #include <new>
@@ -23,6 +24,9 @@
 #include <type_traits>
 #include <utility>
 #include <vector>
+#ifndef NDEBUG
+#include <iostream>
+#endif
 // Although <memory_resource> is in C++17, gcc libstdc++ still needs to
 // implement it fully. It should be available in the next major release
 // version, i.e. gcc 9.x.
@@ -564,6 +568,217 @@ class LimitedMemoryResource final : public utils::MemoryResource {
   bool DoIsEqual(const MemoryResource &other) const noexcept override { return this == &other; }
 };
 
+namespace impl {
+
+// https://stackoverflow.com/a/9194117
+// if y is power 2 we can do (x + y - 1) & ~(y - 1);
+// https://stackoverflow.com/a/14561794
+constexpr size_t RoundUp(const size_t x, const size_t y) {
+  MG_ASSERT(y >= 1);
+  return (x + y - 1) / y * y;
+}
+
+struct LinkedListNode {
+  LinkedListNode *next;
+  LinkedListNode *previous;
+};
+
+struct BlockLinkedListHeaderBase : public LinkedListNode {
+  size_t size;
+
+  using NodeType = LinkedListNode;
+};
+
+struct SingleLinkedListNode {
+  SingleLinkedListNode *next;
+};
+
+struct BlockSingleLinkedListHeaderBase : public SingleLinkedListNode {
+  size_t size;
+
+  using NodeType = SingleLinkedListNode;
+};
+
+template <typename T>
+concept BlockLinkedListHeader = std::is_base_of_v<BlockLinkedListHeaderBase, T>;
+
+template <typename T>
+concept BlockSingleLinkedListHeader = std::is_base_of_v<BlockSingleLinkedListHeaderBase, T>;
+
+template <typename T>
+concept BlockListHeader = BlockLinkedListHeader<T> || BlockSingleLinkedListHeader<T>;
+
+template <BlockListHeader THeader>
+class BlockList {
+  using NodeType = typename THeader::NodeType;
+
+ public:
+  static const size_t header_size = RoundUp(sizeof(THeader), alignof(std::max_align_t));
+
+  explicit BlockList() {
+    // create a circular linked list
+    list_.next = &list_;
+
+    if constexpr (BlockLinkedListHeader<THeader>) {
+      list_.previous = &list_;
+    }
+  }
+
+  void *Allocate(const size_t bytes, utils::MemoryResource *rsrc) {
+    if (bytes > static_cast<size_t>(-1) - header_size) {
+      throw utils::BadAlloc("Requested too many bytes to allocate");
+    }
+
+    void *p = rsrc->Allocate(bytes + header_size);
+    auto *node = new (p) THeader;
+    node->size = bytes + header_size;
+
+    auto *next = list_.next;
+    node->next = next;
+    list_.next = node;
+
+    if constexpr (BlockLinkedListHeader<THeader>) {
+      node->previous = &list_;
+      next->previous = node;
+    }
+
+    return static_cast<std::byte *>(p) + header_size;
+  }
+
+  template <typename T = THeader>
+  requires BlockLinkedListHeader<T> void Deallocate(void *p, utils::MemoryResource *rsrc) {
+    auto *header = static_cast<THeader *>(static_cast<void *>(static_cast<std::byte *>(p) - header_size));
+    auto *next = header->next;
+    auto *previous = header->previous;
+    previous->next = next;
+    next->previous = previous;
+
+    const size_t size = header->size;
+    header->~THeader();
+    rsrc->Deallocate(header, size, alignof(std::max_align_t));
+  }
+
+  void Release(utils::MemoryResource *rsrc) {
+    NodeType *node = list_.next;
+    while (node != &list_) {
+      auto *header = static_cast<THeader *>(node);
+      node = node->next;
+      const size_t size = header->size;
+      header->~THeader();
+      rsrc->Deallocate(header, size, alignof(std::max_align_t));
+    }
+
+    // create a circular linked list
+    list_.next = &list_;
+
+    if constexpr (BlockLinkedListHeader<THeader>) {
+      list_.previous = &list_;
+    }
+  }
+
+ private:
+  NodeType list_;
+};
+
+// https://github.com/bloomberg/bde/blob/master/groups/bdl/bdlma/bdlma_pool.h
+class FixedSizePool final {
+ public:
+  FixedSizePool(size_t block_size, size_t max_blocks_per_chunk, utils::MemoryResource *upstream);
+
+  FixedSizePool(const FixedSizePool &) = delete;
+  FixedSizePool &operator=(const FixedSizePool &) = delete;
+
+  FixedSizePool(FixedSizePool &&) = default;
+  FixedSizePool &operator=(FixedSizePool &&) = default;
+
+  void *Allocate();
+  void Deallocate(void *p);
+
+  void Release();
+
+  auto BlockSize() const { return block_size_; }
+
+  ~FixedSizePool();
+
+ private:
+  struct Link {
+    Link *next;
+  };
+
+  std::byte *begin_{nullptr};
+  std::byte *end_{nullptr};
+
+  Link *free_list_{nullptr};
+
+  size_t internal_block_size_;
+  size_t block_size_;
+  size_t max_blocks_per_chunk_;
+  size_t chunk_size_;
+
+  BlockList<BlockSingleLinkedListHeaderBase> chunk_list_;
+
+  utils::MemoryResource *upstream_;
+
+  void Replenish();
+};
+}  // namespace impl
+
+// https://github.com/bloomberg/bde/blob/master/groups/bdl/bdlma/bdlma_multipool.h
+class FixedSizePoolResource : public MemoryResource {
+ public:
+  explicit FixedSizePoolResource(size_t max_blocks_per_chunk, size_t max_block_size,
+                                 utils::MemoryResource *upstream = utils::NewDeleteResource());
+
+  void Release();
+
+  FixedSizePoolResource(const FixedSizePoolResource &) = delete;
+  FixedSizePoolResource &operator=(const FixedSizePoolResource &) = delete;
+
+  FixedSizePoolResource(FixedSizePoolResource &&) = default;
+  FixedSizePoolResource &operator=(FixedSizePoolResource &&) = default;
+
+  ~FixedSizePoolResource() override;
+
+ private:
+  impl::FixedSizePool *FindPool(size_t size) const;
+
+  void *DoAllocate(size_t bytes, size_t alignment) override;
+  void DoDeallocate(void *p, size_t bytes, size_t alignment) override;
+
+  bool DoIsEqual(const MemoryResource &other) const noexcept override { return this == &other; }
+
+  impl::FixedSizePool *pools_{nullptr};
+  size_t max_block_size_;
+  size_t min_block_size_{8};
+  size_t num_pools_{0};
+
+  impl::BlockList<impl::BlockLinkedListHeaderBase> large_blocks_;
+
+  utils::MemoryResource *upstream_;
+};
+
+#ifndef NDEBUG
+class PrintMemoryResource : public MemoryResource {
+ public:
+  explicit PrintMemoryResource(utils::MemoryResource *memory) : memory_(memory) {}
+
+ private:
+  void *DoAllocate(size_t bytes, size_t alignment) override {
+    std::cout << "Allocating " << bytes << std::endl;
+    return memory_->Allocate(bytes, alignment);
+  }
+
+  void DoDeallocate(void *p, size_t bytes, size_t alignment) override {
+    std::cout << "Deallocating " << bytes << std::endl;
+    return memory_->Deallocate(p, bytes, alignment);
+  }
+
+  bool DoIsEqual(const utils::MemoryResource &other) const noexcept override { return memory_->IsEqual(other); }
+
+  utils::MemoryResource *memory_;
+};
+#endif
+
 // Allocate memory with the OutOfMemoryException enabled if the requested size
 // puts total allocated amount over the limit.
 class ResourceWithOutOfMemoryException : public MemoryResource {

tests/benchmark/data_structures/ring_buffer.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <benchmark/benchmark.h>
 #include <benchmark/benchmark_api.h>
 #include <iostream>

tests/benchmark/expansion.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <benchmark/benchmark.h>
 #include <benchmark/benchmark_api.h>
 

tests/benchmark/query/eval.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <benchmark/benchmark.h>
 
 #include "query/db_accessor.hpp"

tests/benchmark/query/execution.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <random>
 #include <string>
 

tests/benchmark/query/planner.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <benchmark/benchmark_api.h>
 #include <string>
 #include <variant>

tests/benchmark/query/profile.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <memory>
 #include <vector>
 

tests/benchmark/query/stripped.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #define LOG_NO_INFO 1
 
 #include <fstream>

tests/benchmark/rpc.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <optional>
 #include <thread>
 

tests/benchmark/skip_list_common.hpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #pragma once
 
 #include <atomic>

tests/benchmark/skip_list_random.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include "skip_list_common.hpp"
 
 #include "utils/skip_list.hpp"

tests/benchmark/skip_list_real_world.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include "skip_list_common.hpp"
 
 #include "utils/skip_list.hpp"

tests/benchmark/skip_list_same_item.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include "skip_list_common.hpp"
 
 #include "utils/skip_list.hpp"

tests/benchmark/skip_list_vs_stl.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <chrono>
 #include <iostream>
 #include <map>

tests/benchmark/storage_v2_gc.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <iostream>
 
 #include <gflags/gflags.h>

tests/benchmark/storage_v2_property_store.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <chrono>
 #include <iostream>
 #include <map>

tests/concurrent/common.hpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <chrono>
 #include <future>
 #include <iostream>

tests/concurrent/network_common.hpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #pragma once
 
 #include <array>

tests/concurrent/network_read_hang.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #ifndef NDEBUG
 #define NDEBUG
 #endif

tests/concurrent/network_server.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #ifndef NDEBUG
 #define NDEBUG
 #endif

tests/concurrent/network_session_leak.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #ifndef NDEBUG
 #define NDEBUG
 #endif

tests/concurrent/skip_list_insert.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <thread>
 #include <vector>
 

tests/concurrent/skip_list_insert_competitive.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <atomic>
 #include <thread>
 #include <vector>

tests/concurrent/skip_list_mixed.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <atomic>
 #include <chrono>
 #include <random>

tests/concurrent/skip_list_remove.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <thread>
 #include <vector>
 

tests/concurrent/skip_list_remove_competitive.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <atomic>
 #include <thread>
 #include <vector>

tests/concurrent/spin_lock.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <atomic>
 #include <chrono>
 #include <mutex>

tests/concurrent/stack.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <atomic>
 #include <chrono>
 #include <cstring>

tests/concurrent/storage_indices.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <thread>
 #include <unordered_map>
 

tests/concurrent/storage_unique_constraints.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <thread>
 
 #include <gtest/gtest.h>

tests/drivers/python/v4_1/docs_how_to_query.py

@@ -1,6 +1,17 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
 
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import sys
 from neo4j import GraphDatabase, basic_auth
 

tests/drivers/python/v4_1/max_query_length.py

@@ -1,6 +1,17 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
 
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 from neo4j import GraphDatabase, basic_auth
 
 driver = GraphDatabase.driver("bolt://localhost:7687",

tests/drivers/python/v4_1/transactions.py

@@ -1,6 +1,17 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
 
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 from neo4j import GraphDatabase, basic_auth
 from neo4j.exceptions import ClientError, TransientError
 

tests/e2e/isolation_levels/isolation_levels.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 #include <mgclient.hpp>
 

tests/e2e/memgraph.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import copy
 import os
 import subprocess

tests/e2e/memory/memory_control.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 #include <mgclient.hpp>
 

tests/e2e/memory/memory_limit_global_alloc.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 #include <mgclient.hpp>
 

tests/e2e/memory/memory_limit_global_alloc_proc.cpp

@@ -1,6 +1,16 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 #include <mgclient.hpp>
-#include <algorithm>
 
 #include "utils/logging.hpp"
 #include "utils/timer.hpp"

tests/e2e/replication/common.hpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <chrono>
 #include <random>
 

tests/e2e/replication/constraints.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <chrono>
 #include <random>
 #include <thread>

tests/e2e/replication/read_write_benchmark.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <chrono>
 #include <fstream>
 #include <random>

tests/e2e/runner.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 from argparse import ArgumentParser
 import atexit
 import logging

tests/e2e/streams/common.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import mgclient
 import time
 
@@ -10,7 +21,8 @@ BATCH_INTERVAL = 3
 BATCH_SIZE = 4
 TRANSFORM = 5
 OWNER = 6
-IS_RUNNING = 7
+BOOTSTRAP_SERVERS = 7
+IS_RUNNING = 8
 
 
 def execute_and_fetch_all(cursor, query):

tests/e2e/streams/conftest.py

@@ -1,8 +1,19 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import pytest
 from kafka import KafkaProducer
 from kafka.admin import KafkaAdminClient, NewTopic
 
-from common import execute_and_fetch_all, connect, NAME
+from common import NAME, connect, execute_and_fetch_all
 
 # To run these test locally a running Kafka sever is necessery. The test tries
 # to connect on localhost:9092.
@@ -18,22 +29,24 @@ def connection():
     for stream_info in stream_infos:
         execute_and_fetch_all(cursor, f"DROP STREAM {stream_info[NAME]}")
     users = execute_and_fetch_all(cursor, "SHOW USERS")
-    for username, in users:
+    for (username,) in users:
         execute_and_fetch_all(cursor, f"DROP USER {username}")
 
 
 @pytest.fixture(scope="function")
 def topics():
-    admin_client = KafkaAdminClient(
-        bootstrap_servers="localhost:9092", client_id='test')
+    admin_client = KafkaAdminClient(bootstrap_servers="localhost:9092", client_id="test")
+    # The issue arises if we remove default kafka topics, e.g. "__consumer_offsets"
+    previous_topics = [topic for topic in admin_client.list_topics() if topic != "__consumer_offsets"]
+    if previous_topics:
+        admin_client.delete_topics(topics=previous_topics, timeout_ms=5000)
 
     topics = []
     topics_to_create = []
     for index in range(3):
         topic = f"topic_{index}"
         topics.append(topic)
-        topics_to_create.append(NewTopic(name=topic,
-                                num_partitions=1, replication_factor=1))
+        topics_to_create.append(NewTopic(name=topic, num_partitions=1, replication_factor=1))
 
     admin_client.create_topics(new_topics=topics_to_create, timeout_ms=5000)
     yield topics

tests/e2e/streams/streams_owner_tests.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import sys
 import pytest
 import time
@@ -68,7 +79,7 @@ def test_owner_is_shown(topics, connection):
 
     common.check_stream_info(userless_cursor, "test", ("test", [
         topics[0]], "mg_consumer", None, None,
-        "transform.simple", stream_user, False))
+        "transform.simple", stream_user, "localhost:9092", False))
 
 
 def test_insufficient_privileges(producer, topics, connection):

tests/e2e/streams/streams_tests.py

@@ -1,5 +1,16 @@
 #!/usr/bin/python3
 
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import sys
 import pytest
 import mgclient
@@ -172,7 +183,8 @@ def test_show_streams(producer, topics, connection):
     common.execute_and_fetch_all(cursor,
                                  "CREATE STREAM default_values "
                                  f"TOPICS {topics[0]} "
-                                 f"TRANSFORM transform.simple")
+                                 f"TRANSFORM transform.simple "
+                                 f"BOOTSTRAP_SERVERS \'localhost:9092\'")
 
     consumer_group = "my_special_consumer_group"
     batch_interval = 42
@@ -189,7 +201,7 @@ def test_show_streams(producer, topics, connection):
 
     common.check_stream_info(cursor, "default_values", ("default_values", [
         topics[0]], "mg_consumer", None, None,
-        "transform.simple", None, False))
+        "transform.simple", None, "localhost:9092", False))
 
     common.check_stream_info(cursor, "complex_values", (
         "complex_values",
@@ -199,6 +211,7 @@ def test_show_streams(producer, topics, connection):
         batch_size,
         "transform.with_parameters",
         None,
+        "localhost:9092",
         False))
 
 
@@ -377,5 +390,38 @@ def test_restart_after_error(producer, topics, connection):
         cursor, "MATCH (n:VERTEX { id : 42 }) RETURN n")
 
 
+@pytest.mark.parametrize("transformation", TRANSFORMATIONS_TO_CHECK)
+def test_bootstrap_server(producer, topics, connection, transformation):
+    assert len(topics) > 0
+    cursor = connection.cursor()
+    local = "localhost:9092"
+    common.execute_and_fetch_all(cursor,
+                                 "CREATE STREAM test "
+                                 f"TOPICS {','.join(topics)} "
+                                 f"TRANSFORM {transformation} "
+                                 f"BOOTSTRAP_SERVERS \'{local}\'")
+    common.start_stream(cursor, "test")
+    time.sleep(5)
+
+    for topic in topics:
+        producer.send(topic, SIMPLE_MSG).get(timeout=60)
+
+    for topic in topics:
+        common.check_vertex_exists_with_topic_and_payload(
+            cursor, topic, SIMPLE_MSG)
+
+
+@pytest.mark.parametrize("transformation", TRANSFORMATIONS_TO_CHECK)
+def test_bootstrap_server_empty(producer, topics, connection, transformation):
+    assert len(topics) > 0
+    cursor = connection.cursor()
+    with pytest.raises(mgclient.DatabaseError):
+        common.execute_and_fetch_all(cursor,
+                                     "CREATE STREAM test "
+                                     f"TOPICS {','.join(topics)} "
+                                     f"TRANSFORM {transformation} "
+                                     "BOOTSTRAP_SERVERS ''")
+
+
 if __name__ == "__main__":
     sys.exit(pytest.main([__file__, "-rA"]))

tests/e2e/streams/transformations/transform.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import mgp
 
 

tests/e2e/temporal_types/roundtrip.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <variant>
 
 #include <gflags/gflags.h>

tests/e2e/triggers/common.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include "common.hpp"
 
 #include <chrono>

tests/e2e/triggers/common.hpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #pragma once
 
 #include <memory>

tests/e2e/triggers/on_create_triggers.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <string>
 #include <string_view>
 

tests/e2e/triggers/on_delete_triggers.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <string>
 #include <string_view>
 #include <unordered_set>

tests/e2e/triggers/on_update_triggers.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <string>
 #include <string_view>
 

tests/e2e/triggers/privilige_check.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <string>
 #include <string_view>
 

tests/e2e/triggers/procedures/write.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import mgp
 
 @mgp.write_proc

tests/e2e/write_procedures/common.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import mgclient
 import typing
 

tests/e2e/write_procedures/conftest.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import pytest
 
 from common import execute_and_fetch_all, connect

tests/e2e/write_procedures/procedures/read.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import mgp
 
 

tests/e2e/write_procedures/procedures/write.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import mgp
 
 

tests/e2e/write_procedures/simple_write.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import typing
 import mgclient
 import sys

tests/gql_behave/environment.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 import json

tests/gql_behave/run.py

@@ -1,6 +1,17 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
 
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import argparse
 import os
 import sys

tests/gql_behave/steps/binary_tree.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 from behave import given

tests/gql_behave/steps/database.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 def query(q, context, params={}):

tests/gql_behave/steps/errors.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 from behave import then

tests/gql_behave/steps/graph.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 import database

tests/gql_behave/steps/parser.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 

tests/gql_behave/steps/query.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 import database

tests/gql_behave/steps/test_parameters.py

@@ -1,3 +1,14 @@
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 # -*- coding: utf-8 -*-
 
 import yaml

tests/gql_behave/tests/memgraph_V1/features/memgraph_wshortest.feature

@@ -40,10 +40,10 @@ Feature: Weighted Shortest Path
           MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
           """
       Then the result should be:
-          | m.a | s | w   |
-          | '1' | 1 | 1.0 |
-          | '2' | 2 | 3.0 |
-          | '3' | 1 | 4.0 |
+          | m.a | s | w |
+          | '1' | 1 | 1 |
+          | '2' | 2 | 3 |
+          | '3' | 1 | 4 |
 
   Scenario: Test match wShortest single edge type filtered
       Given an empty graph
@@ -116,4 +116,42 @@ Feature: Weighted Shortest Path
           """
       Then an error should be raised
 
+  Scenario: Test match wShortest weight duration
+      Given an empty graph
+      And having executed:
+          """
+          CREATE (n {a:'0'})-[:r {w: DURATION('PT1S')}]->({a:'1'})-[:r {w: DURATION('PT2S')}]->({a:'2'}), (n)-[:r {w: DURATION('PT4S')}]->({a:'3'})
+          """
+      When executing query:
+          """
+          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
+          """
+      Then the result should be:
+          | m.a | s | w    |
+          | '1' | 1 | PT1S |
+          | '2' | 2 | PT3S |
+          | '3' | 1 | PT4S |
 
+  Scenario: Test match wShortest weight negative duration
+      Given an empty graph
+      And having executed:
+          """
+          CREATE (n {a:'0'})-[:r {w: DURATION({seconds: -1})}]->({a:'1'})-[:r {w: DURATION('PT2S')}]->({a:'2'}), (n)-[:r {w: DURATION('PT4S')}]->({a:'3'})
+          """
+      When executing query:
+          """
+          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
+          """
+      Then an error should be raised
+
+  Scenario: Test match wShortest weight mixed numeric and duration as weights
+      Given an empty graph
+      And having executed:
+          """
+          CREATE (n {a:'0'})-[:r {w: 2}]->({a:'1'})-[:r {w: DURATION('PT2S')}]->({a:'2'}), (n)-[:r {w: DURATION('PT4S')}]->({a:'3'})
+          """
+      When executing query:
+          """
+          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
+          """
+      Then an error should be raised

tests/gql_behave/tests/stackoverflow_answers/features/wsp.feature

@@ -26,5 +26,5 @@ Feature: Queries related to all Stackoverflow questions related to WSP
       """
     Then the result should be:
       | hops        | total_weight |
-      |'1 -> 3 -> 4'| 17.0         |
+      |'1 -> 3 -> 4'| 17           |
 

tests/integration/audit/runner.py

@@ -1,4 +1,16 @@
 #!/usr/bin/python3 -u
+
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import argparse
 import atexit
 import csv

tests/integration/audit/tester.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 
 #include <json/json.hpp>

tests/integration/auth/checker.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 
 #include "communication/bolt/client.hpp"

tests/integration/auth/runner.py

@@ -1,4 +1,16 @@
 #!/usr/bin/python3 -u
+
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import argparse
 import atexit
 import os

tests/integration/auth/tester.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 
 #include "communication/bolt/client.hpp"

tests/integration/durability/runner.py

@@ -1,4 +1,16 @@
 #!/usr/bin/python3 -u
+
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import argparse
 import atexit
 import os

tests/integration/ldap/runner.py

@@ -1,4 +1,16 @@
 #!/usr/bin/python3 -u
+
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import argparse
 import atexit
 import os

tests/integration/ldap/tester.cpp

@@ -1,3 +1,14 @@
+// Copyright 2021 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
 #include <gflags/gflags.h>
 #include <json/json.hpp>
 

tests/integration/mg_import_csv/runner.py

@@ -1,4 +1,16 @@
 #!/usr/bin/python3 -u
+
+# Copyright 2021 Memgraph Ltd.
+#
+# Use of this software is governed by the Business Source License
+# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+# License, and you may not use this file except in compliance with the Business Source License.
+#
+# As of the Change Date specified in that file, in accordance with
+# the Business Source License, use of this software will be governed
+# by the Apache License, Version 2.0, included in the file
+# licenses/APL.txt.
+
 import argparse
 import atexit
 import os