Implement Transitive Paths using binary search instead of a hash map

src/engine/CMakeLists.txt

@@ -7,7 +7,8 @@ add_library(engine
         Distinct.cpp OrderBy.cpp Filter.cpp
         Server.cpp QueryPlanner.cpp QueryPlanningCostFactors.cpp
         OptionalJoin.cpp CountAvailablePredicates.cpp GroupBy.cpp HasPredicateScan.cpp
-        Union.cpp MultiColumnJoin.cpp TransitivePath.cpp Service.cpp
+        Union.cpp MultiColumnJoin.cpp TransitivePathBase.cpp
+        TransitivePathHashMap.cpp TransitivePathBinSearch.cpp Service.cpp
         Values.cpp Bind.cpp Minus.cpp RuntimeInformation.cpp CheckUsePatternTrick.cpp
         VariableToColumnMap.cpp ExportQueryExecutionTrees.cpp
         CartesianProductJoin.cpp TextIndexScanForWord.cpp TextIndexScanForEntity.cpp 

src/engine/QueryExecutionTree.cpp

@@ -30,7 +30,7 @@
 #include "engine/Sort.h"
 #include "engine/TextIndexScanForEntity.h"
 #include "engine/TextIndexScanForWord.h"
-#include "engine/TransitivePath.h"
+#include "engine/TransitivePathBase.h"
 #include "engine/Union.h"
 #include "engine/Values.h"
 #include "engine/ValuesForTesting.h"
@@ -158,7 +158,7 @@ void QueryExecutionTree::setOperation(std::shared_ptr<Op> operation) {
     type_ = VALUES;
   } else if constexpr (std::is_same_v<Op, Service>) {
     type_ = SERVICE;
-  } else if constexpr (std::is_same_v<Op, TransitivePath>) {
+  } else if constexpr (std::is_same_v<Op, TransitivePathBase>) {
     type_ = TRANSITIVE_PATH;
   } else if constexpr (std::is_same_v<Op, OrderBy>) {
     type_ = ORDER_BY;
@@ -204,7 +204,8 @@ template void QueryExecutionTree::setOperation(std::shared_ptr<Sort>);
 template void QueryExecutionTree::setOperation(std::shared_ptr<Distinct>);
 template void QueryExecutionTree::setOperation(std::shared_ptr<Values>);
 template void QueryExecutionTree::setOperation(std::shared_ptr<Service>);
-template void QueryExecutionTree::setOperation(std::shared_ptr<TransitivePath>);
+template void QueryExecutionTree::setOperation(
+    std::shared_ptr<TransitivePathBase>);
 template void QueryExecutionTree::setOperation(std::shared_ptr<OrderBy>);
 template void QueryExecutionTree::setOperation(std::shared_ptr<GroupBy>);
 template void QueryExecutionTree::setOperation(

src/engine/QueryPlanner.cpp

@@ -28,7 +28,7 @@
 #include "engine/Sort.h"
 #include "engine/TextIndexScanForEntity.h"
 #include "engine/TextIndexScanForWord.h"
-#include "engine/TransitivePath.h"
+#include "engine/TransitivePathBase.h"
 #include "engine/Union.h"
 #include "engine/Values.h"
 #include "parser/Alias.h"
@@ -435,8 +435,11 @@ std::vector<QueryPlanner::SubtreePlan> QueryPlanner::optimize(
           right.value_ = getSideValue(arg._right);
           size_t min = arg._min;
           size_t max = arg._max;
-          auto plan = makeSubtreePlan<TransitivePath>(_qec, sub._qet, left,
-                                                      right, min, max);
+          auto transitivePath = TransitivePathBase::makeTransitivePath(
+              _qec, std::move(sub._qet), std::move(left), std::move(right), min,
+              max);
+          auto plan =
+              makeSubtreePlan<TransitivePathBase>(std::move(transitivePath));
           candidatesOut.push_back(std::move(plan));
         }
         joinCandidates(std::move(candidatesOut));
@@ -1890,7 +1893,7 @@ auto QueryPlanner::createJoinWithTransitivePath(
   std::shared_ptr<QueryExecutionTree> otherTree =
       aIsTransPath ? b._qet : a._qet;
   auto& transPathTree = aIsTransPath ? a._qet : b._qet;
-  auto transPathOperation = std::dynamic_pointer_cast<TransitivePath>(
+  auto transPathOperation = std::dynamic_pointer_cast<TransitivePathBase>(
       transPathTree->getRootOperation());
 
   // TODO: Handle the case of two or more common variables