Search
Results
-
Towards an Analysis of Range Query Performance in Spatial Data Structures
(1993)PODS '93: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database SystemsIn 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 ...Conference Paper -
Spatial access structures for geometric databases
(1992)Lecture Notes in Computer Science ~ Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint InitiativeConference Paper -
Spatial Priority Search: An Access Technique for Scaleless Maps
(1991)SIGMOD '91: Proceedings of the 1991 ACM SIGMOD International Conference on Management of DataConference Paper -
Massstabsunabhängige Verwaltung von Landschaftsdaten
(1990)Informatik-Fachberichte ~ Informatik auf dem Weg zum Anwender : Proceedings / GI-20. Jahrestagung, Stuttgart, 8.-12. Oktober 1990Conference Paper -
Paging Binary Trees with External Balancing
(1990)Lecture Notes in Computer Science ~ Graph-Theoretic Concepts in Computer Science: 15th International Workshop WG '89 Castle Rolduc, The Netherlands, June 14–16, 1989 ProceedingsConference Paper -
The R-File: An Efficient Access Structure for Proximity Queries
(1990)Sixth International Conference on Data Engineering : proceedings, February 5-9, 1990, Los Angeles, California, USAConference Paper