Optimal Semijoins for Distributed Database Systems

IEEE Transactions on Software Engineering

Volumn 16, Issue 5, 1990, Pages 558-560

  Mullin, James K ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Bloom filter; distributed database; distributed systems; natural join; semijoin

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; COMPUTER SOFTWARE--APPLICATIONS;

SEMIJOIN ALGORITHMS;

DATABASE SYSTEMS;

EID: 0025432881     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.52778     Document Type: Article

References (10)

1. R. Bayer and K. Unterauer, “Prefix B-trees,” ACM Database Syst., vol. 2, no. 1, pp. 11–26, Mar. 1977.
2. P. A. Bernstein et al., “Query processing in a system for distributed databases (SDD-1),” ACM Trans. Database Syst., vol. 6, no. 4, pp. 602–625, Dec. 1981.
3. P. A. Bernstein and D. M. Chiu, “Using semijoins to solve relational queries,” J. ACM, vol. 28, no. 1, pp. 25–40, Jan. 1981.
4. B. H. Bloom, “Space/time tradeoffs in hash coding with allowable errors,” Commun. ACM, vol. 13, no. 7, pp. 422–426, July 1970.
5. K. Bratbergsengen, “Hashing methods and relational algebra operations,” in Proc. 10th Int. Conf. Very Large Data Bases, Singapore, 1984, pp. 323–333.
6. D. A. Huffman, “A method for the construction of minimum redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, 1952.
7. L. F. Mackert and G. M. Lohman, “R* optimizer validation and performance evaluation for distributed queries,” in Proc. 12th Int. Conf. Very Large Data Bases, Kyoto, Japan, 1986, pp. 149–159.
8. J. K. Mullin, “A second look at Bloom filters,” Commun. ACM, vol. 26, no. 8, pp. 570–571, Aug. 1983.
9. D. G. Severance and G. M. Lohman, “Differential files: Their application to the maintenance of large databases,” ACM Trans. Database Syst., vol. 3, no. 3, pp. 256–267, Sept. 1976.
10. C. T. Yu and C. C. Chang, “On the design of a query processing strategy in a distributed database environment,” ACMSIGMOD Rec., vol. 13. no. 4, pp. 30–39, May 1983.