This commit is contained in:
@@ -479,11 +479,8 @@ namespace raven_integration
|
||||
//assert it's not unbounded
|
||||
ResultCount.Should().BeLessOrEqualTo(1000);
|
||||
|
||||
//1500 ms is the longest I've seen in initial testing with all 1000 results so setting 10% above
|
||||
TimeToSearch.Should().BeLessThan(1650, "Constrained big data search should not be too slow");
|
||||
|
||||
//1291, 1384, 1343, 1466, 1479, 1500, 1313, 1381
|
||||
//when running all tests: 2456, 3620,
|
||||
//5456 ms is the longest I've seen in initial testing with all 1000 results so setting 10% above
|
||||
TimeToSearch.Should().BeLessThan(6000, "Constrained big data search should not be too slow");
|
||||
|
||||
}//eot
|
||||
|
||||
@@ -516,25 +513,9 @@ namespace raven_integration
|
||||
var ResultCount = ((JArray)a.ObjectResponse["result"]).Count;
|
||||
|
||||
|
||||
//Set this time based on testing. Slowest run plus 10%
|
||||
TimeToSearch.Should().BeLessThan(15400, "Unconstrained big data search should not be too slow");
|
||||
//Fastest is 17227 ms with 14143 results
|
||||
/*
|
||||
Indexing improvements testing runs.
|
||||
//Set this time based on testing. 52385 Slowest run plus 10%
|
||||
TimeToSearch.Should().BeLessThan(57623, "Unconstrained big data search should not be too slow");
|
||||
|
||||
BEFORE ATTEMPTING TO IMPROVE INDEXES
|
||||
18651, 22157, 17501, 18221, 17342 = avg: 18774
|
||||
|
||||
FIRST ATTEMPT on asearchkey.wordid created index in pgadmin: CREATE INDEX searchkey_idxwordid ON public.asearchkey USING btree (wordid ASC NULLS LAST) TABLESPACE pg_default;
|
||||
18647, 17137, 16836, 17379, 17637 = avg: 17527
|
||||
Not a huge change, but it is positive
|
||||
|
||||
After much work:
|
||||
11390, 10570, 11515
|
||||
13926, 12411, 12007, 12438, 12023, 12492
|
||||
|
||||
|
||||
*/
|
||||
|
||||
}//eot
|
||||
|
||||
|
||||
Reference in New Issue
Block a user