Hierarchical Bloom Filter Trees for Approximate Matching

David Lillis, Frank Breitinger, Mark Scanlon

Open source

DOI: 10.15394/jdfsl.2018.1489
Published: 2018
Container: The Journal of Digital Forensics, Security and Law
Publisher: ERAU Hunt Library - DIGITAL COMMONS JOURNALS
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.15394/jdfsl.2018.1489,
  title = {Hierarchical Bloom Filter Trees for Approximate Matching},
  author = {David Lillis and Frank Breitinger and Mark Scanlon},
  year = {2018},
  journal = {The Journal of Digital Forensics, Security and Law},
  doi = {10.15394/jdfsl.2018.1489},
  url = {https://doi.org/10.15394/jdfsl.2018.1489}
}

RIS

TY  - JOUR
TI  - Hierarchical Bloom Filter Trees for Approximate Matching
AU  - David Lillis
AU  - Frank Breitinger
AU  - Mark Scanlon
PY  - 2018
JO  - The Journal of Digital Forensics, Security and Law
DO  - 10.15394/jdfsl.2018.1489
UR  - https://doi.org/10.15394/jdfsl.2018.1489
ER  -

APA

Lillis, D., Breitinger, F., & Scanlon, M. (2018). Hierarchical Bloom Filter Trees for Approximate Matching. The Journal of Digital Forensics, Security and Law. https://doi.org/10.15394/jdfsl.2018.1489

Source records

crossref · retrieved 2026-09-24T21:01:54.091Z