A Method for Equijoin Queries in Distributed Relational Databases
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Algorithms to Process Distributed Queries in Fast Local Networks
IEEE Transactions on Computers
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Allocation of Operations in Distributed Database Access
IEEE Transactions on Computers
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
IEEE Transactions on Computers
Optimal Query Processing for Distributed Database Systems
IEEE Transactions on Computers
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
IEEE Transactions on Computers
DIALOG: a distributed processor organization for database machine
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Cost based in-network join strategy in tree routing sensor networks
Information Sciences: an International Journal
Efficient data distribution strategy for join query processing in the cloud
Proceedings of the third international workshop on Cloud data management
Truly adaptive optimization: the basic ideas
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Generating query plans for distributed query processing using genetic algorithm
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Database placement in communication networks for minimizing the overall transmission cost
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.02 |
Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed.