Space efficient dynamic stabbing with fast queries

In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method look-up in object oriented programming languages and classification in IP firewalls. For such application, very fast, say constant, query time is extremely important, small space is very important, and fast updates are good but the least important. Previous solutions traded space and update time for fast queries. We show here that space needs not be sacrificed. We get the same trade-off between update time and query time but using only the space necessary for locating a query point among the interval end-points. All our bounds are optimal or near-optimal. Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features--classes and objects, inheritance; E.1 [Data Structures]; F.2.2 [Analysis of Algorithms and Problem Complexity]: Non-numerical Algorithms and Problems--computat...

• Type: Conference
• Year: 2003
• Where: STOC
• Authors: Mikkel Thorup
• Keywords: Algorithms, Applications General Terms, Method Look-up, Programming Languages, STOC 2003