Intelligent-based latency reduction in 3D walkthrough

In many visualization applications (VA), the size of the database is not only extremely large, it is also growing rapidly. Even for relatively simple searches, the time required to move the data off storage media is expensive. However, object correlations are common semantic patterns in VA. They can be exploited for improve the effectiveness of storage caching, prefetching, data layout, and disk scheduling. However, little approaches for discovering object correlations in VA to improve the performance of storage systems. In this paper, we develop a class of view-based projection-generation method for mining various frequent sequential traversal patterns in the VA. The frequent sequential traversal patterns are used to predict the user navigation behavior. Furthermore, the hypergraph-based clustering scheme can help reduce disk access time with proper placement patterns into disk blocks. Finally, we have done extensive experiments to demonstrate how these proposed techniques not only significantly cut down disk access time, but also enhance the accuracy of data prefetching.

[1]  C. Berge.  Graphes et hypergraphes , 1970 .

[2]  Andrea C. Arpaci-Dusseau,et al.  Semantically-Smart Disk Systems , 2003, FAST.

[3]  Vipin Kumar,et al.  Clustering Based On Association Rule Hypergraphs , 1997, DMKD.

[4]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[5]  Cláudio T. Silva,et al.  Visibility-based prefetching for interactive out-of-core rendering , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[6]  Anupam Joshi,et al.  On Mining Web Access Logs , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[7]  Eisaku Ohbuchi,et al.  A real-time refraction renderer for volume objects using a polygon-rendering scheme , 2003, Proceedings Computer Graphics International 2003.

[8]  Dinesh Manocha,et al.  Cache-oblivious mesh layouts , 2005, ACM Trans. Graph..

[9]  Choong-Ho Cho,et al.  Hierarchical reduction and partition of hypergraph , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[10]  Umeshwar Dayal,et al.  FreeSpan: frequent pattern-projected sequential pattern mining , 2000, KDD '00.

[11]  H.-P. Seidel,et al.  On the Fast Construction of Spatial Hierarchies for Ray Tracing , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[12]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[13]  Xuan Tang,et al.  Out-of-core visualization using iterator-aware multidimensional prefetching , 2005, IS&T/SPIE Electronic Imaging.

[14]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[15]  Gregory R. Ganger,et al.  Informed data distribution selection in a self-predicting storage system , 2006, 2006 IEEE International Conference on Autonomic Computing.

[16]  Sang Lyul Min,et al.  Towards application/file-level characterization of block references: a case for fine-grained buffer management , 2000, SIGMETRICS '00.

[17]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[18]  Alan Jay Smith,et al.  Sequentiality and prefetching in database systems , 1978, TODS.

[19]  Min Chen,et al.  Knowledge-Based Out-of-Core Algorithms for Data Management in Visualization , 2006, EuroVis.

[20]  P. Jaccard.  THE DISTRIBUTION OF THE FLORA IN THE ALPINE ZONE.1 , 1912 .

[21]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[22]  Marianne Winslett,et al.  GODIVA: lightweight data management for scientific visualization applications , 2004, Proceedings. 20th International Conference on Data Engineering.