Uni-Logo

Institut für Informatik
 

Technical Report No. 18, November 1989 - Abstract


Andreas Hutflesz, Cora Zimmermann:
Efficient Proximity Queries Using GOAL-Hashing

This report is not available in electronic form!

In many non-standard database applications, spatial accesss to geometric object is very important. We present a new access scheme, globally ordered and layered hashing (GOAL-hashing), for geometric objects in a dynamic environment. GOAL-hashing globally preserves the order of objects on the secondary storage medium. As a result, the amount of time to answer proximity queries is much less than for other schemes. An extensive performance evaluation confirms the superiority of GOAL-hashing over R-trees, due to the global order preservation.