Add to ORKG"December 1981"Bibliography: leaf [1]"Contract ONR/N00014-77-C-0532"Kuan-Tsae Huang, Wilbur B. Davenport, Jr
AbstractIt is proposed that the execution of a chain query in a distributed system can be usefully a...
It is proposed that the execution of a chain query in a distributed system can be usefully and appro...
[[abstract]]The properties of optimal semi-join programs for processing distributed tree queries are...
We develop a mathematical model to compute the minimum communication cost of a join-semijoin program...
for p,"! CIIE~ibLtj~f it~U L i~diiid We develop a mathematical model to compute the minimum com...
The utilizing of semi-join is often a common starting point for join algorithms in distributed datab...
This research is concerned with a model and a method of minimizing the inter-site data traffic incur...
The cost-effective reduction of relations by semijoins is the basis of the heuristic approach to dis...
A new approach to distributed query processing is proposed. In the conventional approach, a query is...
This research is concerned with a model and a method of minimizing the inter-site data traffic incur...
This paper addresses the processing of a query in distributed database systems using a sequence of s...
The problem of optimal query processing in distributed database systems was shown to be NP-hard. Thi...
[[abstract]]The problem of optimal query processing in distributed database systems was shown to be ...
AbstractIn this paper the problem of finding an optimum strategy of semi joins for solving tree quer...
AbstractIt is proposed that an optimal strategy for executing a join query in a distributed database...
AbstractIt is proposed that the execution of a chain query in a distributed system can be usefully a...
It is proposed that the execution of a chain query in a distributed system can be usefully and appro...
[[abstract]]The properties of optimal semi-join programs for processing distributed tree queries are...
We develop a mathematical model to compute the minimum communication cost of a join-semijoin program...
for p,"! CIIE~ibLtj~f it~U L i~diiid We develop a mathematical model to compute the minimum com...
The utilizing of semi-join is often a common starting point for join algorithms in distributed datab...
This research is concerned with a model and a method of minimizing the inter-site data traffic incur...
The cost-effective reduction of relations by semijoins is the basis of the heuristic approach to dis...
A new approach to distributed query processing is proposed. In the conventional approach, a query is...
This research is concerned with a model and a method of minimizing the inter-site data traffic incur...
This paper addresses the processing of a query in distributed database systems using a sequence of s...
The problem of optimal query processing in distributed database systems was shown to be NP-hard. Thi...
[[abstract]]The problem of optimal query processing in distributed database systems was shown to be ...
AbstractIn this paper the problem of finding an optimum strategy of semi joins for solving tree quer...
AbstractIt is proposed that an optimal strategy for executing a join query in a distributed database...
AbstractIt is proposed that the execution of a chain query in a distributed system can be usefully a...
It is proposed that the execution of a chain query in a distributed system can be usefully and appro...
[[abstract]]The properties of optimal semi-join programs for processing distributed tree queries are...