[C++] A more RAM-efficient top-k sink node

[asfimport]

Mentioned here:

#11274 (review)

For example, a top-k implementation could periodically (when batches_ has some configurable # of rows) run through and discard data. The way it is written now it would still require me to buffer the entire dataset in memory (and/or spillover).

 

 

Reporter: Alexander Ocsa / @aocsa

Related issues:

• RAM-efficient topk sink node (is duplicated by)
• [C++] Return a random sample of rows from a query (is depended upon by)

_{Note: This issue was originally created as ARROW-14202. Please see the migration documentation for further details.}

[asfimport]

Todd Farmer / @toddfarmer:
This issue was last updated over 90 days ago, which may be an indication it is no longer being actively worked. To better reflect the current state, the issue is being unassigned per project policy. Please feel free to re-take assignment of the issue if it is being actively worked, or if you plan to start that work soon.