Papers › The Cascading Metric Tree
The Cascading Metric Tree
Jeffrey Uhlmann, Miguel R. Zuniga
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper presents the Cascaded Metric Tree (CMT) for efficient satisfaction of metric search queries over a dataset of N objects. It provides extra information that permits query algorithms to exploit all distance calculations performed along each path in the tree for pruning purposes. In addition to improving standard metric range (ball) query algorithms, we present a new algorithm for exploiting the CMT cascaded information to achieve near-optimal performance for k-nearest neighbor (kNN) queries. We demonstrate the performance advantage of CMT over classical metric search structures on synthetic datasets of up to 10 million objects and on the 564K Swiss-Prot protein sequence dataset containing over $200$ million amino acids. As a supplement to the paper, we provide reference implementations of the empirically-examined algorithms to encourage improvements and further applications of CMT to practical scientific and engineering problems
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections