Abstract
Features of the VASCO R-tree JAVATM applet are described to support its demonstration. This includes an explanation of the different R-tree node splitting methods that are implemented in VASCO and of the functionality of the control panel of the applet. The applet enables users to visualize the different variants of the R-tree as well as observe their behavior for finding the nearest neighbors to a query point and the objects within a given query window in an incremental manner. 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-971271S.
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 ).
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), Visualizing and animating r-trees and spatial operations in spatial databases on the worldwide web, in ‘Proceedings of the IFIP 2.6 4th Working Conference on Visual Database Systems (VDB-4)’, L’Aquila, Italy.
Guttman, A. (1984), R-trees: a dynamic index structure for spatial searching, in ‘Proceedings of the ACM SIGMOD Conference’, Boston, MA, pp. 47–57.
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.
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.
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.
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). The VASCO R-tree JAVATM Applet. 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_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-35372-2_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6939-5
Online ISBN: 978-0-387-35372-2
eBook Packages: Springer Book Archive