In this paper we propose a prefetching algorithm called STAP (Spatial and Temporal Association based Prefetching algorithm). Our methods are based on the analysis of the spatial and temporal associations of the user's request using data mining techniques. First, we exploit an "associative class set" consisting of an itemset of service classes that is close both spatially and temporally and frequently requested together. With the first method, our prefetching algorithm can select a candidate set that is spatially and temporally associated with the previous request of a user. It is shown that through performance experiments STAP is effective in improving system performance. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kim, H. S., & Yong, H. S. (2005). Association based prefetching algorithm in mobile environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3605 LNCS, pp. 243–250). Springer Verlag. https://doi.org/10.1007/11535409_34
Mendeley helps you to discover research relevant for your work.