Support more complex scan bounds for clustered index

XMLWordPrintableJSON

    • Query Optimization
    • QO 2024-04-29
    • None
    • 3
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      Right now, clustered collection scans can be bounded by a min value and max value. This works well for queries containing $eq, $lt/e, $gt/e, and $and. But, it's not sophisticated enough to most efficiently bound queries containing $in and $or. These queries would benefit from bounds that look more like a set of ranges.  

              Assignee:
              Unassigned
              Reporter:
              Hana Pearlman
              Votes:
              2 Vote for this issue
              Watchers:
              24 Start watching this issue

                Created:
                Updated: