Efficient search algorithm on compact S-trees

DOI10.1016/S0167-8655(97)00074-3MaRDI QIDQ4216183zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 11 January 1999

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(97)00074-3

zbMATH Keywords

digital binary imagesspatial data structure

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Compact searchable static binary trees
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• An Approximation Algorithm for Binary Searching in Trees
• An approximation algorithm for binary searching in trees
• Fast searching in trees
• Efficient multiway radix search trees
• Optimal Search in Trees
• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
• Optimal search trees using two-way key comparisons

Cited in

(7)

• Efficient multiway radix search trees
• A modified binary-tree search architecture for two-dimensional stack filtering
• An efficient spatial access method for spatial images containing multiple non-overlapping features
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• Improved search heuristics for the sa-tree
• The empty bin: A data structure for spatial search of time‐varying data
• Space efficient algorithms for ordered tree comparison

This page was built for publication: Efficient search algorithm on compact S-trees

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