Batched dynamic solutions to decomposable searching problems Journal Article

Author(s): Edelsbrunner, Herbert; Overmars, Mark H
Article Title: Batched dynamic solutions to decomposable searching problems
Abstract: The batched static version of a searching problem asks for performing a given set of queries on a given set of objects. All queries are known in advance. The batched dynamic version of a searching problem is the following: given a sequence of insertions, deletions, and queries, perform them on an initially empty set. We will develop methods for solving batched static and batched dynamic versions of searching problems which are in particular applicable to decomposable searching problems. The techniques show that batched static (dynamic) versions of searching problems can often be solved more efficiently than by using known static (dynamic) data structures. In particular, a technique called “streaming” is described that reduces the space requirements considerably. The methods have also a number of applications on set problems. E.g., the k intersecting pairs in a set of n axis-parallel hyper-rectangles in d dimensions can be reported in O (nlogd−1n + k) time using only O(n) space.
Journal Title: Journal of Algorithms
Volume: 6
Issue 4
ISSN: 0196-6774
Publisher: Academic Press  
Date Published: 1985-12-01
Start Page: 515
End Page: 542
DOI: 10.1016/0196-6774(85)90030-6
Open access: no
IST Austria Authors
Related IST Austria Work