Optimal choice of discriminators in a balanced K-D binary search tree

DOI10.1016/0020-0190(81)90034-XzbMath0464.68062OpenAlexW2083113666MaRDI QIDQ1154274

Ysmar V. Silva Filho

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90034-x

zbMATH Keywords

partial-match search

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

Optimal binary search trees

Cites Work

• Optimal partial-match retrieval
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Multidimensional Binary Search Trees in Database Applications
• On nonlinear optimization in integers

This page was built for publication: Optimal choice of discriminators in a balanced K-D binary search tree