summaryrefslogtreecommitdiff
path: root/src/mongo/s/query/cluster_aggregation_planner.h
diff options
context:
space:
mode:
authorCharlie Swanson <charlie.swanson@mongodb.com>2018-08-15 11:36:42 -0400
committerCharlie Swanson <charlie.swanson@mongodb.com>2018-08-20 14:56:12 -0400
commitbb9f6662e1f98b633df4d22082b5810d786fb620 (patch)
tree93110f45acf771094cc694fa3ff37943a415fada /src/mongo/s/query/cluster_aggregation_planner.h
parent7bc9953a256c1fab8b772812e712b909fefc4535 (diff)
downloadmongo-bb9f6662e1f98b633df4d22082b5810d786fb620.tar.gz
SERVER-33323 New cluster_aggregate library
This new library contains both cluster_aggregate.cpp and cluster_aggregation_planner.cpp. Both of these files are moved to the src/mongo/s/query directory where the new library lives.
Diffstat (limited to 'src/mongo/s/query/cluster_aggregation_planner.h')
-rw-r--r--src/mongo/s/query/cluster_aggregation_planner.h93
1 files changed, 93 insertions, 0 deletions
diff --git a/src/mongo/s/query/cluster_aggregation_planner.h b/src/mongo/s/query/cluster_aggregation_planner.h
new file mode 100644
index 00000000000..3b3aaa63df4
--- /dev/null
+++ b/src/mongo/s/query/cluster_aggregation_planner.h
@@ -0,0 +1,93 @@
+/**
+ * Copyright (C) 2018 MongoDB Inc.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License, version 3,
+ * as published by the Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ * As a special exception, the copyright holders give permission to link the
+ * code of portions of this program with the OpenSSL library under certain
+ * conditions as described in each individual source file and distribute
+ * linked combinations including the program with the OpenSSL library. You
+ * must comply with the GNU Affero General Public License in all respects
+ * for all of the code used other than as permitted herein. If you modify
+ * file(s) with this exception, you may extend this exception to your
+ * version of the file(s), but you are not obligated to do so. If you do not
+ * wish to do so, delete this exception statement from your version. If you
+ * delete this exception statement from all source files in the program,
+ * then also delete it in the license file.
+ */
+
+#pragma once
+
+#include "mongo/db/pipeline/lite_parsed_pipeline.h"
+#include "mongo/db/pipeline/pipeline.h"
+#include "mongo/s/query/cluster_client_cursor_impl.h"
+
+namespace mongo {
+namespace cluster_aggregation_planner {
+
+/**
+ * Represents the two halves of a pipeline that will execute in a sharded cluster. 'shardsPipeline'
+ * will execute in parallel on each shard, and 'mergePipeline' will execute on the merge host -
+ * either one of the shards or a mongos.
+ */
+struct SplitPipeline {
+ SplitPipeline(std::unique_ptr<Pipeline, PipelineDeleter> shardsPipeline,
+ std::unique_ptr<Pipeline, PipelineDeleter> mergePipeline,
+ boost::optional<BSONObj> shardCursorsSortSpec)
+ : shardsPipeline(std::move(shardsPipeline)),
+ mergePipeline(std::move(mergePipeline)),
+ shardCursorsSortSpec(std::move(shardCursorsSortSpec)) {}
+
+ std::unique_ptr<Pipeline, PipelineDeleter> shardsPipeline;
+ std::unique_ptr<Pipeline, PipelineDeleter> mergePipeline;
+
+ // If set, the cursors from the shards are expected to be sorted according to this spec, and to
+ // have populated a "$sortKey" metadata field which can be used to compare the results.
+ boost::optional<BSONObj> shardCursorsSortSpec;
+};
+
+/**
+ * Split the current Pipeline into a Pipeline for each shard, and a Pipeline that combines the
+ * results within a merging process. This call also performs optimizations with the aim of reducing
+ * computing time and network traffic when a pipeline has been split into two pieces.
+ *
+ * The 'mergePipeline' returned as part of the SplitPipeline here is not ready to execute until the
+ * 'shardsPipeline' has been sent to the shards and cursors have been established. Once cursors have
+ * been established, the merge pipeline can be made executable by calling 'addMergeCursorsSource()'
+ */
+SplitPipeline splitPipeline(std::unique_ptr<Pipeline, PipelineDeleter> pipeline);
+
+/**
+ * Creates a new DocumentSourceMergeCursors from the provided 'remoteCursors' and adds it to the
+ * front of 'mergePipeline'.
+ */
+void addMergeCursorsSource(Pipeline* mergePipeline,
+ const LiteParsedPipeline&,
+ BSONObj cmdSentToShards,
+ std::vector<RemoteCursor> remoteCursors,
+ const std::vector<ShardId>& targetedShards,
+ boost::optional<BSONObj> shardCursorsSortSpec,
+ executor::TaskExecutor*);
+
+/**
+ * Builds a ClusterClientCursor which will execute 'pipeline'. If 'pipeline' consists entirely of
+ * $skip and $limit stages, the pipeline is eliminated entirely and replaced with a RouterExecStage
+ * tree that does same thing but will avoid using a RouterStagePipeline. Avoiding a
+ * RouterStagePipeline will remove an expensive conversion from BSONObj -> Document for each result.
+ */
+ClusterClientCursorGuard buildClusterCursor(OperationContext* opCtx,
+ std::unique_ptr<Pipeline, PipelineDeleter> pipeline,
+ ClusterClientCursorParams&&);
+
+} // namespace cluster_aggregation_planner
+} // namespace mongo