Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
File structure design to facilitate on-line instantaneous updating
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
Practical performance of Bloom filters and parallel free-text searching
Communications of the ACM
Performance analysis in a differential file environment
WSC '85 Proceedings of the 17th conference on Winter simulation
Communications of the ACM
A second look at bloom filters
Communications of the ACM
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
Management and display of data analysis environments for large data sets
SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
On the false-positive rate of Bloom filters
Information Processing Letters
Bloomier Filters: A Second Look
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An Optimal Bloom Filter Replacement Based on Matrix Solving
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Improving retouched Bloom filter for trading off selected false positives against false negatives
Computer Networks: The International Journal of Computer and Telecommunications Networking
"Better than nothing" privacy with bloom filters: to what extent?
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Time- and space-efficient flow-sensitive points-to analysis
ACM Transactions on Architecture and Code Optimization (TACO)
Survey Bloom filter applications in network security: A state-of-the-art survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 48.27 |
The use of a differential file for a database update can yield integrity and performance benefits, but it can also present problems in providing current data to subsequent accessing transactions. A mechanism known as a Bloom filter can solve these problems by preventing most unnecessary searches of the differential file. Here, the design process for a Bloom filter for an on-line student database is described, and it is shown that a very effective filter can be constructed with a modest expenditure of system resources.