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

DOI10.1016/0020-0190(81)90034-XMaRDI QIDQ1154274zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(1)

• Optimal binary search trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154274)