Skip to content

[Format] Clarify that the REE layout has O(log n) random access #46642

Closed
@amoeba

Description

@amoeba

Describe the enhancement requested

At the top of the columnar docs, it states (emphasis mine):

The columnar format has some key features:

  • Data adjacency for sequential access (scans)
  • O(1) (constant-time) random access
    ...

I careful reader, such as @remysucre in #46577, might notice that the REE layout says,

This allows relatively efficient random access from a logical index using binary search.

REE is the one exception to the previous statement about all layouts having O(1) random access because of this (making it O(log n)). It would be good to discuss and maybe update the columnar format to point this exception out.

Component(s)

Format

Metadata

Metadata

Assignees

Type

No type

Projects

No projects

Milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions