Query optimization on local area networks
ACM Transactions on Information Systems (TOIS)
Composite semijoins in distributed query processing
Information Sciences: an International Journal
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Optimal semijoin schedules for query processing in local distributed database systems
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
The File-Assignment and Query-Processing Problems in Local Multiaccess Networks
Proceedings of the First International Conference on Data Engineering
Distributed Query Evaluation in Local Area Networks
Proceedings of the First International Conference on Data Engineering
Join processing in relational databases
ACM Computing Surveys (CSUR)
On the Complexity of Distributed Query Optimization
IEEE Transactions on Knowledge and Data Engineering
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
Distributed query-processing algorithms for broadcast local-area networks are described which provide execution strategies and estimates of response time. Four semijoin-specific techniques, five transmission-specific techniques, and three size estimation update functions are incorporated into a baseline algorithm. These variants of the baseline algorithm are simulated and their response times compared using randomly generated data. The technique found to be most beneficial, on the average, for general queries involving multiple joining attributes is the composite semijoining technique. When used in combination with composite semijoining, relation transmission and bit-matrix transmission further reduce response time. Bit-matrix transmission is a data compression technique in which single attributes and a bit matrix of the value pairings are sent in place of a composite attribute. The authors examine these techniques in detail and compare their expected response times.