Relevant bibliographies by topics / Caching Dynamic Data

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Caching Dynamic Data'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Caching Dynamic Data.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Caching Dynamic Data"

1

Park, Seongsoo, Minseop Jeong, and Hwansoo Han. "CCA: Cost-Capacity-Aware Caching for In-Memory Data Analytics Frameworks." Sensors 21, no. 7 (March 26, 2021): 2321. http://dx.doi.org/10.3390/s21072321.

Full text
Abstract:
To process data from IoTs and wearable devices, analysis tasks are often offloaded to the cloud. As the amount of sensing data ever increases, optimizing the data analytics frameworks is critical to the performance of processing sensed data. A key approach to speed up the performance of data analytics frameworks in the cloud is caching intermediate data, which is used repeatedly in iterative computations. Existing analytics engines implement caching with various approaches. Some use run-time mechanisms with dynamic profiling and others rely on programmers to decide data to cache. Even though caching discipline has been investigated long enough in computer system research, recent data analytics frameworks still leave a room to optimize. As sophisticated caching should consider complex execution contexts such as cache capacity, size of data to cache, victims to evict, etc., no general solution often exists for data analytics frameworks. In this paper, we propose an application-specific cost-capacity-aware caching scheme for in-memory data analytics frameworks. We use a cost model, built from multiple representative inputs, and an execution flow analysis, extracted from DAG schedule, to select primary candidates to cache among intermediate data. After the caching candidate is determined, the optimal caching is automatically selected during execution even if the programmers no longer manually determine the caching for the intermediate data. We implemented our scheme in Apache Spark and experimentally evaluated our scheme on HiBench benchmarks. Compared to the caching decisions in the original benchmarks, our scheme increases the performance by 27% on sufficient cache memory and by 11% on insufficient cache memory, respectively.
APA, Harvard, Vancouver, ISO, and other styles
2

Kumar, Prashant, Naveen Chauhan, LK Awasthi, and Narottam Chand. "Enhancing Data Availability in MANETs with Cooperative Caching." International Journal of Mobile Computing and Multimedia Communications 3, no. 4 (October 2011): 53–66. http://dx.doi.org/10.4018/jmcmc.2011100104.

Full text
Abstract:
Mobile Adhoc Networks (MANETs) are very popular solutions where network infrastructure installation is not possible. In MANETs, nodes are mobile, and due to this mobility, topology of the network changes rapidly. This dynamic topology reduces the data availability in MANETs. Cooperative caching provides an attractive solution for this problem. In this paper, a new cooperative caching algorithm, ProCoCa, is proposed. This algorithm is based on a proactive approach. Each node will be associated with a zone and the data of leaving node will be cached. The authors simulate the algorithm on OMNET++ simulator, and simulation results show that ProCoCa improves the data availability as well as overall performance of the network.
APA, Harvard, Vancouver, ISO, and other styles
3

Yovita, Leanna Vidya, and Nana Rachmana Syambas. "Caching on Named Data Network: a Survey and Future Research." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 6 (December 1, 2018): 4456. http://dx.doi.org/10.11591/ijece.v8i6.pp4456-4466.

Full text
Abstract:
The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Xiaohui, Kehe Wu, and Fei Chen. "Smart Caching Based on Mobile Agent of Power WebGIS Platform." Scientific World Journal 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/757182.

Full text
Abstract:
Power information construction is developing towards intensive, platform, distributed direction with the expansion of power grid and improvement of information technology. In order to meet the trend, power WebGIS was designed and developed. In this paper, we first discuss the architecture and functionality of power WebGIS, and then we study caching technology in detail, which contains dynamic display cache model, caching structure based on mobile agent, and cache data model. We have designed experiments of different data capacity to contrast performance between WebGIS with the proposed caching model and traditional WebGIS. The experimental results showed that, with the same hardware environment, the response time of WebGIS with and without caching model increased as data capacity growing, while the larger the data was, the higher the performance of WebGIS with proposed caching model improved.
APA, Harvard, Vancouver, ISO, and other styles
5

