Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching

DOI10.1093/COMJNL/29.1.52MaRDI QIDQ3714491zbMATH OpenOpenAlexFDO

Authors Francis Suraweera

Publication date 1986

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/29.1.52

zbMATH Keywords

algorithmdynamic data structurefile maintenancestatic data structureupdating a data file

Mathematics Subject Classification ID

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

Recommendations

• Optimal search trees using two-way key comparisons
• DYNAMIC OPTIMAL BINARY SEARCH TREE
• Self-Organizing Heuristics for Implicit Data Structures
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Self-adjusting binary search trees

Cited in

(1)

• Numerical database system based on a weighted search tree

This page was built for publication: Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching

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