Abstract
Multidimensional segment access methods efficiently organize one- and multidimensional intervals on secondary storage. In this paper, we present a detailed discussion and a comprehensive experimental performance comparison of these methods. Each of the segment access methods is implemented on top of an ordinary point access method using the techniques clipping, overlapping regions and transformation. As the basic point access method we have chosen the buddy-tree. The performance of the buddy-tree is less influenced by the underlying data distribution, and therefore, the resulting segment access methods can be judged with respect to their individual techniques. Besides the different versions of buddy-trees, the R*-tree (an improved approach of the R-tree) and the grid file participate in our experimental performance comparison.
Bernhard Seeger is on leave of absence from the University of Bremen, Germany.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger: ‘The R*-tree: an efficient and robust access method for points and rectangles', Proc. ACM SIGMOD Int. Conf. on Management of Data, 322–331, 1990
M. Freeston: ‘The BANG file: a new kind of grid file', Proc. ACM SIGMOD Int. Conf. on Management of Data, 260–269, 1987
H.-J. Frost, T. Otten and O. Reins: ‘Improvements on the buddy-tree', master thesis (in German), University of Bremen, 1990
D. Greene: ‘An implementation and performance analysis of spatial data access methods', Proc. 5th Int. Conf. on Data Engineering, 606–615, 1989
A. Guttman: ‘R-trees: a dynamic index structure for spatial searching', Proc. ACM SIGMOD Int. Conf. on Management of Data, 47–57, 1984
E. N. Hanson, M. Chaabouni, C.-H. Kim, Y.-W. Wang: ‘A predicate matching algorithm for database rule systems', Proc. ACM SIGMOD Int. Conf. on Management of Data, 271–280, 1990
A. Henrich, H.-W. Six and P. Widmayer: ‘The LSD-tree: Spatial access to multidimensional point-and non-point objects', 15th Int. Conf. on Very Large Data Bases, 45–53, 1989
K. Hinrichs: ‘The grid file system: implementation and case studies for applications', Dissertation Nr. 7734, Eidgenössische technische Hochschule (ETH) Zürich, 1985
A. Hutflesz, H.-W. Six and P. Widmayer: ‘The R-file: An efficient access structure for proximity queries', Proc. 6th Int. Conf. on Data Engineering, 372–379, 1990
H.P. Kriegel, M. Schiwietz, R. Schneider, B. Seeger: ‘A performance comparison of multidimensional point and spatial access methods', Proc. of the Symp. on Large Spatial Data Bases, Lecture Notes in Comp. Science No. 409, Springer-Verlag, 1990
H.P. Kriegel, P. Heep, S. Heep, M. Schiwietz, R. Schneider: ‘An access method based query processor for spatial database systems', technical report, University of Bremen, 1991
D.B. Lomet, B. Salzberg: ‘The hB-tree: a robust multi-attribute indexing method', ACM Trans. on Database Systems, Vo. 15, 4, 1989
D.B. Lomet, B. Salzberg: ‘Access Methods for multiversion data', Proc. ACM SIGMOD Int. Conf. on Management of Data, 315–324, 1989
J. Nievergelt, H. Hinterberger, K.C. Sevcik: ‘The grid file: an adaptable, symmetric multikey file structure', ACM Trans. on Database Systems, Vol. 9, 1, 38–71, 1984
B.C. Ooi: ‘A data structure for geographic database', Proc. GI-Fachtagung ”Datenbanksysteme in Büro, Technik und Wissenschaft”, Informatik Fachbericht 136, 247–258, 1987
J. A. Orenstein: ‘Multidimensional tries used for associative searching', Information Processing Letters, 14, 4, 150–157, 1982
J. A. Orenstein: ‘Query processing in object-oriented data base systems', Proc. ACM SIGMOD Int. Conf. on Management of Data, 1986
J. T. Robinson: ‘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
H. Samet: ‘The design and analysis of spatial data structures', Addison Wesley, 1989
B. Seeger, H. P. Kriegel: ‘Design and implementation of spatial access methods', Proc. 14th Int. Conf. on Very Large Data Bases, 360–371, 1988
B. Seeger, H. P. Kriegel: ‘The buddy-tree: an efficient and robust access method for spatial data base systems', Proc. 16th Int. Conf. on Very Large Data Bases, 590–601, 1990
T. Sellis, N. Roussopoulos, C. Faloutsos: ‘The R +-tree: a dynamic index for multidimensional objects', Proc. 13th Int. Conf. on Very Large Database, 1987
H.-W. Six, P. Widmayer: 'spatial Searching in Geometric Databases', Proc. 4th Int. Conf. on Data Engineering, 496–503, 1988
M. Tamminen, R. Sulonen: ‘The Excell method for efficient geometric access to data', Proc. 19th ACM Design Automation Conf. 345–351, 1982
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seeger, B. (1991). Performance comparison of segment access methods implemented on top of the buddy-tree. In: Günther, O., Schek, HJ. (eds) Advances in Spatial Databases. SSD 1991. Lecture Notes in Computer Science, vol 525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54414-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-54414-3_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54414-2
Online ISBN: 978-3-540-47615-3
eBook Packages: Springer Book Archive