Abstract
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. © 1982, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Gremillion, L. L. (1982). Designing a Bloom Filter for Differential File Access. Communications of the ACM, 25(9), 600–604. https://doi.org/10.1145/358628.358632
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.