Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
Description
Heap-based topk can compute these indices in O(n log k) time
Attachments
Issue Links
- is a child of
-
ARROW-12633 [C++] Query engine umbrella issue
- Open
- is a parent of
-
ARROW-13974 [C++] Resolve follow-up reviews for TopK/BottomK
- Resolved
- is depended upon by
-
ARROW-13766 [R] Add Arrow methods slice_min(), slice_max()
- Resolved
- is related to
-
ARROW-14183 [C++] Improve select_k_unstable performance
- Open
- links to