Repository navigation
[C++][Python] Binary search for sorted tables. #34153
Description
Describe the enhancement requested
While I support the decision for tables to not have index columns, I have still found it useful to enable fast binary search when it's known that a table is sorted. Currently I'm using schema.pandas_metadata['index_columns'] to detect sorting. It would be nice if arrow had it own metadata standard, instead of a pandas dependency.
The feature could go through stages:
- define and document metadata standard
Table.sort_byadds the metadata- a binary search compute function is added
Component(s)
C++, Python
Activity
westonpace commentedon Mar 2, 2023
Just for clarity, is the ask for a metadata standard for sortedness? Or is it for a binary search method? Or both?
coady commentedon Mar 3, 2023
Both.
westonpace commentedon Mar 3, 2023
Can you create a separate issue for the IPC metadata. This has come up in the past. I suspect most people just store their own internal metadata to represent this. However, it would be good to standardize (and datasets is very close to being able to tack advantage of this information).
thisisnic commentedon Feb 18, 2026
This issue has been marked as stale because it has had no activity in the past 2 years. Please remove the stale label or comment below, or this issue will be closed in 14 days.