Multidimensional Search Trees That Provide New Types of Memory Reductions

Abstract

An orthogonal query that asks to aggregate the set of records in k-dimensional box regions is studied, and it is shown that space O(N((log N)/(log log N))k-1) makes possible a combined time complexity O(logkN ) for retrievals, insertions, and deletions. © 1987, ACM. All rights reserved.