Some Approaches to Best-Match File Searching

Burkhard, W. A., & Keller, R. M. (1973). Some Approaches to Best-Match File Searching. ACM, 16(4), 230-236.

Type

Journal article

Intellectual base

Primary research

Year

1973

DOI

10.1145/362003.362025

Link

https://doi.org/10.1145/362003.362025

Cited by

1 citation across 1 artifact.

Domain-specific

• BK-tree
  • A BK-tree is a rooted metric index in which a node containing pivot (p) has at most one child edge labeled by each distance value (k), and every object in that child's subtree was routed by recursive comparisons beginning with (d(p,x)=k).

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a0892e8147cd · see in the full table