1990/05/01 by James K. Mullin · 3 citations
Computer Science · #Caching and Content Delivery #Distributed systems and fault tolerance #Cloud Computing and Resource Management #Computer science #Bloom filter #Filter (signal processing) #Distributed database #Process (computing) #Distributed algorithm #Distributed computing #Database #Data mining #Algorithm #Programming language
paper · doi:10.1109/32.52778
openalex publication_date 1990/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
A Bloom-filter-based semijoin algorithm for distributed database systems is presented. This algorithm reduces communications costs to process a distributed natural join as much as possible with a filter approach. An optimal filter is developed in pieces. Filter information is used both to recognize when the semijoin will cease to be effective and to optimally process the semijoin. An ineffective semijoin will be quickly and cheaply recognized. An effective semijoin will use all of the transmitted bits optimally.>