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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
|
/**
* Copyright (C) 2014 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.
*/
/**
* This file contains tests for mongo/db/query/plan_cache.h
*/
#include "mongo/db/query/plan_cache.h"
#include <algorithm>
#include <memory>
#include <ostream>
#include "mongo/db/jsobj.h"
#include "mongo/db/json.h"
#include "mongo/db/matcher/extensions_callback_disallow_extensions.h"
#include "mongo/db/query/collation/collator_interface_mock.h"
#include "mongo/db/query/plan_ranker.h"
#include "mongo/db/query/query_knobs.h"
#include "mongo/db/query/query_planner.h"
#include "mongo/db/query/query_planner_test_lib.h"
#include "mongo/db/query/query_solution.h"
#include "mongo/db/query/query_test_service_context.h"
#include "mongo/unittest/unittest.h"
#include "mongo/util/assert_util.h"
#include "mongo/util/scopeguard.h"
#include "mongo/util/transitional_tools_do_not_use/vector_spooling.h"
using namespace mongo;
using unittest::assertGet;
namespace {
using std::string;
using std::unique_ptr;
using std::vector;
static const NamespaceString nss("test.collection");
/**
* Utility functions to create a CanonicalQuery
*/
unique_ptr<CanonicalQuery> canonicalize(const BSONObj& queryObj) {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
auto qr = stdx::make_unique<QueryRequest>(nss);
qr->setFilter(queryObj);
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
return std::move(statusWithCQ.getValue());
}
unique_ptr<CanonicalQuery> canonicalize(const char* queryStr) {
BSONObj queryObj = fromjson(queryStr);
return canonicalize(queryObj);
}
unique_ptr<CanonicalQuery> canonicalize(const char* queryStr,
const char* sortStr,
const char* projStr,
const char* collationStr) {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
auto qr = stdx::make_unique<QueryRequest>(nss);
qr->setFilter(fromjson(queryStr));
qr->setSort(fromjson(sortStr));
qr->setProj(fromjson(projStr));
qr->setCollation(fromjson(collationStr));
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
return std::move(statusWithCQ.getValue());
}
unique_ptr<CanonicalQuery> canonicalize(const char* queryStr,
const char* sortStr,
const char* projStr,
long long skip,
long long limit,
const char* hintStr,
const char* minStr,
const char* maxStr) {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
auto qr = stdx::make_unique<QueryRequest>(nss);
qr->setFilter(fromjson(queryStr));
qr->setSort(fromjson(sortStr));
qr->setProj(fromjson(projStr));
if (skip) {
qr->setSkip(skip);
}
if (limit) {
qr->setLimit(limit);
}
qr->setHint(fromjson(hintStr));
qr->setMin(fromjson(minStr));
qr->setMax(fromjson(maxStr));
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
return std::move(statusWithCQ.getValue());
}
unique_ptr<CanonicalQuery> canonicalize(const char* queryStr,
const char* sortStr,
const char* projStr,
long long skip,
long long limit,
const char* hintStr,
const char* minStr,
const char* maxStr,
bool snapshot,
bool explain) {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
auto qr = stdx::make_unique<QueryRequest>(nss);
qr->setFilter(fromjson(queryStr));
qr->setSort(fromjson(sortStr));
qr->setProj(fromjson(projStr));
if (skip) {
qr->setSkip(skip);
}
if (limit) {
qr->setLimit(limit);
}
qr->setHint(fromjson(hintStr));
qr->setMin(fromjson(minStr));
qr->setMax(fromjson(maxStr));
qr->setSnapshot(snapshot);
qr->setExplain(explain);
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
return std::move(statusWithCQ.getValue());
}
/**
* Utility function to create MatchExpression
*/
unique_ptr<MatchExpression> parseMatchExpression(const BSONObj& obj) {
const CollatorInterface* collator = nullptr;
StatusWithMatchExpression status =
MatchExpressionParser::parse(obj, ExtensionsCallbackDisallowExtensions(), collator);
if (!status.isOK()) {
str::stream ss;
ss << "failed to parse query: " << obj.toString()
<< ". Reason: " << status.getStatus().toString();
FAIL(ss);
}
return std::move(status.getValue());
}
void assertEquivalent(const char* queryStr,
const MatchExpression* expected,
const MatchExpression* actual) {
if (actual->equivalent(expected)) {
return;
}
str::stream ss;
ss << "Match expressions are not equivalent."
<< "\nOriginal query: " << queryStr << "\nExpected: " << expected->toString()
<< "\nActual: " << actual->toString();
FAIL(ss);
}
//
// Tests for CachedSolution
//
/**
* Generator for vector of QuerySolution shared pointers.
*/
struct GenerateQuerySolution {
QuerySolution* operator()() const {
unique_ptr<QuerySolution> qs(new QuerySolution());
qs->cacheData.reset(new SolutionCacheData());
qs->cacheData->solnType = SolutionCacheData::COLLSCAN_SOLN;
qs->cacheData->tree.reset(new PlanCacheIndexTree());
return qs.release();
}
};
/**
* Utility function to create a PlanRankingDecision
*/
PlanRankingDecision* createDecision(size_t numPlans) {
unique_ptr<PlanRankingDecision> why(new PlanRankingDecision());
for (size_t i = 0; i < numPlans; ++i) {
CommonStats common("COLLSCAN");
auto stats = stdx::make_unique<PlanStageStats>(common, STAGE_COLLSCAN);
stats->specific.reset(new CollectionScanStats());
why->stats.push_back(std::move(stats));
why->scores.push_back(0U);
why->candidateOrder.push_back(i);
}
return why.release();
}
/**
* Test functions for shouldCacheQuery
* Use these functions to assert which categories
* of canonicalized queries are suitable for inclusion
* in the planner cache.
*/
void assertShouldCacheQuery(const CanonicalQuery& query) {
if (PlanCache::shouldCacheQuery(query)) {
return;
}
str::stream ss;
ss << "Canonical query should be cacheable: " << query.toString();
FAIL(ss);
}
void assertShouldNotCacheQuery(const CanonicalQuery& query) {
if (!PlanCache::shouldCacheQuery(query)) {
return;
}
str::stream ss;
ss << "Canonical query should not be cacheable: " << query.toString();
FAIL(ss);
}
void assertShouldNotCacheQuery(const BSONObj& query) {
unique_ptr<CanonicalQuery> cq(canonicalize(query));
assertShouldNotCacheQuery(*cq);
}
void assertShouldNotCacheQuery(const char* queryStr) {
unique_ptr<CanonicalQuery> cq(canonicalize(queryStr));
assertShouldNotCacheQuery(*cq);
}
/**
* Cacheable queries
* These queries will be added to the cache with run-time statistics
* and can be managed with the cache DB commands.
*/
TEST(PlanCacheTest, ShouldCacheQueryBasic) {
unique_ptr<CanonicalQuery> cq(canonicalize("{a: 1}"));
assertShouldCacheQuery(*cq);
}
TEST(PlanCacheTest, ShouldCacheQuerySort) {
unique_ptr<CanonicalQuery> cq(canonicalize("{}", "{a: -1}", "{_id: 0, a: 1}", "{}"));
assertShouldCacheQuery(*cq);
}
/*
* Non-cacheable queries.
* These queries will be sent through the planning process everytime.
*/
/**
* Collection scan
* This should normally be handled by the IDHack runner.
*/
TEST(PlanCacheTest, ShouldNotCacheQueryCollectionScan) {
unique_ptr<CanonicalQuery> cq(canonicalize("{}"));
assertShouldNotCacheQuery(*cq);
}
/**
* Hint
* A hinted query implies strong user preference for a particular index.
* Therefore, not much point in caching.
*/
TEST(PlanCacheTest, ShouldNotCacheQueryWithHint) {
unique_ptr<CanonicalQuery> cq(
canonicalize("{a: 1}", "{}", "{}", 0, 0, "{a: 1, b: 1}", "{}", "{}"));
assertShouldNotCacheQuery(*cq);
}
/**
* Min queries are a specialized case of hinted queries
*/
TEST(PlanCacheTest, ShouldNotCacheQueryWithMin) {
unique_ptr<CanonicalQuery> cq(canonicalize("{a: 1}", "{}", "{}", 0, 0, "{}", "{a: 100}", "{}"));
assertShouldNotCacheQuery(*cq);
}
/**
* Max queries are non-cacheable for the same reasons as min queries.
*/
TEST(PlanCacheTest, ShouldNotCacheQueryWithMax) {
unique_ptr<CanonicalQuery> cq(canonicalize("{a: 1}", "{}", "{}", 0, 0, "{}", "{}", "{a: 100}"));
assertShouldNotCacheQuery(*cq);
}
/**
* $geoWithin queries with legacy coordinates are cacheable as long as
* the planner is able to come up with a cacheable solution.
*/
TEST(PlanCacheTest, ShouldCacheQueryWithGeoWithinLegacyCoordinates) {
unique_ptr<CanonicalQuery> cq(
canonicalize("{a: {$geoWithin: "
"{$box: [[-180, -90], [180, 90]]}}}"));
assertShouldCacheQuery(*cq);
}
/**
* $geoWithin queries with GeoJSON coordinates are supported by the index bounds builder.
*/
TEST(PlanCacheTest, ShouldCacheQueryWithGeoWithinJSONCoordinates) {
unique_ptr<CanonicalQuery> cq(
canonicalize("{a: {$geoWithin: "
"{$geometry: {type: 'Polygon', coordinates: "
"[[[0, 0], [0, 90], [90, 0], [0, 0]]]}}}}"));
assertShouldCacheQuery(*cq);
}
/**
* $geoWithin queries with both legacy and GeoJSON coordinates are cacheable.
*/
TEST(PlanCacheTest, ShouldCacheQueryWithGeoWithinLegacyAndJSONCoordinates) {
unique_ptr<CanonicalQuery> cq(
canonicalize("{$or: [{a: {$geoWithin: {$geometry: {type: 'Polygon', "
"coordinates: [[[0, 0], [0, 90], "
"[90, 0], [0, 0]]]}}}},"
"{a: {$geoWithin: {$box: [[-180, -90], [180, 90]]}}}]}"));
assertShouldCacheQuery(*cq);
}
/**
* $geoIntersects queries are always cacheable because they support GeoJSON coordinates only.
*/
TEST(PlanCacheTest, ShouldCacheQueryWithGeoIntersects) {
unique_ptr<CanonicalQuery> cq(
canonicalize("{a: {$geoIntersects: "
"{$geometry: {type: 'Point', coordinates: "
"[10.0, 10.0]}}}}"));
assertShouldCacheQuery(*cq);
}
/**
* $geoNear queries are cacheable because we are able to distinguish
* between flat and spherical queries.
*/
TEST(PlanCacheTest, ShouldNotCacheQueryWithGeoNear) {
unique_ptr<CanonicalQuery> cq(
canonicalize("{a: {$geoNear: {$geometry: {type: 'Point',"
"coordinates: [0,0]}, $maxDistance:100}}}"));
assertShouldCacheQuery(*cq);
}
/**
* Explain queries are not-cacheable because of allPlans cannot
* be accurately generated from stale cached stats in the plan cache for
* non-winning plans.
*/
TEST(PlanCacheTest, ShouldNotCacheQueryExplain) {
unique_ptr<CanonicalQuery> cq(canonicalize("{a: 1}",
"{}",
"{}",
0,
0,
"{}",
"{}",
"{}", // min, max
false, // snapshot
true // explain
));
const QueryRequest& qr = cq->getQueryRequest();
ASSERT_TRUE(qr.isExplain());
assertShouldNotCacheQuery(*cq);
}
// Adding an empty vector of query solutions should fail.
TEST(PlanCacheTest, AddEmptySolutions) {
PlanCache planCache;
unique_ptr<CanonicalQuery> cq(canonicalize("{a: 1}"));
std::vector<QuerySolution*> solns;
unique_ptr<PlanRankingDecision> decision(createDecision(1U));
ASSERT_NOT_OK(planCache.add(*cq, solns, decision.get()));
}
TEST(PlanCacheTest, AddValidSolution) {
PlanCache planCache;
unique_ptr<CanonicalQuery> cq(canonicalize("{a: 1}"));
QuerySolution qs;
qs.cacheData.reset(new SolutionCacheData());
qs.cacheData->tree.reset(new PlanCacheIndexTree());
std::vector<QuerySolution*> solns;
solns.push_back(&qs);
// Check if key is in cache before and after add().
ASSERT_FALSE(planCache.contains(*cq));
ASSERT_OK(planCache.add(*cq, solns, createDecision(1U)));
ASSERT_TRUE(planCache.contains(*cq));
ASSERT_EQUALS(planCache.size(), 1U);
}
/**
* Each test in the CachePlanSelectionTest suite goes through
* the following flow:
*
* 1) Run QueryPlanner::plan on the query, with specified indices
* available. This simulates the case in which we failed to plan from
* the plan cache, and fell back on selecting a plan ourselves. The
* enumerator will run, and cache data will be stashed into each solution
* that it generates.
*
* 2) Use firstMatchingSolution to select one of the solutions generated
* by QueryPlanner::plan. This simulates the multi plan runner picking
* the "best solution".
*
* 3) The cache data stashed inside the "best solution" is used to
* make a CachedSolution which looks exactly like the data structure that
* would be returned from the cache. This simulates a plan cache hit.
*
* 4) Call QueryPlanner::planFromCache, passing it the CachedSolution.
* This exercises the code which is able to map from a CachedSolution to
* a full-blown QuerySolution. Finally, assert that the query solution
* recovered from the cache is identical to the original "best solution".
*/
class CachePlanSelectionTest : public mongo::unittest::Test {
protected:
void setUp() {
params.options = QueryPlannerParams::INCLUDE_COLLSCAN;
addIndex(BSON("_id" << 1), "_id_");
}
void tearDown() {
for (vector<QuerySolution*>::iterator it = solns.begin(); it != solns.end(); ++it) {
delete *it;
}
}
void addIndex(BSONObj keyPattern, const std::string& indexName, bool multikey = false) {
// The first false means not multikey.
// The second false means not sparse.
// The NULL means no filter expression.
params.indices.push_back(
IndexEntry(keyPattern, multikey, false, false, indexName, NULL, BSONObj()));
}
void addIndex(BSONObj keyPattern, const std::string& indexName, bool multikey, bool sparse) {
params.indices.push_back(
IndexEntry(keyPattern, multikey, sparse, false, indexName, NULL, BSONObj()));
}
void addIndex(BSONObj keyPattern, const std::string& indexName, CollatorInterface* collator) {
IndexEntry entry(keyPattern, false, false, false, indexName, NULL, BSONObj());
entry.collator = collator;
params.indices.push_back(entry);
}
//
// Execute planner.
//
void runQuery(BSONObj query) {
runQuerySortProjSkipLimit(query, BSONObj(), BSONObj(), 0, 0);
}
void runQuerySortProj(const BSONObj& query, const BSONObj& sort, const BSONObj& proj) {
runQuerySortProjSkipLimit(query, sort, proj, 0, 0);
}
void runQuerySkipLimit(const BSONObj& query, long long skip, long long limit) {
runQuerySortProjSkipLimit(query, BSONObj(), BSONObj(), skip, limit);
}
void runQueryHint(const BSONObj& query, const BSONObj& hint) {
runQuerySortProjSkipLimitHint(query, BSONObj(), BSONObj(), 0, 0, hint);
}
void runQuerySortProjSkipLimit(const BSONObj& query,
const BSONObj& sort,
const BSONObj& proj,
long long skip,
long long limit) {
runQuerySortProjSkipLimitHint(query, sort, proj, skip, limit, BSONObj());
}
void runQuerySortHint(const BSONObj& query, const BSONObj& sort, const BSONObj& hint) {
runQuerySortProjSkipLimitHint(query, sort, BSONObj(), 0, 0, hint);
}
void runQueryHintMinMax(const BSONObj& query,
const BSONObj& hint,
const BSONObj& minObj,
const BSONObj& maxObj) {
runQueryFull(query, BSONObj(), BSONObj(), 0, 0, hint, minObj, maxObj, false);
}
void runQuerySortProjSkipLimitHint(const BSONObj& query,
const BSONObj& sort,
const BSONObj& proj,
long long skip,
long long limit,
const BSONObj& hint) {
runQueryFull(query, sort, proj, skip, limit, hint, BSONObj(), BSONObj(), false);
}
void runQuerySnapshot(const BSONObj& query) {
runQueryFull(query, BSONObj(), BSONObj(), 0, 0, BSONObj(), BSONObj(), BSONObj(), true);
}
void runQueryFull(const BSONObj& query,
const BSONObj& sort,
const BSONObj& proj,
long long skip,
long long limit,
const BSONObj& hint,
const BSONObj& minObj,
const BSONObj& maxObj,
bool snapshot) {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
// Clean up any previous state from a call to runQueryFull or runQueryAsCommand.
for (vector<QuerySolution*>::iterator it = solns.begin(); it != solns.end(); ++it) {
delete *it;
}
solns.clear();
auto qr = stdx::make_unique<QueryRequest>(nss);
qr->setFilter(query);
qr->setSort(sort);
qr->setProj(proj);
if (skip) {
qr->setSkip(skip);
}
if (limit) {
qr->setLimit(limit);
}
qr->setHint(hint);
qr->setMin(minObj);
qr->setMax(maxObj);
qr->setSnapshot(snapshot);
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
Status s = QueryPlanner::plan(*statusWithCQ.getValue(), params, &solns);
ASSERT_OK(s);
}
void runQueryAsCommand(const BSONObj& cmdObj) {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
// Clean up any previous state from a call to runQueryFull or runQueryAsCommand.
for (vector<QuerySolution*>::iterator it = solns.begin(); it != solns.end(); ++it) {
delete *it;
}
solns.clear();
const bool isExplain = false;
std::unique_ptr<QueryRequest> qr(
assertGet(QueryRequest::makeFromFindCommand(nss, cmdObj, isExplain)));
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
Status s = QueryPlanner::plan(*statusWithCQ.getValue(), params, &solns);
ASSERT_OK(s);
}
//
// Solution introspection.
//
void dumpSolutions(str::stream& ost) const {
for (vector<QuerySolution*>::const_iterator it = solns.begin(); it != solns.end(); ++it) {
ost << (*it)->toString() << '\n';
}
}
/**
* Returns number of generated solutions matching JSON.
*/
size_t numSolutionMatches(const string& solnJson) const {
BSONObj testSoln = fromjson(solnJson);
size_t matches = 0;
for (vector<QuerySolution*>::const_iterator it = solns.begin(); it != solns.end(); ++it) {
QuerySolutionNode* root = (*it)->root.get();
if (QueryPlannerTestLib::solutionMatches(testSoln, root)) {
++matches;
}
}
return matches;
}
/**
* Verifies that the solution tree represented in json by 'solnJson' is
* one of the solutions generated by QueryPlanner.
*
* The number of expected matches, 'numMatches', could be greater than
* 1 if solutions differ only by the pattern of index tags on a filter.
*/
void assertSolutionExists(const string& solnJson, size_t numMatches = 1) const {
size_t matches = numSolutionMatches(solnJson);
if (numMatches == matches) {
return;
}
str::stream ss;
ss << "expected " << numMatches << " matches for solution " << solnJson << " but got "
<< matches << " instead. all solutions generated: " << '\n';
dumpSolutions(ss);
FAIL(ss);
}
/**
* Plan 'query' from the cache. A mock cache entry is created using
* the cacheData stored inside the QuerySolution 'soln'.
*
* Does not take ownership of 'soln'.
*/
QuerySolution* planQueryFromCache(const BSONObj& query, const QuerySolution& soln) const {
return planQueryFromCache(query, BSONObj(), BSONObj(), BSONObj(), soln);
}
/**
* Plan 'query' from the cache with sort order 'sort', projection 'proj', and collation
* 'collation'. A mock cache entry is created using the cacheData stored inside the
* QuerySolution 'soln'.
*
* Does not take ownership of 'soln'.
*/
QuerySolution* planQueryFromCache(const BSONObj& query,
const BSONObj& sort,
const BSONObj& proj,
const BSONObj& collation,
const QuerySolution& soln) const {
QueryTestServiceContext serviceContext;
auto opCtx = serviceContext.makeOperationContext();
auto qr = stdx::make_unique<QueryRequest>(nss);
qr->setFilter(query);
qr->setSort(sort);
qr->setProj(proj);
qr->setCollation(collation);
auto statusWithCQ = CanonicalQuery::canonicalize(
opCtx.get(), std::move(qr), ExtensionsCallbackDisallowExtensions());
ASSERT_OK(statusWithCQ.getStatus());
unique_ptr<CanonicalQuery> scopedCq = std::move(statusWithCQ.getValue());
// Create a CachedSolution the long way..
// QuerySolution -> PlanCacheEntry -> CachedSolution
QuerySolution qs;
qs.cacheData.reset(soln.cacheData->clone());
std::vector<QuerySolution*> solutions;
solutions.push_back(&qs);
PlanCacheEntry entry(solutions, createDecision(1U));
CachedSolution cachedSoln(ck, entry);
QuerySolution* out;
Status s = QueryPlanner::planFromCache(*scopedCq, params, cachedSoln, &out);
ASSERT_OK(s);
return out;
}
/**
* @param solnJson -- a json representation of a query solution.
*
* Returns the first solution matching 'solnJson', or fails if
* no match is found.
*/
QuerySolution* firstMatchingSolution(const string& solnJson) const {
BSONObj testSoln = fromjson(solnJson);
for (vector<QuerySolution*>::const_iterator it = solns.begin(); it != solns.end(); ++it) {
QuerySolutionNode* root = (*it)->root.get();
if (QueryPlannerTestLib::solutionMatches(testSoln, root)) {
return *it;
}
}
str::stream ss;
ss << "Could not find a match for solution " << solnJson
<< " All solutions generated: " << '\n';
dumpSolutions(ss);
FAIL(ss);
return NULL;
}
/**
* Assert that the QuerySolution 'trueSoln' matches the JSON-based representation
* of the solution in 'solnJson'.
*
* Relies on solutionMatches() -- see query_planner_test_lib.h
*/
void assertSolutionMatches(QuerySolution* trueSoln, const string& solnJson) const {
BSONObj testSoln = fromjson(solnJson);
if (!QueryPlannerTestLib::solutionMatches(testSoln, trueSoln->root.get())) {
str::stream ss;
ss << "Expected solution " << solnJson
<< " did not match true solution: " << trueSoln->toString() << '\n';
FAIL(ss);
}
}
/**
* Overloaded so that it is not necessary to specificy sort and project.
*/
void assertPlanCacheRecoversSolution(const BSONObj& query, const string& solnJson) {
assertPlanCacheRecoversSolution(query, BSONObj(), BSONObj(), BSONObj(), solnJson);
}
/**
* First, the solution matching 'solnJson' is retrieved from the vector
* of solutions generated by QueryPlanner::plan. This solution is
* then passed into planQueryFromCache(). Asserts that the solution
* generated by QueryPlanner::planFromCache matches 'solnJson'.
*
* Must be called after calling one of the runQuery* methods.
*
* Together, 'query', 'sort', 'proj', and 'collation' should specify the query which was
* previously run using one of the runQuery* methods.
*/
void assertPlanCacheRecoversSolution(const BSONObj& query,
const BSONObj& sort,
const BSONObj& proj,
const BSONObj& collation,
const string& solnJson) {
QuerySolution* bestSoln = firstMatchingSolution(solnJson);
QuerySolution* planSoln = planQueryFromCache(query, sort, proj, collation, *bestSoln);
assertSolutionMatches(planSoln, solnJson);
delete planSoln;
}
/**
* Check that the solution will not be cached. The planner will store
* cache data inside non-cachable solutions, but will not do so for
* non-cachable solutions. Therefore, we just have to check that
* cache data is NULL.
*/
void assertNotCached(const string& solnJson) {
QuerySolution* bestSoln = firstMatchingSolution(solnJson);
ASSERT(NULL != bestSoln);
ASSERT(NULL == bestSoln->cacheData.get());
}
static const PlanCacheKey ck;
BSONObj queryObj;
QueryPlannerParams params;
vector<QuerySolution*> solns;
};
const PlanCacheKey CachePlanSelectionTest::ck = "mock_cache_key";
//
// Equality
//
TEST_F(CachePlanSelectionTest, EqualityIndexScan) {
addIndex(BSON("x" << 1), "x_1");
runQuery(BSON("x" << 5));
assertPlanCacheRecoversSolution(BSON("x" << 5),
"{fetch: {filter: null, node: {ixscan: {pattern: {x: 1}}}}}");
}
TEST_F(CachePlanSelectionTest, EqualityIndexScanWithTrailingFields) {
addIndex(BSON("x" << 1 << "y" << 1), "x_1_y_1");
runQuery(BSON("x" << 5));
assertPlanCacheRecoversSolution(
BSON("x" << 5), "{fetch: {filter: null, node: {ixscan: {pattern: {x: 1, y: 1}}}}}");
}
//
// Geo
//
TEST_F(CachePlanSelectionTest, Basic2DSphereNonNear) {
addIndex(BSON("a"
<< "2dsphere"),
"a_2dsphere");
BSONObj query;
query = fromjson(
"{a: {$geoIntersects: {$geometry: {type: 'Point',"
"coordinates: [10.0, 10.0]}}}}");
runQuery(query);
assertPlanCacheRecoversSolution(query, "{fetch: {node: {ixscan: {pattern: {a: '2dsphere'}}}}}");
query = fromjson("{a : { $geoWithin : { $centerSphere : [[ 10, 20 ], 0.01 ] } }}");
runQuery(query);
assertPlanCacheRecoversSolution(query, "{fetch: {node: {ixscan: {pattern: {a: '2dsphere'}}}}}");
}
TEST_F(CachePlanSelectionTest, Basic2DSphereGeoNear) {
addIndex(BSON("a"
<< "2dsphere"),
"a_2dsphere");
BSONObj query;
query = fromjson("{a: {$nearSphere: [0,0], $maxDistance: 0.31 }}");
runQuery(query);
assertPlanCacheRecoversSolution(query,
"{geoNear2dsphere: {pattern: {a: '2dsphere'}, "
"bounds: {a: [['MinKey', 'MaxKey', true, true]]}}}");
query = fromjson(
"{a: {$geoNear: {$geometry: {type: 'Point', coordinates: [0,0]},"
"$maxDistance:100}}}");
runQuery(query);
assertPlanCacheRecoversSolution(query,
"{geoNear2dsphere: {pattern: {a: '2dsphere'}, "
"bounds: {a: [['MinKey', 'MaxKey', true, true]]}}}");
}
TEST_F(CachePlanSelectionTest, Basic2DSphereGeoNearReverseCompound) {
addIndex(BSON("x" << 1), "x_1");
addIndex(BSON("x" << 1 << "a"
<< "2dsphere"),
"x_1_a_2dsphere");
BSONObj query = fromjson("{x:1, a: {$nearSphere: [0,0], $maxDistance: 0.31 }}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{geoNear2dsphere: {pattern: {x: 1, a: '2dsphere'}, "
"bounds: {x: [[1, 1, true, true]], a: [['MinKey', 'MaxKey', true, true]]}}}");
}
TEST_F(CachePlanSelectionTest, TwoDSphereNoGeoPred) {
addIndex(BSON("x" << 1 << "a"
<< "2dsphere"),
"x_1_a_2dsphere");
runQuery(BSON("x" << 1));
assertPlanCacheRecoversSolution(BSON("x" << 1),
"{fetch: {node: {ixscan: {pattern: {x: 1, a: '2dsphere'}}}}}");
}
TEST_F(CachePlanSelectionTest, Or2DSphereNonNear) {
addIndex(BSON("a"
<< "2dsphere"),
"a_2dsphere");
addIndex(BSON("b"
<< "2dsphere"),
"b_2dsphere");
BSONObj query = fromjson(
"{$or: [ {a: {$geoIntersects: {$geometry: {type: 'Point', coordinates: [10.0, 10.0]}}}},"
" {b: {$geoWithin: { $centerSphere: [[ 10, 20 ], 0.01 ] } }} ]}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{or: {nodes: [{fetch: {node: {ixscan: {pattern: {a: '2dsphere'}}}}},"
"{fetch: {node: {ixscan: {pattern: {b: '2dsphere'}}}}}]}}");
}
// Regression test for SERVER-24320. Tests that the PlanCacheIndexTree has the same sort order as
// the MatchExpression used to generate the plan cache key.
TEST_F(CachePlanSelectionTest, AndWithinPolygonWithinCenterSphere) {
addIndex(BSON("a"
<< "2dsphere"
<< "b"
<< 1),
"a_2dsphere_b_2dsphere");
BSONObj query = fromjson(
"{$and: [{b: 1}, {a: {$within: {$polygon: [[0, 0], [0, 0], [0, 0], [0, 0]]}}}, {a: "
"{$within: {$centerSphere: [[0, 0], 0]}}}]}");
runQuery(query);
assertPlanCacheRecoversSolution(query,
"{fetch: {node: {ixscan: {pattern: {a: '2dsphere', b: 1}}}}}");
}
//
// tree operations
//
TEST_F(CachePlanSelectionTest, TwoPredicatesAnding) {
addIndex(BSON("x" << 1), "x_1");
BSONObj query = fromjson("{$and: [ {x: {$gt: 1}}, {x: {$lt: 3}} ] }");
runQuery(query);
assertPlanCacheRecoversSolution(
query, "{fetch: {filter: null, node: {ixscan: {filter: null, pattern: {x: 1}}}}}");
}
TEST_F(CachePlanSelectionTest, SimpleOr) {
addIndex(BSON("a" << 1), "a_1");
BSONObj query = fromjson("{$or: [{a: 20}, {a: 21}]}");
runQuery(query);
assertPlanCacheRecoversSolution(
query, "{fetch: {filter: null, node: {ixscan: {filter: null, pattern: {a:1}}}}}");
}
TEST_F(CachePlanSelectionTest, OrWithAndChild) {
addIndex(BSON("a" << 1), "a_1");
BSONObj query = fromjson("{$or: [{a: 20}, {$and: [{a:1}, {b:7}]}]}");
runQuery(query);
assertPlanCacheRecoversSolution(query,
"{fetch: {filter: null, node: {or: {nodes: ["
"{ixscan: {filter: null, pattern: {a: 1}}}, "
"{fetch: {filter: {b: 7}, node: {ixscan: "
"{filter: null, pattern: {a: 1}}}}}]}}}}");
}
TEST_F(CachePlanSelectionTest, AndWithUnindexedOrChild) {
addIndex(BSON("a" << 1), "a_1");
BSONObj query = fromjson("{a:20, $or: [{b:1}, {c:7}]}");
runQuery(query);
assertPlanCacheRecoversSolution(query,
"{fetch: {filter: {$or: [{b: 1}, {c: 7}]}, node: "
"{ixscan: {filter: null, pattern: {a: 1}}}}}");
}
TEST_F(CachePlanSelectionTest, AndWithOrWithOneIndex) {
addIndex(BSON("b" << 1), "b_1");
addIndex(BSON("a" << 1), "a_1");
BSONObj query = fromjson("{$or: [{b:1}, {c:7}], a:20}");
runQuery(query);
assertPlanCacheRecoversSolution(query,
"{fetch: {filter: {$or: [{b: 1}, {c: 7}]}, "
"node: {ixscan: {filter: null, pattern: {a: 1}}}}}");
}
//
// Sort orders
//
// SERVER-1205.
TEST_F(CachePlanSelectionTest, MergeSort) {
addIndex(BSON("a" << 1 << "c" << 1), "a_1_c_1");
addIndex(BSON("b" << 1 << "c" << 1), "b_1_c_1");
BSONObj query = fromjson("{$or: [{a:1}, {b:1}]}");
BSONObj sort = BSON("c" << 1);
runQuerySortProj(query, sort, BSONObj());
assertPlanCacheRecoversSolution(
query,
sort,
BSONObj(),
BSONObj(),
"{fetch: {node: {mergeSort: {nodes: "
"[{ixscan: {pattern: {a: 1, c: 1}}}, {ixscan: {pattern: {b: 1, c: 1}}}]}}}}");
}
// SERVER-1205 as well.
TEST_F(CachePlanSelectionTest, NoMergeSortIfNoSortWanted) {
addIndex(BSON("a" << 1 << "c" << 1), "a_1_c_1");
addIndex(BSON("b" << 1 << "c" << 1), "b_1_c_1");
BSONObj query = fromjson("{$or: [{a:1}, {b:1}]}");
runQuerySortProj(query, BSONObj(), BSONObj());
assertPlanCacheRecoversSolution(query,
BSONObj(),
BSONObj(),
BSONObj(),
"{fetch: {filter: null, node: {or: {nodes: ["
"{ixscan: {filter: null, pattern: {a: 1, c: 1}}}, "
"{ixscan: {filter: null, pattern: {b: 1, c: 1}}}]}}}}");
}
// Disabled: SERVER-10801.
/*
TEST_F(CachePlanSelectionTest, SortOnGeoQuery) {
addIndex(BSON("timestamp" << -1 << "position" << "2dsphere"), "timestamp_-1_position_2dsphere");
BSONObj query = fromjson("{position: {$geoWithin: {$geometry: {type: \"Polygon\", "
"coordinates: [[[1, 1], [1, 90], [180, 90], "
"[180, 1], [1, 1]]]}}}}");
BSONObj sort = fromjson("{timestamp: -1}");
runQuerySortProj(query, sort, BSONObj());
assertPlanCacheRecoversSolution(query, sort, BSONObj(),
"{fetch: {node: {ixscan: {pattern: {timestamp: -1, position: '2dsphere'}}}}}");
}
*/
// SERVER-9257
TEST_F(CachePlanSelectionTest, CompoundGeoNoGeoPredicate) {
addIndex(BSON("creationDate" << 1 << "foo.bar"
<< "2dsphere"),
"creationDate_1_foo.bar_2dsphere");
BSONObj query = fromjson("{creationDate: {$gt: 7}}");
BSONObj sort = fromjson("{creationDate: 1}");
runQuerySortProj(query, sort, BSONObj());
assertPlanCacheRecoversSolution(
query,
sort,
BSONObj(),
BSONObj(),
"{fetch: {node: {ixscan: {pattern: {creationDate: 1, 'foo.bar': '2dsphere'}}}}}");
}
TEST_F(CachePlanSelectionTest, ReverseScanForSort) {
addIndex(BSON("_id" << 1), "_id_1");
runQuerySortProj(BSONObj(), fromjson("{_id: -1}"), BSONObj());
assertPlanCacheRecoversSolution(
BSONObj(),
fromjson("{_id: -1}"),
BSONObj(),
BSONObj(),
"{fetch: {filter: null, node: {ixscan: {filter: null, pattern: {_id: 1}}}}}");
}
//
// Caching collection scans.
//
TEST_F(CachePlanSelectionTest, CollscanNoUsefulIndices) {
addIndex(BSON("a" << 1 << "b" << 1), "a_1_b_1");
addIndex(BSON("c" << 1), "c_1");
runQuery(BSON("b" << 4));
assertPlanCacheRecoversSolution(BSON("b" << 4), "{cscan: {filter: {b: 4}, dir: 1}}");
}
TEST_F(CachePlanSelectionTest, CollscanOrWithoutEnoughIndices) {
addIndex(BSON("a" << 1), "a_1");
BSONObj query = fromjson("{$or: [{a: 20}, {b: 21}]}");
runQuery(query);
assertPlanCacheRecoversSolution(query, "{cscan: {filter: {$or:[{a:20},{b:21}]}, dir: 1}}");
}
TEST_F(CachePlanSelectionTest, CollscanMergeSort) {
addIndex(BSON("a" << 1 << "c" << 1), "a_1_c_1");
addIndex(BSON("b" << 1 << "c" << 1), "b_1_c_1");
BSONObj query = fromjson("{$or: [{a:1}, {b:1}]}");
BSONObj sort = BSON("c" << 1);
runQuerySortProj(query, sort, BSONObj());
assertPlanCacheRecoversSolution(query,
sort,
BSONObj(),
BSONObj(),
"{sort: {pattern: {c: 1}, limit: 0, node: {sortKeyGen: "
"{node: {cscan: {dir: 1}}}}}}");
}
//
// Caching plans that use multikey indexes.
//
TEST_F(CachePlanSelectionTest, CachedPlanForCompoundMultikeyIndexCanCompoundBounds) {
params.options = QueryPlannerParams::NO_TABLE_SCAN | QueryPlannerParams::INDEX_INTERSECTION;
const bool multikey = true;
addIndex(BSON("a" << 1 << "b" << 1), "a_1_b_1", multikey);
BSONObj query = fromjson("{a: 2, b: 3}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {filter: null, node: {ixscan: {pattern: {a: 1, b: 1}, "
"bounds: {a: [[2, 2, true, true]], b: [[3, 3, true, true]]}}}}}");
}
TEST_F(CachePlanSelectionTest,
CachedPlanForSelfIntersectionOfMultikeyIndexPointRangesCannotIntersectBounds) {
params.options = QueryPlannerParams::NO_TABLE_SCAN | QueryPlannerParams::INDEX_INTERSECTION;
const bool multikey = true;
addIndex(BSON("a" << 1), "a_1", multikey);
BSONObj query = fromjson("{$and: [{a: 2}, {a: 3}]}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {filter: null, node: {andSorted: {nodes: ["
"{ixscan: {pattern: {a: 1}, bounds: {a: [[2, 2, true, true]]}}}, "
"{ixscan: {pattern: {a: 1}, bounds: {a: [[3, 3, true, true]]}}}]}}}}");
}
TEST_F(CachePlanSelectionTest,
CachedPlanForSelfIntersectionOfMultikeyIndexNonPointRangesCannotIntersectBounds) {
// Enable a hash-based index intersection plan to be generated because we are scanning a
// non-point range on the "a" field.
bool oldEnableHashIntersection = internalQueryPlannerEnableHashIntersection.load();
ON_BLOCK_EXIT([oldEnableHashIntersection] {
internalQueryPlannerEnableHashIntersection.store(oldEnableHashIntersection);
});
internalQueryPlannerEnableHashIntersection.store(true);
params.options = QueryPlannerParams::NO_TABLE_SCAN | QueryPlannerParams::INDEX_INTERSECTION;
const bool multikey = true;
addIndex(BSON("a" << 1), "a_1", multikey);
BSONObj query = fromjson("{$and: [{a: {$gte: 2}}, {a: {$lt: 3}}]}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {filter: null, node: {andHash: {nodes: ["
"{ixscan: {pattern: {a: 1}, bounds: {a: [[2, Infinity, true, true]]}}}, "
"{ixscan: {pattern: {a: 1}, bounds: {a: [[-Infinity, 3, true, false]]}}}]}}}}");
}
TEST_F(CachePlanSelectionTest, CachedPlanForIntersectionOfMultikeyIndexesWhenUsingElemMatch) {
params.options = QueryPlannerParams::NO_TABLE_SCAN | QueryPlannerParams::INDEX_INTERSECTION;
const bool multikey = true;
addIndex(BSON("a.b" << 1), "a.b_1", multikey);
addIndex(BSON("a.c" << 1), "a.c_1", multikey);
BSONObj query = fromjson("{a: {$elemMatch: {b: 2, c: 3}}}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {filter: {a: {$elemMatch: {b: 2, c: 3}}}, node: {andSorted: {nodes: ["
"{ixscan: {pattern: {'a.b': 1}, bounds: {'a.b': [[2, 2, true, true]]}}},"
"{ixscan: {pattern: {'a.c': 1}, bounds: {'a.c': [[3, 3, true, true]]}}}]}}}}");
}
TEST_F(CachePlanSelectionTest, CachedPlanForIntersectionWithNonMultikeyIndexCanIntersectBounds) {
// Enable a hash-based index intersection plan to be generated because we are scanning a
// non-point range on the "a.c" field.
bool oldEnableHashIntersection = internalQueryPlannerEnableHashIntersection.load();
ON_BLOCK_EXIT([oldEnableHashIntersection] {
internalQueryPlannerEnableHashIntersection.store(oldEnableHashIntersection);
});
internalQueryPlannerEnableHashIntersection.store(true);
params.options = QueryPlannerParams::NO_TABLE_SCAN | QueryPlannerParams::INDEX_INTERSECTION;
const bool multikey = true;
addIndex(BSON("a.b" << 1), "a.b_1", multikey);
addIndex(BSON("a.c" << 1), "a.c_1", !multikey);
BSONObj query = fromjson("{'a.b': 2, 'a.c': {$gte: 0, $lt: 10}}}}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {node: {andHash: {nodes: ["
"{ixscan: {pattern: {'a.b': 1}, bounds: {'a.b': [[2, 2, true, true]]}}},"
"{ixscan: {pattern: {'a.c': 1}, bounds: {'a.c': [[0, 10, true, false]]}}}]}}}}");
}
//
// Check queries that, at least for now, are not cached.
//
TEST_F(CachePlanSelectionTest, GeoNear2DNotCached) {
addIndex(BSON("a"
<< "2d"),
"a_2d");
runQuery(fromjson("{a: {$near: [0,0], $maxDistance:0.3 }}"));
assertNotCached("{geoNear2d: {a: '2d'}}");
}
TEST_F(CachePlanSelectionTest, MinNotCached) {
addIndex(BSON("a" << 1), "a_1");
runQueryHintMinMax(BSONObj(), BSONObj(), fromjson("{a: 1}"), BSONObj());
assertNotCached(
"{fetch: {filter: null, "
"node: {ixscan: {filter: null, pattern: {a: 1}}}}}");
}
TEST_F(CachePlanSelectionTest, MaxNotCached) {
addIndex(BSON("a" << 1), "a_1");
runQueryHintMinMax(BSONObj(), BSONObj(), BSONObj(), fromjson("{a: 1}"));
assertNotCached(
"{fetch: {filter: null, "
"node: {ixscan: {filter: null, pattern: {a: 1}}}}}");
}
TEST_F(CachePlanSelectionTest, NaturalHintNotCached) {
addIndex(BSON("a" << 1), "a_1");
addIndex(BSON("b" << 1), "b_1");
runQuerySortHint(BSON("a" << 1), BSON("b" << 1), BSON("$natural" << 1));
assertNotCached(
"{sort: {pattern: {b: 1}, limit: 0, node: {sortKeyGen: {node: "
"{cscan: {filter: {a: 1}, dir: 1}}}}}}");
}
TEST_F(CachePlanSelectionTest, HintValidNotCached) {
addIndex(BSON("a" << 1), "a_1");
runQueryHint(BSONObj(), fromjson("{a: 1}"));
assertNotCached(
"{fetch: {filter: null, "
"node: {ixscan: {filter: null, pattern: {a: 1}}}}}");
}
//
// Queries using '2d' indices are not cached.
//
TEST_F(CachePlanSelectionTest, Basic2DNonNearNotCached) {
addIndex(BSON("a"
<< "2d"),
"a_2d");
BSONObj query;
// Polygon
query = fromjson("{a : { $within: { $polygon : [[0,0], [2,0], [4,0]] } }}");
runQuery(query);
assertNotCached("{fetch: {node: {ixscan: {pattern: {a: '2d'}}}}}");
// Center
query = fromjson("{a : { $within : { $center : [[ 5, 5 ], 7 ] } }}");
runQuery(query);
assertNotCached("{fetch: {node: {ixscan: {pattern: {a: '2d'}}}}}");
// Centersphere
query = fromjson("{a : { $within : { $centerSphere : [[ 10, 20 ], 0.01 ] } }}");
runQuery(query);
assertNotCached("{fetch: {node: {ixscan: {pattern: {a: '2d'}}}}}");
// Within box.
query = fromjson("{a : {$within: {$box : [[0,0],[9,9]]}}}");
runQuery(query);
assertNotCached("{fetch: {node: {ixscan: {pattern: {a: '2d'}}}}}");
}
TEST_F(CachePlanSelectionTest, Or2DNonNearNotCached) {
addIndex(BSON("a"
<< "2d"),
"a_2d");
addIndex(BSON("b"
<< "2d"),
"b_2d");
BSONObj query = fromjson(
"{$or: [ {a : { $within : { $polygon : [[0,0], [2,0], [4,0]] } }},"
" {b : { $within : { $center : [[ 5, 5 ], 7 ] } }} ]}");
runQuery(query);
assertNotCached(
"{or: {nodes: [{fetch: {node: {ixscan: {pattern: {a: '2d'}}}}},"
"{fetch: {node: {ixscan: {pattern: {b: '2d'}}}}}]}}");
}
//
// Collation.
//
TEST_F(CachePlanSelectionTest, MatchingCollation) {
CollatorInterfaceMock collator(CollatorInterfaceMock::MockType::kReverseString);
addIndex(BSON("x" << 1), "x_1", &collator);
runQueryAsCommand(fromjson(
"{find: 'testns', filter: {x: 'foo'}, collation: {locale: 'mock_reverse_string'}}"));
assertPlanCacheRecoversSolution(BSON("x"
<< "bar"),
BSONObj(),
BSONObj(),
BSON("locale"
<< "mock_reverse_string"),
"{fetch: {node: {ixscan: {pattern: {x: 1}}}}}");
}
TEST_F(CachePlanSelectionTest, ContainedOr) {
addIndex(BSON("b" << 1 << "a" << 1), "b_1_a_1");
addIndex(BSON("c" << 1 << "a" << 1), "c_1_a_1");
BSONObj query = fromjson("{$and: [{a: 5}, {$or: [{b: 6}, {c: 7}]}]}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {filter: null, node: {or: {nodes: ["
"{ixscan: {pattern: {b: 1, a: 1}, bounds: {b: [[6, 6, true, true]], a: [[5, 5, true, "
"true]]}}},"
"{ixscan: {pattern: {c: 1, a: 1}, bounds: {c: [[7, 7, true, true]], a: [[5, 5, true, "
"true]]}}}"
"]}}}}");
}
TEST_F(CachePlanSelectionTest, ContainedOrAndIntersection) {
bool oldEnableHashIntersection = internalQueryPlannerEnableHashIntersection.load();
ON_BLOCK_EXIT([oldEnableHashIntersection] {
internalQueryPlannerEnableHashIntersection.store(oldEnableHashIntersection);
});
internalQueryPlannerEnableHashIntersection.store(true);
params.options = QueryPlannerParams::INCLUDE_COLLSCAN | QueryPlannerParams::INDEX_INTERSECTION;
addIndex(BSON("a" << 1 << "b" << 1), "a_1_b_1");
addIndex(BSON("c" << 1), "c_1");
BSONObj query = fromjson("{$and: [{a: 5}, {$or: [{b: 6}, {c: 7}]}]}");
runQuery(query);
assertPlanCacheRecoversSolution(
query,
"{fetch: {filter: null, node: {andHash: {nodes: ["
"{or: {nodes: ["
"{ixscan: {pattern: {a: 1, b: 1}, bounds: {a: [[5, 5, true, true]], b: [[6, 6, true, "
"true]]}}},"
"{ixscan: {pattern: {c: 1}, bounds: {c: [[7, 7, true, true]]}}}]}},"
"{ixscan: {pattern: {a: 1, b: 1}, bounds: {a: [[5, 5, true, true]], b: [['MinKey', "
"'MaxKey', true, true]]}}}"
"]}}}}");
}
/**
* Test functions for computeKey. Cache keys are intentionally obfuscated and are
* meaningful only within the current lifetime of the server process. Users should treat plan
* cache keys as opaque.
*/
void testComputeKey(const char* queryStr,
const char* sortStr,
const char* projStr,
const char* expectedStr) {
PlanCache planCache;
const char* collationStr = "{}";
unique_ptr<CanonicalQuery> cq(canonicalize(queryStr, sortStr, projStr, collationStr));
PlanCacheKey key = planCache.computeKey(*cq);
PlanCacheKey expectedKey(expectedStr);
if (key == expectedKey) {
return;
}
str::stream ss;
ss << "Unexpected plan cache key. Expected: " << expectedKey << ". Actual: " << key
<< ". Query: " << cq->toString();
FAIL(ss);
}
TEST(PlanCacheTest, ComputeKey) {
// Generated cache keys should be treated as opaque to the user.
// No sorts
testComputeKey("{}", "{}", "{}", "an");
testComputeKey("{$or: [{a: 1}, {b: 2}]}", "{}", "{}", "or[eqa,eqb]");
testComputeKey("{$or: [{a: 1}, {b: 1}, {c: 1}], d: 1}", "{}", "{}", "an[or[eqa,eqb,eqc],eqd]");
testComputeKey("{$or: [{a: 1}, {b: 1}], c: 1, d: 1}", "{}", "{}", "an[or[eqa,eqb],eqc,eqd]");
testComputeKey("{a: 1, b: 1, c: 1}", "{}", "{}", "an[eqa,eqb,eqc]");
testComputeKey("{a: 1, beqc: 1}", "{}", "{}", "an[eqa,eqbeqc]");
testComputeKey("{ap1a: 1}", "{}", "{}", "eqap1a");
testComputeKey("{aab: 1}", "{}", "{}", "eqaab");
// With sort
testComputeKey("{}", "{a: 1}", "{}", "an~aa");
testComputeKey("{}", "{a: -1}", "{}", "an~da");
testComputeKey("{}",
"{a: {$meta: 'textScore'}}",
"{a: {$meta: 'textScore'}}",
"an~ta|{ $meta: \"textScore\" }a");
testComputeKey("{a: 1}", "{b: 1}", "{}", "eqa~ab");
// With projection
testComputeKey("{}", "{}", "{a: 1}", "an|ia");
testComputeKey("{}", "{}", "{a: -1}", "an|ia");
testComputeKey("{}", "{}", "{a: -1.0}", "an|ia");
testComputeKey("{}", "{}", "{a: true}", "an|ia");
testComputeKey("{}", "{}", "{a: 0}", "an|ea");
testComputeKey("{}", "{}", "{a: false}", "an|ea");
testComputeKey("{}", "{}", "{a: 99}", "an|ia");
testComputeKey("{}", "{}", "{a: 'foo'}", "an|ia");
testComputeKey("{}", "{}", "{a: {$slice: [3, 5]}}", "an|{ $slice: \\[ 3\\, 5 \\] }a");
testComputeKey("{}", "{}", "{a: {$elemMatch: {x: 2}}}", "an|{ $elemMatch: { x: 2 } }a");
testComputeKey("{}", "{}", "{a: ObjectId('507f191e810c19729de860ea')}", "an|ia");
testComputeKey("{a: 1}", "{}", "{'a.$': 1}", "eqa|ia.$");
testComputeKey("{a: 1}", "{}", "{a: 1}", "eqa|ia");
// Projection should be order-insensitive
testComputeKey("{}", "{}", "{a: 1, b: 1}", "an|iaib");
testComputeKey("{}", "{}", "{b: 1, a: 1}", "an|iaib");
// With or-elimination and projection
testComputeKey("{$or: [{a: 1}]}", "{}", "{_id: 0, a: 1}", "eqa|e_idia");
testComputeKey("{$or: [{a: 1}]}", "{}", "{'a.$': 1}", "eqa|ia.$");
}
// Delimiters found in user field names or non-standard projection field values
// must be escaped.
TEST(PlanCacheTest, ComputeKeyEscaped) {
// Field name in query.
testComputeKey("{'a,[]~|<>': 1}", "{}", "{}", "eqa\\,\\[\\]\\~\\|\\<\\>");
// Field name in sort.
testComputeKey("{}", "{'a,[]~|<>': 1}", "{}", "an~aa\\,\\[\\]\\~\\|\\<\\>");
// Field name in projection.
testComputeKey("{}", "{}", "{'a,[]~|<>': 1}", "an|ia\\,\\[\\]\\~\\|\\<\\>");
// Value in projection.
testComputeKey("{}", "{}", "{a: 'foo,[]~|<>'}", "an|ia");
}
// Cache keys for $geoWithin queries with legacy and GeoJSON coordinates should
// not be the same.
TEST(PlanCacheTest, ComputeKeyGeoWithin) {
PlanCache planCache;
// Legacy coordinates.
unique_ptr<CanonicalQuery> cqLegacy(
canonicalize("{a: {$geoWithin: "
"{$box: [[-180, -90], [180, 90]]}}}"));
// GeoJSON coordinates.
unique_ptr<CanonicalQuery> cqNew(
canonicalize("{a: {$geoWithin: "
"{$geometry: {type: 'Polygon', coordinates: "
"[[[0, 0], [0, 90], [90, 0], [0, 0]]]}}}}"));
ASSERT_NOT_EQUALS(planCache.computeKey(*cqLegacy), planCache.computeKey(*cqNew));
}
// GEO_NEAR cache keys should include information on geometry and CRS in addition
// to the match type and field name.
TEST(PlanCacheTest, ComputeKeyGeoNear) {
testComputeKey("{a: {$near: [0,0], $maxDistance:0.3 }}", "{}", "{}", "gnanrfl");
testComputeKey("{a: {$nearSphere: [0,0], $maxDistance: 0.31 }}", "{}", "{}", "gnanssp");
testComputeKey(
"{a: {$geoNear: {$geometry: {type: 'Point', coordinates: [0,0]},"
"$maxDistance:100}}}",
"{}",
"{}",
"gnanrsp");
}
// When a sparse index is present, computeKey() should generate different keys depending on
// whether or not the predicates in the given query can use the index.
TEST(PlanCacheTest, ComputeKeySparseIndex) {
PlanCache planCache;
planCache.notifyOfIndexEntries({IndexEntry(BSON("a" << 1),
false, // multikey
true, // sparse
false, // unique
"", // name
nullptr, // filterExpr
BSONObj())});
unique_ptr<CanonicalQuery> cqEqNumber(canonicalize("{a: 0}}"));
unique_ptr<CanonicalQuery> cqEqString(canonicalize("{a: 'x'}}"));
unique_ptr<CanonicalQuery> cqEqNull(canonicalize("{a: null}}"));
// 'cqEqNumber' and 'cqEqString' get the same key, since both are compatible with this
// index.
ASSERT_EQ(planCache.computeKey(*cqEqNumber), planCache.computeKey(*cqEqString));
// 'cqEqNull' gets a different key, since it is not compatible with this index.
ASSERT_NOT_EQUALS(planCache.computeKey(*cqEqNull), planCache.computeKey(*cqEqNumber));
}
// When a partial index is present, computeKey() should generate different keys depending on
// whether or not the predicates in the given query "match" the predicates in the partial index
// filter.
TEST(PlanCacheTest, ComputeKeyPartialIndex) {
BSONObj filterObj = BSON("f" << BSON("$gt" << 0));
unique_ptr<MatchExpression> filterExpr(parseMatchExpression(filterObj));
PlanCache planCache;
planCache.notifyOfIndexEntries({IndexEntry(BSON("a" << 1),
false, // multikey
false, // sparse
false, // unique
"", // name
filterExpr.get(),
BSONObj())});
unique_ptr<CanonicalQuery> cqGtNegativeFive(canonicalize("{f: {$gt: -5}}"));
unique_ptr<CanonicalQuery> cqGtZero(canonicalize("{f: {$gt: 0}}"));
unique_ptr<CanonicalQuery> cqGtFive(canonicalize("{f: {$gt: 5}}"));
// 'cqGtZero' and 'cqGtFive' get the same key, since both are compatible with this index.
ASSERT_EQ(planCache.computeKey(*cqGtZero), planCache.computeKey(*cqGtFive));
// 'cqGtNegativeFive' gets a different key, since it is not compatible with this index.
ASSERT_NOT_EQUALS(planCache.computeKey(*cqGtNegativeFive), planCache.computeKey(*cqGtZero));
}
// Query shapes should get the same plan cache key if they have the same collation indexability.
TEST(PlanCacheTest, ComputeKeyCollationIndex) {
CollatorInterfaceMock collator(CollatorInterfaceMock::MockType::kReverseString);
PlanCache planCache;
IndexEntry entry(BSON("a" << 1),
false, // multikey
false, // sparse
false, // unique
"", // name
nullptr, // filterExpr
BSONObj());
entry.collator = &collator;
planCache.notifyOfIndexEntries({entry});
unique_ptr<CanonicalQuery> containsString(canonicalize("{a: 'abc'}"));
unique_ptr<CanonicalQuery> containsObject(canonicalize("{a: {b: 'abc'}}"));
unique_ptr<CanonicalQuery> containsArray(canonicalize("{a: ['abc', 'xyz']}"));
unique_ptr<CanonicalQuery> noStrings(canonicalize("{a: 5}"));
unique_ptr<CanonicalQuery> containsStringHasCollation(
canonicalize("{a: 'abc'}", "{}", "{}", "{locale: 'mock_reverse_string'}"));
// 'containsString', 'containsObject', and 'containsArray' have the same key, since none are
// compatible with the index.
ASSERT_EQ(planCache.computeKey(*containsString), planCache.computeKey(*containsObject));
ASSERT_EQ(planCache.computeKey(*containsString), planCache.computeKey(*containsArray));
// 'noStrings' gets a different key since it is compatible with the index.
ASSERT_NOT_EQUALS(planCache.computeKey(*containsString), planCache.computeKey(*noStrings));
// 'noStrings' and 'containsStringHasCollation' get the same key since they compatible with the
// index.
ASSERT_EQ(planCache.computeKey(*noStrings), planCache.computeKey(*containsStringHasCollation));
unique_ptr<CanonicalQuery> inContainsString(canonicalize("{a: {$in: [1, 'abc', 2]}}"));
unique_ptr<CanonicalQuery> inContainsObject(canonicalize("{a: {$in: [1, {b: 'abc'}, 2]}}"));
unique_ptr<CanonicalQuery> inContainsArray(canonicalize("{a: {$in: [1, ['abc', 'xyz'], 2]}}"));
unique_ptr<CanonicalQuery> inNoStrings(canonicalize("{a: {$in: [1, 2]}}"));
unique_ptr<CanonicalQuery> inContainsStringHasCollation(
canonicalize("{a: {$in: [1, 'abc', 2]}}", "{}", "{}", "{locale: 'mock_reverse_string'}"));
// 'inContainsString', 'inContainsObject', and 'inContainsArray' have the same key, since none
// are compatible with the index.
ASSERT_EQ(planCache.computeKey(*inContainsString), planCache.computeKey(*inContainsObject));
ASSERT_EQ(planCache.computeKey(*inContainsString), planCache.computeKey(*inContainsArray));
// 'inNoStrings' gets a different key since it is compatible with the index.
ASSERT_NOT_EQUALS(planCache.computeKey(*inContainsString), planCache.computeKey(*inNoStrings));
// 'inNoStrings' and 'inContainsStringHasCollation' get the same key since they compatible with
// the index.
ASSERT_EQ(planCache.computeKey(*inNoStrings),
planCache.computeKey(*inContainsStringHasCollation));
}
} // namespace
|