Suffix Search Indexing via Reverse-Term Secondary Structure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Suffix searches in alphabetically sorted indices are time-consuming due to the need for reverse string comparisons across large numbers of terms, significantly increasing processing time and user wait times for query results.
Innovation Solution
A system that creates a secondary index with reverse-ordered terms from the primary index, allowing suffix queries to be processed efficiently by reversing the suffix and searching the secondary index, then reversing and using the found terms to search the primary index, thereby reducing processing time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If suffix searches are performed on alphabetically sorted indices using reverse string comparisons, then complete search coverage is achieved, but processing time increases significantly
Solution Approach 1:
The patent pre-processes the index by creating a secondary index structure during document indexing. Reverse-ordered terms are generated and stored in advance, so when a suffix search is performed, the system can directly query the pre-organized secondary index without performing time-consuming reverse string comparisons on the primary index at query time.
Solution Approach 2:
The patent introduces a secondary index as an intermediary data structure between the primary index and the suffix search query. This secondary index contains reverse-ordered terms that act as a mediator, translating the suffix search requirement into efficient prefix-like searches on the inverted terms, thereby resolving the time complexity issue while maintaining search completeness.
2Productivity
If a secondary index with reverse-ordered terms is created, then suffix search efficiency is improved, but device complexity increases
Solution Approach 1:
The patent segments the indexing and search process into distinct components: the primary index maintains the original term order for general searches, while the secondary index handles suffix-specific searches with reverse-ordered terms. This segmentation allows each index to be optimized for its specific purpose without compromising the other, managing complexity through functional separation.
Solution Approach 2:
The secondary index structure, while specialized for suffix searches, can be integrated into the existing dual-index architecture without preventing general prefix searches on the primary index. The system maintains universality by allowing both prefix and suffix search operations to coexist, with each operation routing to the appropriate index structure.
Data Source
AI summary
Embodiments of a system for searching text indices for suffixes are disclosed. Embodiments may include a suffix searching module at a computer configured to receive a query and identify the query as a suffix query, extract a suffix from an identified suffix query and reverse an order of characters in the suffix, and search a secondary index for terms corresponding to the reverse-ordered suffix, the secondary index comprising one or more lists of reverse-ordered terms from a primary index; a search reconfiguration module operably coupled to the suffix searching module and configured to receive from the suffix searching module found terms corresponding to the reverse-ordered suffix and reverse an order of the characters of the found terms; and a search module configured to implement a search of a primary index using reverse-ordered found terms received from the search reconfiguration module.