Premium
Using prefetching to improve walkthrough latency
Author(s) -
Hung ShaoShin,
Liu Damon ShingMin
Publication year - 2006
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.149
Subject(s) - computer science , tree traversal , latency (audio) , data mining , class (philosophy) , software walkthrough , artificial intelligence , software , algorithm , software system , programming language , telecommunications , software construction
Object correlations are common semantic patterns in walkthrough (WT) systems. They can be exploited for improving the effectiveness of storage caching, prefecthing, data layout, and minimization of query‐response times. Previous approaches for reducing I/O access time are seldom investigated. On the other side, data mining techniques extract implicit, previously unknown and potentially useful information from the databases. However, those methods are presented for typical data mining datasets and not suitable for our WT system datasets. This paper proposes a class of novel and efficient pattern‐growth method for mining various frequent sequential traversal patterns in the WT. Our pattern‐growth method adopts a divide‐and‐conquer approach to decompose both the mining tasks and the databases. The frequent sequential traversal patterns are used to predict the user navigation behavior and help to reduce disk access time with proper placement patterns into disk blocks. We also define the terminologies such as paths, views, and objects used in the model. 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. Copyright © 2006 John Wiley & Sons, Ltd.