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
|
/**
* Tests the behavior of the $_internalBoundedSort stage with a compound sort key.
*
* @tags: [
* requires_fcv_60,
* # Cannot insert into a time-series collection in a multi-document transaction.
* does_not_support_transactions,
* # Refusing to run a test that issues an aggregation command with explain because it may return
* # incomplete results if interrupted by a stepdown.
* does_not_support_stepdowns,
* # Explain of a resolved view must be executed by mongos.
* directly_against_shardsvrs_incompatible,
* ]
*/
(function() {
"use strict";
load('jstests/libs/analyze_plan.js');
load("jstests/core/timeseries/libs/timeseries.js");
if (!TimeseriesTest.bucketUnpackWithSortEnabled(db.getMongo())) {
jsTestLog("Skipping test because 'BucketUnpackWithSort' is disabled.");
return;
}
const coll = db.timeseries_internal_bounded_sort_compound;
const buckets = db['system.buckets.' + coll.getName()];
coll.drop();
assert.commandWorked(
db.createCollection(coll.getName(), {timeseries: {timeField: 't', metaField: 'm'}}));
const bucketMaxSpanSeconds =
db.getCollectionInfos({name: coll.getName()})[0].options.timeseries.bucketMaxSpanSeconds;
assert.commandWorked(coll.createIndex({m: 1, t: 1}));
assert.commandWorked(coll.createIndex({m: 1, t: -1}));
assert.commandWorked(coll.createIndex({m: -1, t: 1}));
assert.commandWorked(coll.createIndex({m: -1, t: -1}));
// Insert some data.
{
const numSeries = 5;
const numBatchesPerSeries = 5;
const batchSize = 120; // 2 hours, if events are 1 minute apart
const start = new Date();
const intervalMillis = 1000 * 60; // 1 minute
for (let seriesIx = 0; seriesIx < numSeries; ++seriesIx) {
for (let batchIx = 0; batchIx < numBatchesPerSeries; ++batchIx) {
let batch = [];
for (let eventIx = 0; eventIx < batchSize; ++eventIx) {
const eventIxInSeries = batchIx * batchSize + eventIx;
batch.push({
m: seriesIx,
t: new Date(+start + eventIxInSeries * intervalMillis),
});
}
assert.commandWorked(coll.insert(batch));
}
}
const expectedBucketsPerSeries = Math.floor((numBatchesPerSeries * batchSize * intervalMillis) /
(bucketMaxSpanSeconds * 1000));
assert.gte(buckets.aggregate([{$count: 'n'}]).next().n,
expectedBucketsPerSeries * numSeries,
`Expected at least ${expectedBucketsPerSeries} buckets per series ` +
`(${expectedBucketsPerSeries}*${numSeries} total)`);
TimeseriesTest.ensureDataIsDistributedIfSharded(
coll, new Date(+start + ((batchSize / 2) * intervalMillis)));
}
const unpackStage = getAggPlanStages(coll.explain().aggregate(), '$_internalUnpackBucket')[0];
function inOrder(prev, doc, sortSpec) {
const signum = (v) => {
if (v > 0)
return +1;
if (v < 0)
return -1;
return 0;
};
if (signum(doc.m - prev.m) == sortSpec.m) {
// Good: the order on 'm' agrees with the sort spec.
// 't' doesn't matter in this case.
return true;
} else if (doc.m === prev.m) {
// Tie on 'm': compare 't'.
if (signum(doc.t - prev.t) == sortSpec.t) {
// Good: the order on 't' agrees with the sort spec.
return true;
} else if (doc.t === prev.t) {
// Good: tie on both 'm' and 't'.
return true;
} else {
// Bad: 'm' tied and 't' is in the wrong order.
return false;
}
} else {
// Bad: 'm' is in the wrong order.
return false;
}
}
function assertSorted(result, sortSpec) {
assert.eq(['m', 't'], Object.keys(sortSpec), 'Expected a compound sort on {m: _, t: _}');
assert.contains(sortSpec.m, [-1, +1]);
assert.contains(sortSpec.t, [-1, +1]);
if (result.length === 0)
return;
let prev = result[0];
for (const doc of result.slice(1)) {
assert(inOrder(prev, doc, sortSpec),
'Found two docs not in ' + tojson(sortSpec) + ' order: ' + tojson({prev, doc}));
prev = doc;
}
}
function checkAgainstReference(reference, pipeline, hint, sortOrder) {
const opt = coll.aggregate(pipeline, {hint}).toArray();
assertSorted(opt, sortOrder);
assert.eq(reference, opt);
const plan = coll.explain({}).aggregate(pipeline, {hint});
const stages = getAggPlanStages(plan, "$_internalBoundedSort");
assert.neq(null, stages, plan);
assert.lte(1, stages.length, plan);
}
function runTest(sortSpec) {
assert.eq(['m', 't'], Object.keys(sortSpec), 'Expected a compound sort on {m: _, t: _}');
assert.contains(sortSpec.m, [-1, +1]);
assert.contains(sortSpec.t, [-1, +1]);
// Test sorting the whole collection
{
const naiveQuery = [
unpackStage,
{$_internalInhibitOptimization: {}},
{$sort: sortSpec},
];
const reference = buckets.aggregate(naiveQuery).toArray();
assertSorted(reference, sortSpec);
// Check plan using control.min.t
if (sortSpec.t > 0) {
checkAgainstReference(reference,
[
{$sort: sortSpec},
],
sortSpec,
sortSpec);
} else {
const optFromMinQuery = [{$sort: {m: sortSpec.m, t: sortSpec.t}}];
const optFromMin = coll.aggregate(optFromMinQuery).toArray();
assertSorted(optFromMin, sortSpec);
assert.eq(reference, optFromMin);
}
// Check plan using control.max.t
if (sortSpec.t > 0) {
const optFromMaxQuery = [{$sort: {m: sortSpec.m, t: sortSpec.t}}];
const optFromMax =
coll.aggregate(optFromMaxQuery, {hint: {m: -sortSpec.m, t: -sortSpec.t}}).toArray();
assertSorted(optFromMax, sortSpec);
assert.eq(reference, optFromMax);
} else {
checkAgainstReference(reference,
[
{$sort: sortSpec},
],
sortSpec,
sortSpec);
}
}
// Test $sort + $limit.
{
const naiveQuery = [
unpackStage,
{$_internalInhibitOptimization: {}},
{$sort: sortSpec},
{$limit: 100},
];
const naive = buckets.aggregate(naiveQuery).toArray();
assertSorted(naive, sortSpec);
assert.eq(100, naive.length);
const optFromMinQuery = [
{$sort: {meta: sortSpec.m, 'control.min.t': sortSpec.t}},
unpackStage,
{
$_internalBoundedSort: {
sortKey: sortSpec,
bound: sortSpec.t > 0 ? {base: "min"}
: {base: "min", offsetSeconds: bucketMaxSpanSeconds},
limit: 100
}
}
];
const optFromMin = buckets.aggregate(optFromMinQuery).toArray();
assertSorted(optFromMin, sortSpec);
assert.eq(100, optFromMin.length);
assert.eq(naive, optFromMin);
const optFromMaxQuery = [
{$sort: {meta: sortSpec.m, 'control.max.t': sortSpec.t}},
unpackStage,
{
$_internalBoundedSort: {
sortKey: sortSpec,
bound: sortSpec.t > 0 ? {base: "max", offsetSeconds: -bucketMaxSpanSeconds}
: {base: "max"},
limit: 100
}
}
];
const optFromMax = buckets.aggregate(optFromMaxQuery).toArray();
assertSorted(optFromMax, sortSpec);
assert.eq(100, optFromMax.length);
assert.eq(naive, optFromMax);
}
}
runTest({m: +1, t: +1});
runTest({m: +1, t: -1});
runTest({m: -1, t: +1});
runTest({m: -1, t: -1});
})();
|
