Designing a Bloom filter for differential file access
暂无分享,去创建一个
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.
[1] Robert L. Rappaport. File structure design to facilitate on-line instantaneous updating , 1975, SIGMOD '75.
[2] James Martin,et al. Computer Data-Base Organization , 1975 .
[3] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[4] Guy M. Lohman,et al. Differential files: their application to the maintenance of large databases , 1976, TODS.