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.

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