Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
A second look at bloom filters
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
R* Optimizer Validation and Performance Evaluation for Distributed Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Fragmenting Relations Horizontally Using a Knowledge-Based Approach
IEEE Transactions on Software Engineering
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
PERF join: an alternative to two-way semijoin and bloomjoin
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
IEEE Transactions on Computers
Combining Joint and Semi-Join Operations for Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Discussion paper: privacy-preserving distributed queries for a clinical case research network
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
Dynamically maintaining frequent items over a data stream
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Efficient query evaluation using a two-level retrieval process
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Distributed Evaluation of Network Directory Queries
IEEE Transactions on Knowledge and Data Engineering
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bloom Filter-Based XML Packets Filtering for Millions of Path Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Approximate encoding for direct access and query processing over compressed bitmaps
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Supporting ad-hoc resource sharing on the Web: A peer-to-peer approach to hypermedia link services
ACM Transactions on Internet Technology (TOIT)
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Preserving privacy in association rule mining with bloom filters
Journal of Intelligent Information Systems
Optimizing data popularity conscious bloom filters
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient flow-aware dynamic link load balancing
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Information Sciences: an International Journal
Cardinality estimation and dynamic length adaptation for Bloom filters
Distributed and Parallel Databases
Don't thrash: how to cache your hash on flash
HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
COCA filters: co-occurrence aware bloom filters
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Performance-oriented privacy-preserving data integration
DILS'05 Proceedings of the Second international conference on Data Integration in the Life Sciences
L-priorities bloom filter: A new member of the bloom filter family
International Journal of Automation and Computing
International Journal of Bio-Inspired Computation
Don't thrash: how to cache your hash on flash
Proceedings of the VLDB Endowment
Trust-aware query routing in P2P social networks
International Journal of Communication Systems
Space-efficient structures for detecting port scans
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
A novel approach for leveraging co-occurrence to improve the false positive error in signature files
Journal of Discrete Algorithms
Bloofi: a hierarchical Bloom filter index with applications to distributed data provenance
Proceedings of the 2nd International Workshop on Cloud Intelligence
Toward intersection filter-based optimization for joins in MapReduce
Proceedings of the 2nd International Workshop on Cloud Intelligence
Survey Bloom filter applications in network security: A state-of-the-art survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Future Generation Computer Systems
Optimized hash for network path encoding with minimized false positives
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
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.