Applications of range query theory to relational data base join and selection operations

Abstract

This article applies range query theory to develop join algorithms that run in O(I logd I + U) time, where I and U are the sizes of the input and output and d is usually a small constant. One advantage of these algorithms is that they do not require the storage of an index, and they also use a working memory space guaranteed to be proportional to the size of the input. If the memory space is expanded to O(N Polylog N), our formalism also leads to the development of very fast indices supporting O(Polylog N) Selection Operations. © 1996 Academic Press, Inc.