Raghunathan, A., and K. Murugesan. "Performance-Enhanced Caching Scheme for Web Clusters for Dynamic Content." International Journal of Business Data Communications and Networking 7, no. 3 (July 2011): 16–36. http://dx.doi.org/10.4018/jbdcn.2011070102.

Full text
Abstract:
In order to improve the QoS of applications, clusters of web servers are increasingly used in web services. Caching helps improve performance in web servers, but is largely exploited only for static web content. With more web applications using backend databases today, caching of dynamic content has a crucial role in web performance. This paper presents a set of cache management schemes for handling dynamic data in web clusters by sharing cached contents. These schemes use either automatic or expiry-based cache validation, and work with any type of request distribution. The techniques improve response by utilizing the caches efficiently and reducing redundant database accesses by web servers while ensuring cache consistency. The authors present caching schemes for both horizontal and vertical cluster architectures. Simulations show an appreciable performance rise in response times of queries in clustered web servers.
APA, Harvard, Vancouver, ISO, and other styles
6

Kumar, Prashant, Naveen Chauhan, LK Awasthi, and Narottam Chand. "Cooperative Cache Replacement Policy for MANETs." International Journal of Advanced Pervasive and Ubiquitous Computing 6, no. 2 (April 2014): 36–47. http://dx.doi.org/10.4018/ijapuc.2014040103.

Full text
Abstract:
Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improve the data access, performance and availability. While caching the new data items, it is very important which data item is to be removed, as in MANETs the data is not stored only on behalf of caching node but interest of the vicinity is also considered. In this paper the authors presented a new cache replacement policy for MANETs. This policy is based on multi-parameter value called SAT. We simulate the proposed work on OMNET++ and the simulation results shows that proposed replacement policy helps to improve the data availability in network.
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Ru, and Meiju Yu. "A caching strategy based on dynamic popularity for named data networking." International Journal of Information Technology and Management 19, no. 4 (2020): 305. http://dx.doi.org/10.1504/ijitm.2020.10028767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yu, Meiju, and Ru Li. "A caching strategy based on dynamic popularity for named data networking." International Journal of Information Technology and Management 19, no. 4 (2020): 305. http://dx.doi.org/10.1504/ijitm.2020.110238.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Jinjiang, Yihua Lan, Jingjing Liang, Quanzhou Cheng, Chih-Cheng Hung, Chao Yin, and Jiadong Sun. "An Efficient Schema for Cloud Systems Based on SSD Cache Technology." Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/109781.

Full text
Abstract:
Traditional caching strategy is mainly based on the memory cache, taking read-write speed as its ultimate goal. However, with the emergence of SSD, the design ideas of traditional cache are no longer applicable. Considering the read-write characteristics and times limit of erasing, the characteristics of SSD are taken into account as far as possible at the same time of designing caching strategy. In this paper, the flexible and adaptive cache strategy based on SSD is proposed, called FAC, which gives full consideration to the characteristics of SSD itself, combines traditional caching strategy design ideas, and then maximizes the role SSD has played. The core mechanism is based on the dynamic adjustment capabilities of access patterns and the efficient selection algorithm of hot data. We have developed dynamical adjust section hot data algorithm, DASH in short, to adjust the read-write area capacity to suit the current usage scenario dynamically. The experimental results show that both read and write performance of caching strategy based on SSD have improved a lot, especially for read performance. Compared with traditional caching strategy, the technique can be used in engineering to reduce write times to SSD and prolong its service life without lowering read-write performance.
APA, Harvard, Vancouver, ISO, and other styles
10

Ji, Jiequ, Kun Zhu, Ran Wang, Bing Chen, and Chen Dai. "Energy Efficient Caching in Backhaul-Aware Cellular Networks with Dynamic Content Popularity." Wireless Communications and Mobile Computing 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/7532049.

