Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ren, Q., Dunham, M.H.: Using Semantic Caching to Manage Location Dependent Data Mobile Computing. In: Proceedings of MobiCom 2000, Boston, Massachusetts, pp. 210–221 (2000)
Kubach, U., Rothemel, K.: Exploiting Location Information for Infostation- Based Hoarding. In: International Conference on Mobile Computing and Networking, pp. 15–27 (2001)
Zheng, B., Xu, J., Lee, D.L.: Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environment. IEEE Transactions on Computers 51(10), 1141–1153 (2002)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proceedings of International Conference on Data Engineering, pp. 3–14 (1995)
Agrawal, R., Imielinski, T., Sqami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 207–216 (1993)
Morimoto, Y.: Mining Frequent Neighboring Class Sets in Spatial Databases. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 353–358 (2001)
PolyAnalyst 4.5, http://www.megaputer.com
Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data, pp. 73–84 (1998)
Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of ACM SIGMOD 3rd, pp. 226–231 (1996)
Seo, Y.-D., Ahn, K.-H., Hong, B.-H.: Analysis of Using Internet GIS. Korea Information Science Society SIGDB 18(1), 41–52 (2002)
Phatak, D.S., Mulvaney, R.: Clustering for Personalized Mobile Web Usage. In: Proceedings of the IEEE FUZZ 2002, pp. 705–710 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HS., Yong, HS. (2005). Association Based Prefetching Algorithm in Mobile Environments. In: Wu, Z., Chen, C., Guo, M., Bu, J. (eds) Embedded Software and Systems. ICESS 2004. Lecture Notes in Computer Science, vol 3605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535409_34
Download citation
DOI: https://doi.org/10.1007/11535409_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28128-3
Online ISBN: 978-3-540-31823-1
eBook Packages: Computer ScienceComputer Science (R0)