[ARROW-18113] [C++] Implement a read range process without caching

• Type: Improvement
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 11.0.0
• Component/s: C++
• Labels: pull-request-available
• External issue URL: https://github.com/apache/arrow/issues/33311
• Assignee: Percy Camilo Triveño Aucahuasi
• Reporter: Percy Camilo Triveño Aucahuasi
• Created: 20/Oct/22 18:14
• Updated: 11/Jan/23 11:58
• Resolved: 28/Nov/22 22:57

Description

The current ReadRangeCache is mixing caching with coalescing and making difficult to implement readers capable to really perform concurrent reads on coalesced data (see this github comment for additional context); for instance, right now the prebuffering feature of those readers cannot handle concurrent invocations.

The goal for this ticket is to implement a similar component to ReadRangeCache for performing non-cache reads (doing only the coalescing part instead).  So, once we have that new capability, we can port the parquet and IPC readers to this new component and keep improving the reading process (that would be part of other set of follow-up tickets).  Similar ideas were mentioned here https://issues.apache.org/jira/browse/ARROW-17599

Maybe a good place to implement this new capability is inside the file system abstraction (as part of a dedicated method to read coalesced data) and where the abstract file system can provide a default implementation.

Issue Links

• relates to: ARROW-17913 feather.read_table 150x slower when reading columns in newer versions
• relates to: ARROW-17599 [C++] ReadRangeCache should not retain data after read
• relates to: ARROW-17917 [C++] Add opaque device id identification to InputStream
• links to: GitHub Pull Request #14723
• links to: GitHub Pull Request #14747