Full text
Abstract:
Caching popular contents at base stations (BSs) has been regarded as an effective approach to alleviate the backhaul load and to improve the quality of service. To meet the explosive data traffic demand and to save energy consumption, energy efficiency (EE) has become an extremely important performance index for the 5th generation (5G) cellular networks. In general, there are two ways for improving the EE for caching, that is, improving the cache-hit rate and optimizing the cache size. In this work, we investigate the energy efficient caching problem in backhaul-aware cellular networks jointly considering these two approaches. Note that most existing works are based on the assumption that the content catalog and popularity are static. However, in practice, content popularity is dynamic. To timely estimate the dynamic content popularity, we propose a method based on shot noise model (SNM). Then we propose a distributed caching policy to improve the cache-hit rate in such a dynamic environment. Furthermore, we analyze the tradeoff between energy efficiency and cache capacity for which an optimization is formulated. We prove its convexity and derive a closed-form optimal cache capacity for maximizing the EE. Simulation results validate the proposed scheme and show that EE can be improved with appropriate choice of cache capacity.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Caching Dynamic Data"

1

Mahdavi, Mehregan Computer Science &amp Engineering Faculty of Engineering UNSW. "Caching dynamic data for web applications." Awarded by:University of New South Wales. Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/32316.

Full text
Abstract:
Web portals are one of the rapidly growing applications, providing a single interface to access different sources (providers). The results from the providers are typically obtained by each provider querying a database and returning an HTML or XML document. Performance and in particular providing fast response time is one of the critical issues in such applications. Dissatisfaction of users dramatically increases with increasing response time, resulting in abandonment of Web sites, which in turn could result in loss of revenue by the providers and the portal. Caching is one of the key techniques that address the performance of such applications. In this work we focus on improving the performance of portal applications via caching. We discuss the limitations of existing caching solutions in such applications and introduce a caching strategy based on collaboration between the portal and its providers. Providers trace their logs, extract information to identify good candidates for caching and notify the portal. Caching at the portal is decided based on scores calculated by providers and associated with objects. We evaluate the performance of the collaborative caching strategy using simulation data. We show how providers can trace their logs and calculate cache-worthiness scores for their objects and notify the portal. We also address the issue of heterogeneous scoring policies by different providers and introduce mechanisms to regulate caching scores. We also show how portal and providers can synchronize their meta-data in order to minimize the overhead associated with collaboration for caching.
APA, Harvard, Vancouver, ISO, and other styles
2

Mostafa, Nour. "Intelligent dynamic caching for large data sets in a grid environment." Thesis, Queen's University Belfast, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.602689.

Full text
Abstract:
Present and future distributed applications need to deal with very large PetaBytes (PB) datasets and increasing numbers of associated users and resources. The emergence of Grid-based systems as a potential solution for large computational and data management problems has initiated significant research activity in the area. Grid research can be divided into two at least areas: Data Grids and Computational Grids. The aims of Data Grids are to provide services for accessing, sharing and modifying large databases, the aims of Computational Grids are to provide services for sharing resources. The considerable increase in data production and data sharing within scientific communities has created the need for improvements in data access and data availability. It can be argued the problems associated with the management of very large datasets are not well serviced by current approaches. The thesis concentrates on one of the areas concerned in the access to distributed very large databases on Grid resources. To this end, it presents the design and implementation of partial replication system and a Grid caching system that mediates access to distributed data. Artificial intelligent (AI) techniques such as a neural network (NN) have been used as a prediction element of the model to determine user requirements by analysing the past history of the user. Hence, this thesis will examine the problems surrounding the manipulation of very large data sets within a Grid-like environment The goal is the development of a prototype system that will enable both effective and efficient access to very large datasets, based on the use of a caching model.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Caching Dynamic Data"

1

Mahdavi, Mehregan, Boualem Benatallah, and Fethi Rabhi. "Caching Dynamic Data for E-Business Applications." In Intelligent Information Processing and Web Mining, 459–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36562-4_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gao, Song, Wee Siong Ng, and Weining Qian. "Preserving Consistency of Dynamic Data in Peer-Based Caching Systems." In Lecture Notes in Computer Science, 622–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30075-5_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mahdavi, Mehregan, and Boualem Bentallah. "Caching on the Web." In Web Data Management Practices, 124–58. IGI Global, 2007. http://dx.doi.org/10.4018/978-1-59904-228-2.ch006.

