Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A methodology for interpreting tree queries into optimal semi-join expressions
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
The optimization of query processing on distributed database systems
The optimization of query processing on distributed database systems
Query optimization on local area networks
ACM Transactions on Information Systems (TOIS)
ACM Computing Surveys (CSUR)
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Algorithms for Distributed Query Processing in Broadcast Local Area Networks
IEEE Transactions on Knowledge and Data Engineering
An Intelligent Search Method for Query Optimization by Semijoins
IEEE Transactions on Knowledge and Data Engineering
Processing Queries Over Generalization Hierarchies in a Multidatabase System
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Simulation of a distributed query processing algorithm on token ring networks
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Semijoin strategies are a technique for query processing in distributed database systems. In the past, methodologies for constructing minimum communication-cost strategies for solving tree queries have been developed. These assume point-to-point communication and ignore local processing costs and the limited communication capacity of the system. In this paper, query processing in bus or loop systems is considered. The definition of strategy is extended to allow for broadcast mode of communication. We then address the problem of finding the minimum response-time schedule for executing a given strategy in an m-bus system taking into account local processing and system capacity. It is shown that the problem is computationally intractable for general tree queries, even in a 1-bus system, and for special classes of tree queries in an m-bus system. However, there is a polynomial-time algorithm for simple queries in a 1-bus system.