Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Optimizing Large Join Queries in Mediation Systems
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Decision support in a distributed environment
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
HIPaG: An energy-efficient in-network join for distributed condition tables in sensor networks
Journal of Systems and Software
Distributed complex event processing with query rewriting
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.00 |
In this paper we report on query processing experiments that were performed in one distributed data base environment. In this environment we compared the strategy produced by a collection of algorithms on the basis of number of bytes moved. Among other conclusions we found that limited search algorithms do not perform very well compared to algorithms which exhaust all possible processing plans.