Maintenance of the pre-large trees for record deletion

DOI10.1007/978-0-387-76483-2_12MaRDI QIDQ3407214zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

data miningFP-treepre-large itemsetspre-large-tree algorithmrecord deletion

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Nonnumerical algorithms (68W05) Database theory (68P15)

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

Cited in

(3)

• Maintenance of fast updated frequent pattern trees for record deletion
• Using the structure of prelarge trees to incrementally mine frequent itemsets
• scientific article; zbMATH DE number 2101404 (Why is no real title available?)

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)