Towards an Analysis of Range Query Performance in Spatial Data Structures
In this paper, we motivate four different user defined window query classes and derive a probabilistic model for each of them. For each model, we characterize the efficiency 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.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten