Numerical value and text mixed inverted index algorithm based on multilayer-optimization balanced tree
An inverted index, balanced tree technology, applied in the field of indexing algorithms, can solve problems such as low performance, inability to compare numerical ranges and accurate comparisons
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] This section describes the specific implementation steps of the numerical and text hybrid inverted index algorithm based on multi-level optimized balanced trees.
[0037] 1. Index construction steps
[0038] (1). Creation of layer 0 nodes
[0039] a. For each pair in document set N, sort by value, let V be the set of all unique values
[0040] b. Divide the list sorted in step a into b blocks, each of length N / b. Store the minimum value (first value) and maximum value (last value) of each block into the array T min and T max .
[0041] c. Create an inverted list for each block, sorted by document number. Satisfy: for 1<=i<j<=b, all values in block i are not greater than all values in block j.
[0042] The creation performance of the 0th layer node depends on step a, the time complexity is: O(NlogN), and the space complexity is: O(N).
[0043] (2).Creation of additional layers
[0044] a. For each pair of in document set N, sort by document number and put i...
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