PKNTQmets.xmlADIASOn a model of indexability and its bounds for range querieshttps://dl.acm.org/citation.cfm?doid=505241.50524410.1145/505241.505244en22 pagesWe develop a theoretical framework to characterize the hardness of indexing data sets on block-access memory devices like hard disks. We define an indexing workload by a data set and a set of potential queries. For a workload we can construct an indexing scheme, which is a collection of fixed-sized subsets of the data. We identify two measures of efficiency for an indexing scheme on a workload: storage redundancy, r (how many times each item in the data set is stored), and access overhead, A (how many times more blocks than necessary does a query retrieve). For many interesting families of workloads, there exists a trade-off between storage redundancy and access overhead. Given a desired access overhead A, there is a minimum redundancy that any indexing scheme must exhibit. We prove a lower-bound theorem for deriving the minimum redundancy. By applying this theorem we show interesting upper and lower bounds and trade-offs between A and r in the case of multi-dimensional range queries and set queries.J. Hellerstein, E. Koutsoupias, D. Miranker, C. Papadimitriou and V. Samoladas, "On a model of indexability and its Bounds for range queries," J ACM, vol. 49, no. 1, pp. 33-55, Jan. 2002. doi: 10.1145/505241.505244http://creativecommons.org/licenses/by/4.0/2015-10-1649135–552002falsePK6QPKNTQ6Qmets.xmlPK6METS archive created by DIAS