An algorithm for tree-query membership of a distributed query

@inproceedings{Yu1979AnAF,
  title={An algorithm for tree-query membership of a distributed query},
  author={C. T. Yu and M. Z. Ozsoyoglu},
  booktitle={COMPSAC},
  year={1979}
}
The aim is to process distributed queries efficiently. The cost of communications between sites is dominant in processing such queries. It is assumed that the amount of data transferred determines the transmission cost to a large extent. Thus, it is desirable to minimize the amount of transmitted data. Bernstein .and Chiu [2] classified queries into two types: tree and cyclic queries. They defined an operation called semi-join which requires minimal transfer of data between sites. Then they… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Full reducers for relational queries using multi-altitude semi-joins", Centre for Research in Computing Technology,IIarvard

P. Bernstein, N. Goodman
1979

Using semijoins to solve relational queries

P. A. Bernstein, Chiu, W D-M.
Technical report no. CCA-79-01, • 1979

Similar Papers

Loading similar papers…