Data management for mobile computing
ACM SIGMOD Record
Efficient and flexible location management techniques for wireless communication systems
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
A mobile transaction model that captures both the data and movement behavior
Mobile Networks and Applications
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
IEEE Transactions on Knowledge and Data Engineering
Exploiting the Features of Asymmetry for Query Processing in a Mobile Computing Environment
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
Maintaining consistency of data in mobile distributed environments
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Database Systems Concepts
| Hi-index | 0.00 |
A centralized collaborative system between nodes and Base Stations (BSs) is developed, and a new data replication scheme based on group and query prediction mobility scheme with Data Mining techniques is proposed. Utilizing the group mobility with the properties of data objects this new scheme (in various sites) minimizes the cost of remote access and improves the response time of the queries. A series of algorithms is developed so that the system can provide the "prefetch" operation for the group of users according to their mobility and their shared data have to wait for them in their next appropriate cell. The data have to follow the user moves. Our new approach contains a prediction scheme for Group and Query Mobility (GQM) based on two phases the Merge Itemset Algorithm (MIA) and the Dynamic Replication Scheme with three Criteria (DRS3C) respectively. After the data reservation operation by site, the DRS3C can guarantee the acceleration of the query execution. DRS3C works in cooperation with MIA and Connection Admission Control (CAC) in order to minimize the network messages, and the response time. It can also be used in the design of any new architecture for distributed query processing. Simulation results are provided.