Maintenance of the pre-large trees for record deletion
From MaRDI portal
Publication:3407214
DOI10.1007/978-0-387-76483-2_12zbMATH Open1191.68247OpenAlexW2129896948MaRDI QIDQ3407214FDOQ3407214
Authors: Chun-Wei Lin, T. P. Hong, Wen-Hsiang Lu
Publication date: 3 March 2010
Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-76483-2_12
Recommendations
- Maintenance of fast updated frequent pattern trees for record deletion
- scientific article; zbMATH DE number 2101404
- Deleting to structured trees
- Deletion without rebalancing in multiway search trees
- Deletion without rebalancing in multiway search trees
- Deletion without rebalancing in binary search trees
- Deletion: The curse of the red-black tree
- scientific article; zbMATH DE number 1929257
- Deletion without rebalancing in balanced binary trees
Information storage and retrieval of data (68P20) Data structures (68P05) Nonnumerical algorithms (68W05) Database theory (68P15)
Cited In (3)
This page was built for publication: Maintenance of the pre-large trees for record deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3407214)