Towards an Analysis of Range Query Performance in Spatial Data Structures

In this paper, we motivate four di erent user de ned window query classes and derive a probabilistic model for each of them. For each model, we characterize the e ciency of spatial data structures in terms of the expected number of data bucket accesses needed to perform a window query. Our analytical approach exhibits the performance phenomena independent of data structure and implementation details and whether the objects are points or non-point objects.

• Type: Conference
• Year: 1993
• Where: PODS
• Authors: Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer
• Keywords: Data Structure, Database, PODS 1993, Window Query, Window Query Classes