Home › Entities › academia › Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters

Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters

Research article (2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW), 2016) · cited 20× · AI/ML
academia openalex:W2585919964
Press Enter · cited answer in seconds

Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters

Summary

Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters is a scholarly article[1].

Key Facts

  • Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters's instance of is recorded as scholarly article[2].

Related Entities

Erhard Rahm

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters. Retrieved May 24, 2026, from https://4ort.xyz/entity/scalable-privacy-preserving-linking-of-multiple-databases-using-counting-bloom-filters
MLA “Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/scalable-privacy-preserving-linking-of-multiple-databases-using-counting-bloom-filters.
BibTeX @misc{4ortxyz_scalable-privacy-preserving-linking-of-multiple-databases-using-counting-bloom-filters_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters}}, year = {2026}, url = {https://4ort.xyz/entity/scalable-privacy-preserving-linking-of-multiple-databases-using-counting-bloom-filters}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters — https://4ort.xyz/entity/scalable-privacy-preserving-linking-of-multiple-databases-using-counting-bloom-filters (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/scalable-privacy-preserving-linking-of-multiple-databases-using-counting-bloom-filters · Last refreshed: