Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A study of integrated prefetching and caching strategies
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Using predictive prefetching to improve World Wide Web latency
ACM SIGCOMM Computer Communication Review
Potential benefits of delta encoding and data compression for HTTP
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Link prediction and path analysis using Markov chains
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
The VLDB Journal — The International Journal on Very Large Data Bases
The case for geographical push-caching
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Cooperative Caching of Dynamic Content on a Distributed Web Server
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Efficient Query Result Retrieval over the Web
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
The measured access characteristics of world-wide-web client proxy caches
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Alleviating the latency and bandwidth problems in WWW browsing
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Optimistic deltas for WWW latency reduction
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
TileHeat: a framework for tile selection
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
A large data file in the internet such as a map is served in small pieces, called tiles. To improve the service speed for such data, we can prefetch future tiles while the current one is being displayed. Traditional prefetching techniques examine the transition probabilities among the tiles to predict the next tile to be requested. However, when the tile space is very huge, and a large portion of it is accessed with even distribution, it is very costly to monitor all those tiles. In this paper, we propose a technique that captures the regularity in the tile request pattern by using an NSMC (Neighbor Selection Markov Chain) and predicts future tile requests based on it. The required regularity to use our technique is that the next tile to be requested is dependent on previous k movements (or requests) in the tile space. Map shows such regularity in a sense. Electronic books show a strong such regularity. We show how to build an NSMC and measure its prediction capability through experimentations.