Full text
Abstract:
The World Wide Web provides a means for sharing data and applications among users. However, its performance and in particular providing fast response time is still an issue. Caching is a key technique that addresses some of the performance issues in today’s Web-enabled applications. Deploying dynamic data especially in an emerging class of Web applications, called Web Portals, makes caching even more interesting. In this chapter, we study Web caching techniques with focus on dynamic content. We also discuss the limitations of caching in Web portals and study a solution that addresses these limitations. The solution is based on the collaboration between the portal and its providers.
APA, Harvard, Vancouver, ISO, and other styles
4

Papastavrou, Stavros, George Samaras, Paraskevas Evripidou, and Panos K. Chrysanthis. "Dynamically Generated Web Content." In Web Data Management Practices, 104–23. IGI Global, 2007. http://dx.doi.org/10.4018/978-1-59904-228-2.ch005.

Full text
Abstract:
This chapter takes a tutorial approach to present the Web-related technologies and content middlewares that attempt to accelerate the generation and optimize the delivery of dynamic content. It covers the historical aspects of dynamic content and presents the reasoning behind its introduction while discussing early content middlewares such as the CGI and FastCGI. It then presents the evolution of content middlewares along the lines of contacted research. The discussion focuses on popular techniques that mostly include content caching and content fragmentation. It also discusses a variety of other research efforts such as hardware and low-level acceleration techniques, active caching, and delta encoding. Finally, the authors hope that this chapter will server as an introductory tutorial to students and researchers in the field of dynamic Web content technology.
APA, Harvard, Vancouver, ISO, and other styles
5

Raghunathan, A., and K. Murugesan. "Performance-Enhanced Caching Scheme for Web Clusters for Dynamic Content." In Web-Based Multimedia Advancements in Data Communications and Networking Technologies, 185–206. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2026-1.ch010.

Full text
Abstract:
In order to improve the QoS of applications, clusters of web servers are increasingly used in web services. Caching helps improve performance in web servers, but is largely exploited only for static web content. With more web applications using backend databases today, caching of dynamic content has a crucial role in web performance. This paper presents a set of cache management schemes for handling dynamic data in web clusters by sharing cached contents. These schemes use either automatic or expiry-based cache validation, and work with any type of request distribution. The techniques improve response by utilizing the caches efficiently and reducing redundant database accesses by web servers while ensuring cache consistency. The authors present caching schemes for both horizontal and vertical cluster architectures. Simulations show an appreciable performance rise in response times of queries in clustered web servers.
APA, Harvard, Vancouver, ISO, and other styles
6

Dutta, S., and A. Narang. "Dynamic Uncertainty-Based Analytics for Caching Performance Improvements in Mobile Broadband Wireless Networks." In Big Data, 389–415. Elsevier, 2016. http://dx.doi.org/10.1016/b978-0-12-805394-2.00016-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Qing, Jianmin Zhao, and Xinzhong Zhu. "Statistical Inference-Based Cache Management for Mobile Learning." In Distance Education Environments and Emerging Software Systems, 87–103. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-539-1.ch006.

Full text
Abstract:
Supporting efficient data access in the mobile learning environment is becoming a hot research problem in recent years, and the problem becomes tougher when the clients are using light-weight mobile devices such as cell phones whose limited storage space prevents the clients from holding a large cache. A practical solution is to store the cache data at some proxies nearby, so that mobile devices can access the data from these proxies instead of data servers in order to reduce the latency time. However, when mobile devices move freely, the cache data may not enhance the overall performance because it may become too far away for the clients to access. In this article, we propose a statistical caching mechanism which makes use of prior knowledge (statistical data) to predict the pattern of user movement and then replicates/migrates the cache objects among different proxies. We propose a statistical inference based heuristic search algorithm to accommodate dynamic mobile data access in the mobile learning environment. Experimental studies show that, with an acceptable complexity, our algorithm can obtain good performance on caching mobile data.
APA, Harvard, Vancouver, ISO, and other styles
8

