Abstract
In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database management system (DBMS) needs an access method that will help it retrieve data items quickly according to their spatial location. In this paper we give a classification of existing spatial access methods and show that they use one of the following three techniques: clipping, overlapping regions, and transformation. The performance of all previous schemes depends on and varies with the application. There is no scheme with a good overall performance. Thus our approach is to combine these techniques in one hybrid method to achieve good performance independent of the application. In an analysis we show the performance gain of our new scheme in comparison to previous proposed methods.
Zusammenfassung
Für die Organisation von geometrischen Daten, wie sie z.B in CAD-Anwendungen vorkommen, durch Datenbanksysteme (DBMS), benötigten diese Raum-Zugriffsstrukturen, die ein effizientes Suchen bezüglich der geometrischen Attribute der Daten gewährleisten. In diesem Bericht geben wir eine Übersicht von bekannten Raum-Zugriffsstrukturen. Darüberhinaus wird eine Aufteilung von Raum-Zugriffsstrukturen in drei Klassen vorgenommen, wobei jede Klasse durch eine Technik charakteriziert ist, die es erlaubt Raum Zugriffsstrukturen aus einer beliebigen mehrdimensionalen (Punkt-) Zugriffsstruktur zu generieren.
Viele dieser Raum-Zugriffsstrukturen sind zugeschnitten für spezielle Daten, wobei diese Daten gewisse Vorausetzungen erfüllen müssen, damit die Raum-Zugriffsstrukturen effizient sind, bzw. sogar anwendbar sind. Durch eine Kombination diverser Techniken, erreichen wir unserem neuen Verfahren eine flexibelere Organisation von Raumdaten ohne daß Bedingungen an diese Daten gestellt werden. Darüberhinaus zeigen wir die Leistung von unserem neuen Raum-Zugriffsstruktur, im Vergleich zu bereits exestierenden Strukturen.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Burkhard, W.A.: Interpolation-based index maintenance’, BIT 23, 274–294, 1983
Faloutsos, C., Sellis, T., Roussopoulos, N.: ’Analysis of object oriented spatial access methods’ Proc. ACM SIGMOD Int. Conf on Management of Data, 1987
Guttman, A.:’R-trees: a dynamic index structure for spatial searching’, Proc. ACM SIGMOD Int. Conf on Management of Data, 47–57, 1984
Kriegei, H.P., Seeger, B. ’Multidimensional order preserving linear hashing with partial expansions’, Proc. Int. Conf. on Database Theory, 1986, Proc. in Lecture Notes in Computer Science series 243
Kriegei, H.P., Seeger, B.: ’Multidimensional quantile hashing is very efficient for non-uniform distributions’, Proc. Int. Conf. on Data Engineering, 1987, extended version will appear in Information Science
Kriegei, H.P., Seeger, B.:’PLOP-Hashing: a grid file without directory’, will appear in Proc. Int. Conf. on Data Engineering, 1988
Larson, P.Å.: ’Linear hashing with partial expansions’, Proc. 6th Int. Conf. on VLDB, 224–232, 1980
Litwin, W.: ’Linear hashing: a new tool for file and table addressing’, Proc. 6th Int. Conf. on VLDB, 212–223, 1980
Manola, F., Orenstein, J., Dayal, U.: ’Geographic information processing in the Probe database system’, Proc. 8th Int. Symp. on Automation in Cartography, Baltimore, 1987
Mantyla, M., Tamminen, M.:’Localized set operations for solid modeling’, Computer Graphics, 17, 3, 279–288, 1983
Nievergelt, J., Hinterberger, H., Sevcik, K.C.:’The grid file: an adaptable, symmetric multikey file structure’, ACM TODS, 9, 1, 38–71, 1984
Nievergelt, J., Hinrichs, K.:’Storage and access structures for geometric data bases’, Proc. Int. Conf. on Foundations of Data Organisation, 335–345, 1985
Orenstein, J.A., Merett, T.H.:’A class of data structures for associative searching’, Proc 3th ACM SIGACT/SIGMOD Symp. on PODS, 1984
Ooi, B.C.: ’A data structure for geographic database’, Proc. on 2nd GI Conf. on Database Systems for Office Automation, Engineering, and Scientific Application, 1987
Otoo, E.J.:’A mapping function for the directory of a multidimensional extendible hashing’, Proc. 10th Int. Conf. on VLDB, 491–506, 1984
Otoo, E.J.:’Balanced multidimensional extendible hash tree’, Proc 5th ACM SIGACT/SIGMOD Symp. on PODS, 1986
Ouksel, M.:’The interpolation based grid file’, Proc 4th ACM SIGACT/ SIGMOD Symp. on PODS, 1985
Robinson, J.T.:’The K-D-B-tree: a search structure for large multidimensional dynamic indexes’, Proc. ACM SIGMOD Int. Conf on Management of Data, 10–18, 1981
Roussopoulos, N., Leifker, D.:’Direct spatial search on pictorial databases using packed R-trees’, Proc. ACM SIGMOD Int. Conf on Management of Data, 17–31, 1985
Sellis, T., Roussopoulos, N., Faloutsos, C.: ’The R +-tree: a dynamic index for multi-dimensional objects’, Proc. 13th Int. Conf. on VLDB, 1987
Stonebraker, M., Rubenstein, B., Guttman, A.: ’Application of abstract data types and abstract indices to CAD data bases’, Proc. ACM SIGMOD Conf. on Engineering Design Applications, 1983
Whang, K.-Y., Krishnamurthy, R.:’Multilevel grid files’, draft report, IBM Research Lab., Yorktown Hights, 1985
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seeger, B., Kriegel, HP. (1988). Spatial Access Methods based on Dynamic Hashing. In: Lutterbach, H. (eds) Non-Standard Datenbanken für Anwendungen der Graphischen Datenverarbeitung. Informatik-Fachberichte, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73608-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-73608-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19175-9
Online ISBN: 978-3-642-73608-7
eBook Packages: Springer Book Archive