Linas Bukauskas
Michael H. Böhlen
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, which is then used to render the visible data. For immersive data explorations, where an observer navigates in a potentially huge data space and explores selected data regions this approach is inadequate. A scalable approach is to make the database system observer-aware and exchange the data that is visible and most relevant to the observer.In this paper we present iTopN an incremental algorithm for extracting the most visible objects relative to the current position of the observer. We implement iTopN and compare it to an improved version of the R-tree that extends LRU with the caching of the top levels of the R-tree (LW-LRU). Our experiments show that iTopN is orders of magnitude faster than LW-LRU given the same amount of memory. Our experiments also show that for LW-LRU to perform as fast as iTopN it needs three times as much memory.
- N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. In Proceedings of ACM SIGMOD International Conference on Management of Data pages 322--331. ACM Press, 1990. Google Scholar
Digital Library
- S. Berchtold, D. A. Keim, and H.-P. Kriegel. The x-tree: An index structure for high-dimensional data. In Proceedings of 22th International Conference on Very Large Data Bases, pages 28--39. Morgan Kaufmann, 1996. Google ScholarDigital Library
- M. Böhlen, L. Bukauskas, P. S. Eriksen, S. L. Lauritzen, A. Mažeika, P. Musaeus, and P. Mylov. 3D Visual Data Mining: Goals and Experiences. In Journal Computational Statistics & Data Analysis, of the International Association of Statistical Computing, 43, pages 445--469, Elsevier Science, 2003. Google Scholar
- A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD'84, Proceedings of Annual Meeting, pages 47--57. ACM Press, 1984. Google ScholarDigital Library
- J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proceedings of 21th International Conference on Very Large Data Bases, pages 562--573. Morgan Kaufmann, 1995. Google ScholarDigital Library
- A. Henrich. The lsdh-tree: An access structure for feature vectors. In Proceedings of 14th International Conference on Data Engineering, pages 362--369. IEEE Computer Society, 1998. Google ScholarDigital Library
- M. Kofler, M. Gervautz, and M. Gruber. R-trees for organizing and visualizing 3d gis databases. Journal of Visualization and Computer Animation, 11(3), pages 129--143, 2000.Google ScholarCross Ref
- J. T. Robinson. The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 10--18. ACM Press, 1981. Google ScholarDigital Library
- L. Shou, J. Chionh, Z. Huang, K.-L. Tan, and Y. Ruan. Walking through a very large virtual environment in real-time. In Proceedings of the 27th International Conference on Very Large Data Bases, pages 401--410. Morgan Kaufmann, 2001. Google ScholarDigital Library
- Z. Song and N. Roussopoulos. K-nearest neighbor search for moving query point. In Advances in Spatial and Temporal Databases, 7th International Symposium, SSTD, pages 79--96. Springer, 2001. Google ScholarDigital Library
- Y. Tao and D. Papadias. Time-parameterized queries in spatio-temporal databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 334--345. ACM Press, 2002. Google ScholarDigital Library
- G. Varadhan and D. Manocha. Out-of-core rendering of massive geometric environments. In Proceedings of the Conference on Visualization '02, pages 69--76. IEEE Press, 2002. Google ScholarDigital Library
- S. Šaltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In Proceedings of ACM SIGMOD International Conference on Management of Data, volume 29, pages 331--342. ACM Press, 2000. Google ScholarDigital Library
- D. A. White and R. Jain. Similarity indexing with the ss-tree. In Proceedings of the 12th International Conference on Data Engineering, pages 516--523. IEEE Computer Society, 1996. Google ScholarDigital Library
Index Terms
- iTopN: incremental extraction of the N most visible objects
Recommendations
Precomputed illuminance composition for real-time global illumination
I3D '16: Proceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and GamesIn this paper we present a new real-time approach for indirect global illumination under dynamic lighting conditions. We use surfels to gather a sampling of the local illumination and propagate the light through the scene using a hierarchy and a set of ...
Comments