Abstract
Recently, there has been increasing interest in research on push-based information systems that deliver data by broadcast in both wired and wireless environments. This paper proposes new caching strategies to reduce the response time of data access by assuming an environment where clients consecutively issue access requests for multiple data items with think time. The proposed strategies take into account each client’s access characteristics, such as correlation among data items and think-time between a data access and the next access request, and reduce the average response time by caching data items with long expected response time. Moreover, we evaluate the effectiveness of the proposed strategies by simulation experiments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast Disks: Data Management for Asymmetric Communication Environments. In: Proc. ACM SIGMOD 1995, pp. 199–210 (1995)
Acharya, S., Franklin, M., Zdonik, S.: Prefetching from a Broadcast Disk. In: Proc. Int’l Conf. on Database Engineering, pp. 276–285 (1996)
Aksoy, D., Franklin, M.: RxW: A Scheduling Approach for Large-Scale On-Demand Data Broadcast. IEEE/ACM Transactions On Networking 7(6), 846–860 (1999)
Guo, Y., Das, K.D., Pinotti, C.M.: A New Hybrid Broadcast Scheduling Algorithm for Asymmetric Communication Systems: Push and Pull Data Based on Optimal Cut-off Point. In: Proc. Int’l Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 123–130 (2001)
Kraiss, A., Weikum, G.: Integrated Document Caching and Prefetching in Storage Hierarchies Based on Markov-Chain Predictions. VLDB Journal: The Very Large Data Bases 7(3), 141–162 (1998)
Lin, L., Xingming, Z.: Heuristic Multidisk Scheduling for Data Broadcasting. In: Proc. Int’l Workshop on Satellite-Based Information Services, pp. 1–5 (1997)
Palmer, M., Zdonik, S.B.: Fido: A Cache That Learns to Fetch. In: Proc. 17th Int’l Conf. on Very Large Data Bases, pp. 255–264 (1991)
Uchida, W., Hara, T., Yajima, E., Nishio, S.: Broadcast Scheduling of Correlated Data Considering Access Frequency in Push-Based Systems. In: Proc. IASTED Int’l Conf. on Advances in Communications, pp. 150–155 (2001)
Vaidya, N.H., Hameed, S.: Scheduling Data Broadcast in Asymmetric Communication Environments. ACM-Baltzer Journal of Wireless Networks 5(3), 171–182 (1999)
Yajima, E., Hara, T., Tsukamoto, M., Nishio, S.: Scheduling Strategies of Correlated Data in Push-Based Systems. Information Systems and Operational Research 39(2), 152–173 (2001)
Yajima, E., Hara, T., Tsukamoto, M., Nishio, S.: Scheduling and Caching Strategies for Correlated Data in Push-Based Information Systems. ACM Applied Computing Review 9(1), 22–78 (2001)
Xu, J., Hu, Q., Lee, D.L.: SAIU: An Efficient Cache Replacement Policy for Wireless On-Demand Broadcasts. In: Proc. ACM Conference on Information and Knowledge Management, pp. 46–53 (2000)
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
Uchida, W., Hara, T., Nishio, S. (2005). Caching Strategies for Push-Based Broadcast Considering Consecutive Data Accesses with Think-Time. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_28
Download citation
DOI: https://doi.org/10.1007/11408079_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)