Direct access asks for the retrieval of query answers by their ranked position, given a query and a desired order. While the time complexity of data structures supporting such accesses has been studied in depth, and efficient algorithms for many queries and common orders are known, their practical performance has received little attention. We provide an implementation covering a wide range of queries and orders; it allows us to investigate intriguing practical aspects, including the comparative performance of database systems and the relationship between direct access and its single-access counterpart.

翻译：直接访问要求根据查询和期望的顺序，按排名位置检索查询结果。尽管支持此类访问的数据结构的时间复杂度已得到深入研究，且针对众多查询和常见顺序的高效算法已为人所知，但其实际性能却鲜受关注。我们提供了一种涵盖广泛查询和顺序的实现方案；该方案使我们能够探究有趣的实际问题，包括数据库系统的性能对比，以及直接访问与其单次访问对应方法之间的关系。