Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A scalable low-latency cache invalidation strategy for mobile environments
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Process Modelling for Online Communications in Tendering Processes
EUROMICRO '03 Proceedings of the 29th Conference on EUROMICRO
Hi-index | 0.00 |
With the development of wireless communication technology, mobile business become more and more popular. Using GPRS or WAP protocals, the wireless devices can connect to the Web servers, retrieve information from the online databases and run special application programs. Because of the limitation of the wireless communication and mobile computing enviroment, it is difficult to improve the execution efficiency for the program that located in mobile devices. To solve the problem, introducing the cache mechanism is the major and effective method. But the traditional cache model can not achieve an acceptable cache hit ratio. The semantic caching is particularlly attractive in a mobile business environment, due to its content-based reasoning ability and semantic locality. In semantic-driven cache model, only the required data is transmitted to wireless device. In this paper we propose an application-oriented semantic cache model. It establishes an semantic associated rule-base according to the knowledge of application domains, makes use of the semantic locality for data prefetching, and adopts a Two-level LRU algorithm for cache replacement. Several experiments demonstrate that the semantic-driven cache model can achieve higher hit ratio than traditional models.