Class CardinalityBasedGreedyJoinPlanOptimizerImpl

java.lang.Object
se.liu.ida.hefquin.engine.queryproc.impl.poptimizer.simple.JoinPlanOptimizerBase
se.liu.ida.hefquin.engine.queryproc.impl.poptimizer.simple.CardinalityBasedGreedyJoinPlanOptimizerImpl
All Implemented Interfaces:
JoinPlanOptimizer

public class CardinalityBasedGreedyJoinPlanOptimizerImpl extends JoinPlanOptimizerBase
This class implements a query optimizer[1] that builds left-deep query plans, for which it uses a greedy approach to determine the join order based on cardinality estimation, and then choose physical algorithm according to the estimated number of request to execute the join. [1] Heling, Lars, and Maribel Acosta. "Federated SPARQL query processing over heterogeneous linked data fragments." Proceedings of the ACM Web Conference 2022.