Ad Index Pre-filtering for Search Query Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current online marketing systems are inefficient in quickly and effectively matching user search queries with relevant advertisements due to the need to sort through a large number of entries, leading to high costs and resource intensity.
Innovation Solution
A delivery system that includes a keyword server for parsing search queries, an index server for pre-filtering using an inverted index and metadata, and a listing server for further filtering, which sorts and presents relevant advertisements by using linguistic locale IDs and pre-filtering techniques like phrase length and word hash filtering.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the delivery engine sorts through a large number of advertisement entries to locate appropriate matches, then the matching accuracy is improved, but the processing time and computational cost increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-processing advertisement entries into an inverted index structure before the actual search query arrives. The index is built in advance with advertisement phrases, their components, and associated metadata organized for rapid access. This allows the delivery engine to skip the time-consuming task of sorting through all advertisements during query processing, instead directly querying the pre-organized index for relevant matches.
Solution Approach 2:
The patent segments the advertisement database into an inverted index structure that divides advertisements into component phrases and words. Each advertisement is broken down into its constituent phrases, which are further segmented into individual words, creating a hierarchical organization. This segmentation allows the system to quickly filter and match queries against specific components rather than examining entire advertisements sequentially.
2Reliability
If the delivery engine examines all advertisement entries to ensure comprehensive matching, then the reliability of ad selection is improved, but the computational resources and processing cost increase
Solution Approach 1:
The patent extracts and separates the indexing function from the query processing function. The inverted index is extracted as a standalone pre-computed structure that contains only the essential matching information (phrases, words, and their positions in advertisements). This extraction allows the query processing to focus solely on pattern matching against the index without re-processing the entire advertisement database, significantly reducing computational resources while maintaining reliable matching.
Solution Approach 2:
The system performs preliminary indexing action by pre-processing all advertisements into the inverted index structure before any queries are processed. This preliminary action includes parsing advertisements into phrases, extracting individual words, and organizing them in the index with their corresponding advertisement identifiers. When a query arrives, the system only needs to perform lightweight matching operations on the pre-processed index rather than examining all original advertisements.
3Measurement precision
If the system uses detailed filtering criteria to precisely match user queries with advertisements, then the relevance of displayed ads is improved, but the complexity of the matching process increases
Solution Approach 1:
The patent segments the matching process into distinct stages: first matching against the inverted index using simple phrase and word comparisons, then applying additional filtering criteria only to the subset of advertisements that pass the initial index match. This segmentation of the matching process allows detailed filtering criteria to be applied efficiently to a reduced set of candidates rather than to all advertisements, maintaining precision while reducing overall complexity.
Solution Approach 2:
The system performs preliminary filtering through the inverted index match before applying more complex filtering criteria. The index matching stage quickly eliminates advertisements that do not contain the query phrases or words, creating a reduced candidate set. Only this smaller subset then undergoes the more complex detailed filtering, which significantly reduces the computational burden of applying precise matching criteria while maintaining high relevance.
Data Source
AI summary
A method and system are provided for selecting advertisements for presentation to a user in response to a user search query. The system may include a keyword server for parsing the user search query and an index server for receiving the parsed search query. The index server may include an index of advertising phrases and pre-filtering components for comparing index entries to the parsed user search query in order to discard non-matching index entries and locate matching entries. The pre-filtering components may include either a phrase length pre-filtering component or a word hash pre-filtering component. The system may additionally include a listing server for sorting through the matching entries located by the index server and further filtering the matching entries for retrieval and presentation to the user.


