MindMap Gallery Data structure search algorithm
Some commonly used data structure search algorithms include b-tree, b-tree, etc. Search is the process of finding data elements that meet certain conditions in a data set. I hope this picture will be helpful to you.
Edited at 2023-09-18 01:39:07Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Find
Basic concepts of search
The process of finding data elements that meet certain conditions in a data collection
average search length
n is the number of elements in the lookup table Pi is the probability of finding the i-th element. It is usually assumed that each element has the same search probability, Pi=1/n Ci is the number of comparisons to find the i-th element.
sequential search method
Sequential search of general linear tables
Sequential search in ordered list
half search method
Ordered sequence list (array)
block search method
An improved method of binary search and sequential search The index table is required to be ordered, and there is no ordering requirement for nodes within the block.
1. Select the largest keyword in each block to form an index table 2. ① First perform a half search or sequential search on the index table to determine in which block the record to be searched is located. ② Use the sequential method to search in the determined blocks
B-tree and its basic operations
B-tree (multi-way balanced search tree)
Order of B-tree (m): the maximum number of child nodes of all nodes in B-tree
m-order B-tree
Each node in the tree has at most m subtrees (that is, it contains at most m-1 keywords)
If the root node is not a terminal node, there are at least two subtrees
All non-leaf nodes except the root node contain at least ⌈m/2⌉ subtrees (i.e. contain at least ⌈m/2⌉-1 keywords)
All leaf nodes appear at the same level without any information
B tree height
n keywords, height h, order m
B-tree search
Insertion into B-tree
1. Positioning
2. Insert
Deletion of B-tree
terminal node
non-terminal node
Basic concepts of B-trees
A B-tree of order m must meet the following conditions: 1) Each branch node has at most m subtrees (child nodes). 2) The non-leaf root node has at least two sub-trees, and each other branch node has at least one sub-tree. 3) The number of subtrees of a node is equal to the number of keywords. 4) All leaf nodes contain all keywords and pointers to corresponding records. The keywords are arranged in the leaf nodes in order of size, and adjacent leaf nodes are linked to each other in order of size. 5) All branch nodes only contain the maximum value of the keywords in each of its sub-nodes and pointers to its sub-nodes.
Compare B-tree and B-tree
hash table
basic concept
The hash table establishes a direct mapping relationship between keywords and storage addresses. The function that maps keywords to their corresponding addresses is called a hash function.
conflict
A hash function maps two or more different keys to the same address
aggregation (accumulation)
Non-synonyms compete for an address
Construction method
direct addressing method
division leaving remainder method
digital analytics
Square-Medium Method
Take the middle digits of the squared value of the keyword as the hash address
folding method
How to handle conflicts
open addressing method
prone to aggregation
method
Linear detection method
square detection method
rehashing
pseudorandom sequence method
Zipper method (chaining)
Suitable for frequent deletions and insertions
Place conflicting values in a linear linked list
No aggregation will occur
Hash lookup and performance analysis
filling factor
Filling factor = number of records in the table n/hash table length m
String pattern matching
string definition
A finite sequence of zero or more characters
string storage structure
Constant sequential storage representation
Heap allocated storage representation
Blockchain storage representation
Basic string operations
string pattern matching
KMP