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

Our index file seeks can be directed to the page most likely to contain the record, and read exactly one page

    XMLWordPrintableJSON

Details

    Description

      (Perhaps two, if it is likely to cross a page boundary).

      This only works if the partitioner is hash based, but if so we can expect the keys to be uniformly distributed, so we can easily calculate the likelihood of finding it on a given page. With CASSANDRA-8931, we can also expect the data to be of a uniform size.

      This will require a little bit of index file restructuring, so that each page can be read as a single unit. A follow-up ticket may then permit in-memory binary search within the page for the desired record (with variable key sizes this may be difficult, so perhaps a follow-up).

      Attachments

        Issue Links

          Activity

            People

              Unassigned Unassigned
              benedict Benedict Elliott Smith
              Votes:
              0 Vote for this issue
              Watchers:
              2 Start watching this issue

              Dates

                Created:
                Updated: