Abstract
The visual exploration of large databases calls for a tight coupling of database and visualization systems. Current visualization systems typically fetch all the data and organize it in a scene tree that is then used to render the visible data. For immersive data explorations in a Cave or a Panorama, where an observer is data space this approach is far from optimal. A more scalable approach is to make the observer-aware database system and to restrict the communication between the database and visualization systems to the relevant data.
In this paper VR-tree, an extension of the R-tree, is used to index visibility ranges of objects. We introduce a new operator for incremental Observer Relative data Extraction (iORDE). We propose the Volatile Access STructure (VAST), a lightweight main memory structure that is created on the fly and is maintained during visual data explorations. VAST complements VR-tree and is used to quickly determine objects that enter and leave the visibility area of an observer. We provide a detailed algorithm and we also present experimental results that illustrate the benefits of VAST.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of Annual Meeting SIGMOD 1984, pp. 47–57 (1984)
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: Proc. of Int. Conference on Management of Data, pp. 322–331 (1990)
Berchtold, S., Keim, D.A., Kriegel, H.P.: The x-tree: An index structure for highdimensional data. In: Proc. of Int. Conference on Very Large Data Bases, pp. 28–39 (1996)
White, D.A., Jain, R.: Similarity indexing with the ss-tree. In: Proc. of Int. Conference on Data Engineering, pp. 516–523 (1996)
Katayama, N., Satoh, S.: The sr-tree: An index structure for high-dimensional nearest neighbor queries. In: Proc. of Int. Conference on Management of Data, pp. 369–380 (1997)
Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Overlapping linear quadtrees: A spatio-temporal access method. In: Proc. of Int. Symposium on Advances in Geographic Information Systems, pp. 1–7 (1998)
Robinson, J.T.: The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In: Proc. of Int. Conference on Management of Data, pp. 10–18 (1981)
Henrich, A.: The lsdh-tree: An access structure for feature vectors. In: Proc. of Int. Conference on Data Engineering, pp. 362–369 (1998)
Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proc. of Int. Symposium on Advances in Spatial and Temporal Databases, pp. 79–96 (2001)
Kofler, M., Gervautz, M., Gruber, M.: R-trees for organizing and visualizing 3d gis databases. Journal of Visualization and Computer Animation 11, 129–143 (2000)
Koefler, M.: R-Trees for Visualizing and Organizing Large 3D GIS Databases. PhD thesis, Technichen Universit at Graz (1998)
Shou, L., Chionh, J., Huang, Z., Tan, K.L., Ruan, Y.: Walking through a very large virtual environment in real-time. In: Proceedings of Int. Conference on Very Large Data Bases, pp. 401–410 (2001)
Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proc. of Int. Conference on Very Large Data Bases, pp. 562–573 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bukauskas, L., Böhlen, M.H. (2004). Incremental Observer Relative Data Extraction. In: Williams, H., MacKinnon, L. (eds) Key Technologies for Data Management. BNCOD 2004. Lecture Notes in Computer Science, vol 3112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27811-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-27811-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22382-5
Online ISBN: 978-3-540-27811-5
eBook Packages: Springer Book Archive