zeroshade commented on issue #50: URL: https://github.com/apache/arrow-go/issues/50#issuecomment-5501444872
Closing this out as it has been idle since 2023 and no top-K work came out of it. To answer the original question: arrow-go is a reasonable fit for holding the data, but the `compute` package still has no top-K/select-k or sort kernels, so you would be implementing the ranking yourself on top of the arrays today. If you want a frequently-updated group/count structure with cheap top-N queries, a purpose-built heap or sketch is likely a better tool than Arrow arrays. If you (or anyone landing here) want to contribute sort / select-k kernels to `arrow/compute`, that would be very welcome — and #532 is the better place to track group-by style aggregation work. Thanks @VEDANTDOKANIA. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
