Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Performance tradeoffs for client-server query processing
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
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
Minimal Cost Replication of Dynamic Web Contents under Flat Update Delivery
IEEE Transactions on Parallel and Distributed Systems
Database Systems Concepts
Guest Editors' Introduction: Autonomic Computing
IEEE Internet Computing
| Hi-index | 0.00 |
The problem of server performance in a contemporary, rapidly developed and multi-discipline environment is examined. The administration of the data sources or repositories during the execution of the query plan becomes primary interest especially for starting the query server. A collaborative system between nodes, Base Stations (BSs) and servers is developed and. a new query processing method, based on group and query prediction mobility (GQM) with Data Mining techniques is proposed. Our new approach for GQM with the Merge Itemset Algorithm (MIA) can guarantee the "prefetch" operation for the users so that their data will have already been waiting for them in their next appropriate cell. Moreover, new metrics for external queries (queries not completed in the starting servers) estimate the dependency among servers. Finally the server decides for the query decomposition plan including replication schemes, for a group of users so that the data be sent directly to their last cell; diminishing their dependency on communications and seeking additional resources. This new integrated approach can contribute a lot to the server's independent or semi autonomous work. Simulation results are provided.