Method for storing and searching character strings in hash table
A string and hash table technology, applied in the field of hash tables, can solve the problems of low development cost, high development cost, slow data processing, etc., to reduce delay and jitter, improve string search performance, and improve query efficiency.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0037] see Figure 1 to Figure 5 , the present invention provides a kind of technical scheme: a kind of hash table realizes the method of character string storage and search, the method that hash table realizes character string storage and search comprises the following operation steps:
[0038] S1, the collision sequence of strings:
[0039] Determine the length of the hash table according to the number of strings, denoted as Len, calculate the hash value A of the string str, and then perform the modulo operation on A to obtain the position pos in the hash table;
[0040] Among them, Hash(str)=>A; A mode Len=>pos;
[0041] The longest string is 16Byte;
[0042] S2, collision sequence statistics:
[0043] Since different strings str have a chance to get the same position value pos, that is, different strings conflict, so this conflict needs to be resolved;
[0044] Remember that the first time the pos value is obtained, its collision order is 1; the second time the pos val...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com