Jan Steemann
|
0ffb11c25e
|
do not use sparse indexes for sorting
|
2015-10-14 12:03:52 +02:00 |
Jan Steemann
|
779c242846
|
modified usage of filters with potentially undefined variables
|
2015-10-14 11:02:42 +02:00 |
Jan Steemann
|
1ebcea2352
|
remove-filter-covered-by-indexes rewrite
|
2015-10-13 17:59:40 +02:00 |
Jan Steemann
|
cd7c1bc453
|
preparations for sort optimizer rule
|
2015-10-13 10:37:07 +02:00 |
jsteemann
|
29b3741156
|
reworked cost calculations
|
2015-10-12 22:23:03 +02:00 |
Michael Hackstein
|
dcc34e5312
|
The condition finder now creates an IndexNode for SORT statement only, if any index would be suiteable for it.
|
2015-10-12 11:44:36 +02:00 |
Jan Steemann
|
b5c9602407
|
specialization of conditions
|
2015-10-09 18:10:33 +02:00 |
Jan Steemann
|
6a4e9658c5
|
fixes for explainer and condition
|
2015-10-08 16:22:52 +02:00 |
Jan Steemann
|
fbfc7773ef
|
serialization and deserialization of IndexNodes
|
2015-10-08 12:02:27 +02:00 |
Jan Steemann
|
37bc5b64ff
|
fixed segfault
|
2015-10-05 13:49:23 +02:00 |
Jan Steemann
|
7d4c379598
|
small modifications, temporarily disabled interchange-adjacent-enumerations
|
2015-10-02 19:53:35 +02:00 |
Jan Steemann
|
3a92fa8e16
|
merge IN with IN
|
2015-10-02 15:22:21 +02:00 |
Jan Steemann
|
7292384b37
|
deduplicate IN arrays
|
2015-10-02 14:05:27 +02:00 |
Jan Steemann
|
40a1cf3ce3
|
fixed segfault
|
2015-09-30 16:03:46 +02:00 |
Jan Steemann
|
47e1b3ceb8
|
stringify conditions
|
2015-09-30 14:35:18 +02:00 |
Michael Hackstein
|
468e632abb
|
Merge branch 'aql-jmmh-conditions' of github.com:arangodb/arangodb into aql-jmmh-conditions
|
2015-09-30 08:38:26 +02:00 |
Jan Steemann
|
27bcd7ee84
|
better estimates
|
2015-09-29 15:30:44 +02:00 |
Michael Hackstein
|
c0a88a1371
|
Merge branch 'aql-jmmh-conditions' of github.com:arangodb/arangodb into aql-jmmh-conditions
|
2015-09-29 10:04:15 +02:00 |
Michael Hackstein
|
e35ea8995e
|
Fixed used after free of condition node. Cloned the Condition AST whie handing it over. Still get a double free exception. IndexNodeis now handled.
|
2015-09-29 09:13:08 +02:00 |
Michael Hackstein
|
1e9c6f110b
|
Started implementing the IndexBlock. Right now it expects an iterator for each used index that is created by an evaluated expression from the Block. Then it will go through all iterators in every get/skip some step
|
2015-09-28 19:30:10 +02:00 |
Jan Steemann
|
84f59d112e
|
unified index use checks
|
2015-09-28 18:13:04 +02:00 |
Jan Steemann
|
3495816fa1
|
changed index signatures
|
2015-09-28 14:11:23 +02:00 |
Jan Steemann
|
35f2bdb9fd
|
fixed
|
2015-09-28 13:31:53 +02:00 |
Jan Steemann
|
abc87b2d5f
|
added IndexNode stub
|
2015-09-25 13:40:51 +02:00 |
Michael Hackstein
|
2ab13b81a4
|
The Condition will now successfully produce a list of Indexes that can be combined for the current EnumerateCollectionBlock. If this list is empty we can do nothing but a Full Collection Scan
|
2015-09-25 13:00:37 +02:00 |
Michael Hackstein
|
6eb23f14f4
|
The Condition findIndexes now tries to find an index for each AND block and fills a list of indexes, iff there is any element in the list we are able to use a CombinedIndexRangeNode, if not we still have to use the EnumerateCollectionNode
|
2015-09-25 11:45:31 +02:00 |
Michael Hackstein
|
6a11ad28ee
|
Adapted all indices to the new planned interface so they tell us if they can serve for a condition and present their costs
|
2015-09-25 10:40:04 +02:00 |
Michael Hackstein
|
f1b0afd9a6
|
Started to implement functions to find indexes for each Condition sub part
|
2015-09-22 11:19:52 +02:00 |
Michael Hackstein
|
1e5b246b6b
|
Included the work of @dothebart that was created on optimizing the condition tree.
|
2015-09-17 18:27:47 +02:00 |
Jan Steemann
|
b0798bbb19
|
first commit, broken
|
2015-09-16 17:22:09 +02:00 |