Khelifi, Hakima, Senlin Luo, Boubakr Nour, Hassine Moungla, and Syed Hassan Ahmed. "Vehicular Networks in the Eyes of Future Internet Architectures." In Managing Resources for Futuristic Wireless Networks, 70–97. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-5225-9493-2.ch004.

Full text
Abstract:
The challenging characteristics of the vehicular environment such as high mobility, diversity of applications, dynamic topologies, unreliable broadcast channels, and short-lived connectivity call into the need to extend the IP-based network to fulfill the user and VANETs requirements. Researchers are developing new network communication models to transfer the future internet. The information-centric networking (ICN) paradigm is a promising solution that may overcome the issues mentioned above. ICN involves a named content, name-based routing, in-network caching, and content-based security, which make it a suitable architecture for VANET applications. In this chapter, the authors present recent advances in VANET solutions that rely on named-data networking (NDN), which is the most active ICN implementation. The issues of the current host-centric model, mapping between NDN and VANET, is also discussed along with future research directions.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Caching Dynamic Data"

1

Hoeller, Nils. "Dynamic Approximative Data Caching in Wireless Sensor Networks." In 2010 Eleventh International Conference on Mobile Data Management. IEEE, 2010. http://dx.doi.org/10.1109/mdm.2010.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ogo, Kenta, Chikashi Matsuda, and Kazutoshi Nishimura. "Novel dynamic caching for hierarchically distributed video-on-demand systems." In Voice, Video, and Data Communications, edited by V. Michael Bove, Jr., Barbara Derryberry, Clifford R. Holliday, Louis S. Lome, Vishal Markandey, Andrew G. Tescher, and Bhaskaran Vasudev. SPIE, 1998. http://dx.doi.org/10.1117/12.300884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Challenger, J., A. Iyengar, and P. Dantzig. "A scalable system for consistently caching dynamic Web data." In IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320). IEEE, 1999. http://dx.doi.org/10.1109/infcom.1999.749295.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yu, Meiju, and Ru Li. "Dynamic Popularity-Based Caching Permission Strategy for Named Data Networking." In 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design (CSCWD). IEEE, 2018. http://dx.doi.org/10.1109/cscwd.2018.8465140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chatterjee, Subarna, and Sudip Misra. "Dynamic and adaptive data caching mechanism for virtualization within sensor-cloud." In 2014 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS). IEEE, 2014. http://dx.doi.org/10.1109/ants.2014.7057243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Mengge, Dapeng Li, Haitao Zhao, Xiaoming Wang, and Rui Jiang. "Multi-dimensional Data-driven Mobile Edge Caching with Dynamic User Preference." In 2020 International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2020. http://dx.doi.org/10.1109/wcsp49889.2020.9299786.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Soundararajan, G., and C. Amza. "Using semantic information to improve transparent query caching for dynamic content Web sites." In International Workshop on Data Engineering Issues in E-Commerce. IEEE, 2005. http://dx.doi.org/10.1109/deec.2005.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lai, Fan, Feng Qiu, Wenjie Bian, Ying Cui, and Edmund Yeh. "Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks." In ICN'16: 3rd International Conference on Information-Centric Networking. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2984356.2984377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sharma, K. M., and A. Raut. "Improving the performance of Mobile Adhoc networks using dynamic group data caching scheme." In 2013 Students Conference on Engineering and Systems (SCES). IEEE, 2013. http://dx.doi.org/10.1109/sces.2013.6547520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rao, Atul, Prashant Kumar, and Naveen Chauhan. "Energy efficient dynamic group caching in mobile Ad hoc networks for improving data accessibility." In 2012 International Conference on Recent Trends in Information Technology (ICRTIT). IEEE, 2012. http://dx.doi.org/10.1109/icrtit.2012.6206800.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Caching Dynamic Data' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography