Abstract
The rationale behind the design of a JAVATM spatial index applet is described that enables users on the worldwide web to experiment with different variants of the R-tree. The applet is part of the VASCO system that contains JAVATM applets for a large set of hierarchical spatial data structures. The R-trees can be built using different splitting rules and include the R*-tree. The applet enables users to see in an animated manner how a number of basic spatial database search operations are executed for them. The spatial operations are spatial selection (i.e., a window or spatial range query) and a nearest neighbor query that enables ranking spatial objects in the order of their distance from a given query object. The results of the different splitting rules and the algorithms are visualized and animated in a consistent manner using the same primitives and colors so that the differences between the effects of the rules can be easily understood. The applet can be used to monitor the performance of spatial databases that use an R-tree spatial index as well as tune them by observing their behavior for different distributions of data. The applet can be found at http://www.cs.umd.edu/~hjs/rtrees/index.html.
This work was supported in part by the National Science Foundation under Grant IRI-9712715.
Chapter PDF
Similar content being viewed by others
Keywords
References
Ang, C. H., Tan, T. C. (1997), New linear node splitting algorithm for R-trees, in M. Scholl, A. Voisard, eds, `Advances in Spatial Databases — Fifth International Symposium, SSD’97’, Berlin, Germany, pp. 339–349. (Also Springer-Verlag Lecture Notes in Computer Science 1262 ).
Aref, W. G., Samet, H. (1991), Optimization strategies for spatial query processing, in G. Lohman, ed., `Proceedings of the 17th International Conference on Very Large Data Bases’, Barcelona, pp. 81–90.
Arnold, K., Gosling, J. (1996), The JAVATM programming language, Addison-Wesley, Reading, MA.
Beckmann, N., Kriegel, H. P., Schneider, R., Seeger, B. (1990), The R*-tree: an efficient and robust access method for points and rectangles, in `Proceedings of the ACM SIGMOD Conference’, Atlantic City, NJ, pp. 322–331.
Brabec, F., Samet, H. (1998), The VASCO R-tree JAVA applet, in `Proceedings of the IFIP 2.6 4th Working Conference on Visual Database Systems (VDB-4)’, L’Aquila, Italy.
Brinkhoff, T., Kriegel, H. P., Schneider, R., Seeger, B. (1994), GENESYS: A system for efficient spatial query processing, in `Proceedings of the ACM SIGMOD Conference’, Minneapolis, MN, p. 519.
Brown, M. H., Sedgewick, R. (1984), `A system for algorithm animation’, Computer Graphics 18(3), 177–186. (Also Proceedings of the SIGGRAPH’84 Conference, Minneapolis, July 1984 ).
Comer, D. (1979), `The ubiquitousB-tree’, ACM Computing Surveys 11(2), 121–137. Foley, J. D., van Dam, A., Feiner, S. K., Hughes, J. F. (1990), Computer Graphics: Principles and Practice, second edn, Addison-Wesley, Reading, MA.
Outing, R. H. (1994), `An introduction to spatial database systems’, VLDB Journal 3 (4), 401–444.
Guttman, A. (1984), R-trees: a dynamic index structure for spatial searching, in ‘Proceedings of the ACM SIGMOD Conference’, Boston, MA, pp. 47–57.
Herring, J. R. (1996), Oracle7 spatial data option’: Advances in relational database technology for spatial data management, Technical report.
Hjaltason, G. R., Samet, H. (1995), Ranking in spatial databases, in M. J. Egenhofer, J. R. Herring, eds, `Advances in Spatial Databases — Fourth International Symposium, SSD’95’, Portland, ME, pp. 83–95. (Also Springer-Verlag Lecture Notes in Computer Science 951 ).
Kamel, I., Faloutsos, C. (1993), On packing R-trees, in `Proceedings of the Second International Conference on Information and Knowledge Management’, Washington, DC, pp. 490–499.
Kamel, I., Faloutsos, C. (1994), Hilbert R-tree: An improved R-tree using fractals, in J. Bocca, M. Jarke, C. Zaniolo, eds, `Proceedings of the 20th International Conference on Very Large Data Bases’, Santiago, Chile, pp. 500–509.
Kang, M. A., Li, K. J. (1995), Query processing methods for connectivity search in visual databases using R+-trees, in S. Spaccapietra, R. Jain, eds, `Proceedings of the IFIP 2. 6 3rd Working Conference on Visual Database Systems (VDB-3)’, Chapman and Hall, London, England, pp. 365–377.
Keim, D. A., Kriegel, H. P. (1995), Possibilities and limits in visualizing large databases, in S. Spaccapietra, R. Jain, eds, `Proceedings of the IFIP 2. 6 3rd Working Conference on Visual Database Systems (VDB-3)’, Chapman and Hall, London, England, pp. 177–190.
Lenhof, H. P., Smid, M. (1994), An animation of a fixed-radius all-nearest-neighbors algorithm, in `Proceedings of the Tenth Annual Symphosium on Computational Geometry’, Stony Brook, NY, p. 387.
Murphy, M., Skiena, S. S. (1993), Ranger: A tool for nearest neighbor search high dimensions, in `Proceedings of the Ninth Annual Symposium on Computational Geometry’, San Diego, CA, pp. 403–404.
Nievergelt, J., Hinterberger, H., Sevcik, K. C. (1984), `The grid file: an adaptable, symmetric multikey file structure’, ACM Transactions on Database Systems 9 (1), 38–71.
Oracle Corporation (1996), Advances in relational database technology for spatial data management, Oracle spatial data option technical white paper.
Preparata, F. P., Shamos, M. I. (1985), Computational Geometry: An Introduction, Springer-Verlag, New York.
Roussopoulos, N., Leifker, D. (1985), Direct spatial search on pictorial databases using packed R-trees, in `Proceedings of the ACM SIGMOD Conference’, Austin, TX, pp. 17–31.
Roussopoulos, N., Kelley, S., Vincent, F (1995), Nearest neighbor queries, in ‘Proceedings of the ACM SIGMOD Conference’, San Jose, CA, pp. 71–79.
Samet, H. (1990a), Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS, Addison-Wesley, Reading, MA.
Samet, H. (1990b), The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA.
Scholl, M., Voisard, A., eds (1997), Advances in Spatial Databases — Fifth International Symposium, SSD ‘87, Springer-Verlag, Berlin, Germany. (Also Springer-Verlag Lecture Notes in Computer Science 1262 ).
Sellis, T., Roussopoulos, N., Faloutsos, C. (1987), The R+-tree: a dynamic index for multi—dimensional objects, in P. M. Stocker, W. Kent, eds, `Proceedings of the 13th International Conference on Very Large Databases (VLDB)’, Brighton, England, pp. 71–79. (Also University of Maryland Computer Science TR-1795).
Spaccapietra, S., Jain, R., eds (1995), Proceedings of the IFIP 2.6 3rd Working Conference on Visual Database Systems (VDB-3), Chapman and Hall, London, England.
Stonebraker, M. (1997), Limitations of spatial simulators for relational DBMSs, Technical report, INFORMIX Software, Inc. (see http: / /www inf ormix. com/informix/corpinfo/zines/whitpprs/wpsplsim.pdf).
White, M. (1982), N-trees: large ordered indexes for multi-dimensional space, Statistical research division, US Bureau of the Census, Washington, DC.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brabec, F., Samet, H. (1998). Visualizing and Animating R-trees and Spatial Operations in Spatial Databases on the Worldwide Web. In: Ioannidis, Y., Klas, W. (eds) Visual Database Systems 4 (VDB4). VDB 1998. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35372-2_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-35372-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6939-5
Online ISBN: 978-0-387-35372-2
eBook Packages: Springer Book Archive