Intelligent-based latency reduction in 3D walkthrough

Authors:
Tsou Tsun Fu;Shao-Shin Hung;Hui-Ling Lin;Derchian Tsaih;Jung Tzung Chen
Affiliations:
Department of Information Management, WuFeng Institute of Technology, Taiwan, R.O.C;Department of Computer Science and Information Engineering, WuFeng Institute of Technology, Chiayi, Taiwan, R.O.C;Department of International Business, Ling Tung University, Taiwan, R.O.C;Department of Electronic Commerce Management, Nanhua University, Chiayi, Taiwan, R.O.C;Department of Electronic Engineering, WuFeng Institute of Technology, Chiayi, Taiwan, R.O.C
Venue:
ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
Year:
2010

Citing 15
Cited 1

Mining quantitative association rules in large relational tables

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Sequentiality and prefetching in database systems

ACM Transactions on Database Systems (TODS)
Towards application/file-level characterization of block references: a case for fine-grained buffer management

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FreeSpan: frequent pattern-projected sequential pattern mining

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Hierarchical geometric models for visible surface algorithms

Communications of the ACM
Mining Sequential Patterns: Generalizations and Performance Improvements

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth

ICDE '01 Proceedings of the 17th International Conference on Data Engineering
GODIVA: Lightweight Data Management for Scientific Visualization Applications

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Visibility-Based Prefetching for Interactive Out-Of-Core Rendering

PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Semantically-Smart Disk Systems

FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Using prefetching to improve walkthrough latency: Research Articles

Computer Animation and Virtual Worlds - CASA 2006
Informed data distribution selection in a self-predicting storage system

ICAC '06 Proceedings of the 2006 IEEE International Conference on Autonomic Computing
Hierarchical reduction and partition of hypergraph

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Knowledge-based out-of-core algorithms for data management in visualization

EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization

SCOUT: prefetching for latent structure following queries

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.