Search Indexing for Nested Markup Tag Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing full-text search technologies fail to effectively handle nested structures of tags in markup languages, leading to incorrect search results as they cannot utilize the attributes of tags with inclusive relationships as search control conditions.
Innovation Solution
A system that reads character information and identifiers in a text file, determines if character information is between pairs of identifiers, and associates it with those identifiers, enabling the use of both higher-level and lower-level tags as search conditions by updating state information and generating a full-text search index that reflects the inclusive relationships between tags.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If files are divided with tags serving as boundaries in markup languages, then full-text search index can be created for data units, but nested structures of tags cannot be handled and inclusive relationships between tags are lost
Solution Approach 1:
The patent applies nesting by creating a hierarchical index structure where higher-level tags contain references to lower-level tags. The index stores nested relationships by recording that data units within a lower-level tag are also within the scope of higher-level tags, enabling the index to represent nested tag structures like <div><p>text</p></div> where both div and p tags are preserved in the search index.
Solution Approach 2:
The patent adds a hierarchical dimension to the traditional flat full-text search index. Instead of only indexing character positions, the index now includes tag hierarchy information, creating a multi-dimensional index structure that tracks both character positions and their associated tag contexts at multiple levels of nesting.
2Adaptability or versatility
If only flat tag boundaries are used for dividing data units, then indexing is simple, but attributes of tags with inclusive relationships cannot be utilized as search control conditions
Solution Approach 1:
The patent performs preliminary action by pre-processing markup files during index generation to identify and record all nested tag relationships before search operations. The index is built with pre-computed hierarchical information including parent-child tag relationships, allowing search operations to directly utilize tag attributes without complex runtime analysis.
Solution Approach 2:
The patent introduces an intermediary hierarchical index structure that mediates between the raw markup files and search queries. This intermediate index captures tag nesting relationships and attributes, serving as a bridge that enables sophisticated search control while keeping the search operation itself relatively simple by pre-processing the complex hierarchical information.
3Productivity
If character information is indexed without considering tag nesting, then indexing process is fast, but search results include irrelevant files that do not actually contain the search term within the expected tag context
Solution Approach 1:
The patent applies segmentation by dividing the indexing process into distinct phases: first indexing character information at the flat level for speed, then separately processing and layering tag hierarchy information. This segmented approach allows the basic full-text indexing to proceed efficiently while adding hierarchical validation in a subsequent pass, maintaining both speed and accuracy.
Data Source
AI summary
A system includes circuitry configured to: read a plurality of character information and a plurality of identifiers that are included in a text file; determine whether a character information among the plurality of character information is included between the at least one pair of identifiers among the plurality of identifiers in the text file; and associate the character information with the at least one pair of identifiers when it is determined that the character information is included between the at least one pair of identifiers.


