Uploaded image for project: 'Cassandra'
  1. Cassandra
  2. CASSANDRA-10768

Optimize the way we check if a token is repaired in anticompaction

    XMLWordPrintableJSON

Details

    • Normal

    Description

      When we anticompact we check each token if it is within a repaired range, this is very inefficient with many tokens as we do a linear search instead of sorting the ranges and doing a binary search (or even just keeping track of the next right-boundary and checking against that to avoid 2 comparisons)

      Attachments

        Activity

          People

            marcuse Marcus Eriksson
            marcuse Marcus Eriksson
            Marcus Eriksson
            Ariel Weisberg
            Votes:
            0 Vote for this issue
            Watchers:
            6 Start watching this issue

            Dates

              Created:
              Updated:
              Resolved: