{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T18:40:31Z","timestamp":1791052831330,"version":"4.1.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[1982,9]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/358628.358632","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:34:59Z","timestamp":1027769699000},"page":"600-604","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Designing a Bloom filter for differential file access"],"prefix":"10.1145","volume":"25","author":[{"given":"Lee L.","family":"Gremillion","sequence":"first","affiliation":[{"name":"Indiana Univ., Bloomington"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[1982,9]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_2_2","first-page":"382","volume-title":"Computer Data Base Organization","author":"Martin J.","year":"1977"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/500080.500082"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/320473.320484"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/358628.358632","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/358628.358632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:32Z","timestamp":1750178252000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/358628.358632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":4,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["10.1145\/358628.358632"],"URL":"https:\/\/doi.org\/10.1145\/358628.358632","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]},"assertion":[{"value":"1982-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}