About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Acta Informatica
Paper
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
Abstract
Given a file of N records each of which has k keys, the worst-case analysis for the region and partial region queries in multidimensional binary search trees and balanced quad trees are presented. It is shown that the search algorithms proposed in [1, 3] run in time O(k·N1-1/k) for region queries in both tree structures. For partial region queries with s keys specified, the search algorithms run at most in time O(s·N1-1/k) in both structures. © 1977 Springer-Verlag.