1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* 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
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* 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 Server Side 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/document_source.h"
#include "mongo/db/pipeline/document_source_unwind.h"
#include "mongo/db/pipeline/expression.h"
#include "mongo/db/pipeline/lookup_set_cache.h"
#include "mongo/db/pipeline/value_comparator.h"
namespace mongo {
class DocumentSourceGraphLookUp final : public DocumentSource {
public:
static std::unique_ptr<LiteParsedDocumentSourceForeignCollections> liteParse(
const AggregationRequest& request, const BSONElement& spec);
GetNextResult getNext() final;
const char* getSourceName() const final;
void serializeToArray(
std::vector<Value>& array,
boost::optional<ExplainOptions::Verbosity> explain = boost::none) const final;
/**
* Returns the 'as' path, and possibly the fields modified by an absorbed $unwind.
*/
GetModPathsReturn getModifiedPaths() const final;
StageConstraints constraints(Pipeline::SplitState pipeState) const final {
// TODO SERVER-27533 Until we remove the restriction of only performing lookups from mongos,
// this stage must run on mongos if the output collection is sharded.
HostTypeRequirement hostRequirement =
(pExpCtx->inMongos && pExpCtx->mongoProcessInterface->isSharded(pExpCtx->opCtx, _from))
? HostTypeRequirement::kMongoS
: HostTypeRequirement::kPrimaryShard;
StageConstraints constraints(StreamType::kStreaming,
PositionRequirement::kNone,
hostRequirement,
DiskUseRequirement::kNoDiskUse,
FacetRequirement::kAllowed,
TransactionRequirement::kAllowed);
constraints.canSwapWithMatch = true;
return constraints;
}
boost::optional<MergingLogic> mergingLogic() final {
// {shardsStage, mergingStage, sortPattern}
return MergingLogic{nullptr, this, boost::none};
}
DepsTracker::State getDependencies(DepsTracker* deps) const final {
_startWith->addDependencies(deps);
return DepsTracker::State::SEE_NEXT;
};
void addInvolvedCollections(stdx::unordered_set<NamespaceString>* collectionNames) const final;
void detachFromOperationContext() final;
void reattachToOperationContext(OperationContext* opCtx) final;
static boost::intrusive_ptr<DocumentSourceGraphLookUp> create(
const boost::intrusive_ptr<ExpressionContext>& expCtx,
NamespaceString fromNs,
std::string asField,
std::string connectFromField,
std::string connectToField,
boost::intrusive_ptr<Expression> startWith,
boost::optional<BSONObj> additionalFilter,
boost::optional<FieldPath> depthField,
boost::optional<long long> maxDepth,
boost::optional<boost::intrusive_ptr<DocumentSourceUnwind>> unwindSrc);
static boost::intrusive_ptr<DocumentSource> createFromBson(
BSONElement elem, const boost::intrusive_ptr<ExpressionContext>& pExpCtx);
protected:
void doDispose() final;
/**
* Attempts to combine with a subsequent $unwind stage, setting the internal '_unwind' field.
*/
Pipeline::SourceContainer::iterator doOptimizeAt(Pipeline::SourceContainer::iterator itr,
Pipeline::SourceContainer* container) final;
private:
DocumentSourceGraphLookUp(
const boost::intrusive_ptr<ExpressionContext>& expCtx,
NamespaceString from,
std::string as,
std::string connectFromField,
std::string connectToField,
boost::intrusive_ptr<Expression> startWith,
boost::optional<BSONObj> additionalFilter,
boost::optional<FieldPath> depthField,
boost::optional<long long> maxDepth,
boost::optional<boost::intrusive_ptr<DocumentSourceUnwind>> unwindSrc);
Value serialize(boost::optional<ExplainOptions::Verbosity> explain = boost::none) const final {
// Should not be called; use serializeToArray instead.
MONGO_UNREACHABLE;
}
/**
* Prepares the query to execute on the 'from' collection wrapped in a $match by using the
* contents of '_frontier'.
*
* Fills 'cached' with any values that were retrieved from the cache.
*
* Returns boost::none if no query is necessary, i.e., all values were retrieved from the cache.
* Otherwise, returns a query object.
*/
boost::optional<BSONObj> makeMatchStageFromFrontier(DocumentUnorderedSet* cached);
/**
* If we have internalized a $unwind, getNext() dispatches to this function.
*/
GetNextResult getNextUnwound();
/**
* Perform a breadth-first search of the 'from' collection. '_frontier' should already be
* populated with the values for the initial query. Populates '_discovered' with the result(s)
* of the query.
*/
void doBreadthFirstSearch();
/**
* Populates '_frontier' with the '_startWith' value(s) from '_input' and then performs a
* breadth-first search. Caller should check that _input is not boost::none.
*/
void performSearch();
/**
* Updates '_cache' with 'result' appropriately, given that 'result' was retrieved when querying
* for 'queried'.
*/
void addToCache(const Document& result, const ValueUnorderedSet& queried);
/**
* Assert that '_visited' and '_frontier' have not exceeded the maximum meory usage, and then
* evict from '_cache' until this source is using less than '_maxMemoryUsageBytes'.
*/
void checkMemoryUsage();
/**
* Process 'result', adding it to '_visited' with the given 'depth', and updating '_frontier'
* with the object's 'connectTo' values.
*
* Returns whether '_visited' was updated, and thus, whether the search should recurse.
*/
bool addToVisitedAndFrontier(Document result, long long depth);
// $graphLookup options.
NamespaceString _from;
FieldPath _as;
FieldPath _connectFromField;
FieldPath _connectToField;
boost::intrusive_ptr<Expression> _startWith;
boost::optional<BSONObj> _additionalFilter;
boost::optional<FieldPath> _depthField;
boost::optional<long long> _maxDepth;
// The ExpressionContext used when performing aggregation pipelines against the '_from'
// namespace.
boost::intrusive_ptr<ExpressionContext> _fromExpCtx;
// The aggregation pipeline to perform against the '_from' namespace.
std::vector<BSONObj> _fromPipeline;
size_t _maxMemoryUsageBytes = 100 * 1024 * 1024;
// Track memory usage to ensure we don't exceed '_maxMemoryUsageBytes'.
size_t _visitedUsageBytes = 0;
size_t _frontierUsageBytes = 0;
// Only used during the breadth-first search, tracks the set of values on the current frontier.
ValueUnorderedSet _frontier;
// Tracks nodes that have been discovered for a given input. Keys are the '_id' value of the
// document from the foreign collection, value is the document itself. The keys are compared
// using the simple collation.
ValueUnorderedMap<Document> _visited;
// Caches query results to avoid repeating any work. This structure is maintained across calls
// to getNext().
LookupSetCache _cache;
// When we have internalized a $unwind, we must keep track of the input document, since we will
// need it for multiple "getNext()" calls.
boost::optional<Document> _input;
// Keep track of a $unwind that was absorbed into this stage.
boost::optional<boost::intrusive_ptr<DocumentSourceUnwind>> _unwind;
// If we absorbed a $unwind that specified 'includeArrayIndex', this is used to populate that
// field, tracking how many results we've returned so far for the current input document.
long long _outputIndex;
};
} // namespace mongo
|