Details

      Description

      Currently built-in indexes have only one way of handling intersections/unions: pick the highest selectivity predicate and filter on other index expressions. This is not always the most efficient approach. Dynamic query planning based on the different index characteristics would be more optimal. Query Plan should be able to choose how to do intersections, unions based on the metadata provided by indexes (returned by RangeIterator) and RangeIterator would became a base for cross index interactions and should have information such as min/max token, estimate number of wrapped tokens etc.

        Attachments

        1. server-load.png
          116 kB
          Corentin Chary

          Issue Links

            Activity

              People

              • Assignee:
                xedin Pavel Yaskevich
                Reporter:
                xedin Pavel Yaskevich
                Reviewer:
                Sam Tunnicliffe
              • Votes:
                5 Vote for this issue
                Watchers:
                19 Start watching this issue

                Dates

                • Created:
                  Updated: