In this paper we describe a set of algorithms that can be used to reduce the complexity of evaluating multiple queries of a transaction in a distributed environment. With the consideration of conjunct sharing, it compiles a set of queries into a network based on the concept of semi-joins. As some of the queries in a transaction may change the contents of a database, evaluation of the network corresponding to the transaction is synchronized into several phases so that the dependencies among the queries can be properly captured.
['A.Y. Lu', 'Phillip C.-Y. Sheu']
Processing of Multiple Queries in Distributed Databases