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
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Location dependent query processing
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Application-aware adaptation for mobile computing
EW 6 Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
Process Modelling for Online Communications in Tendering Processes
EUROMICRO '03 Proceedings of the 29th Conference on EUROMICRO
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Hi-index | 0.00 |
Restricted by wireless communication technology and mobile computing environment, it is difficult to improve the efficiency of the programs that resided in mobile end. To solve this problem, the cache mechanism is a major and effective method. In this paper, we propose an application-oriented semantic cache model. It establishes a semantic-associated rules base according to the knowledge of application domains, makes use of the semantic locality for data pre-fetching, 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 cache models.