Tabular Data Search Using Exemplar Query Matching

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current systems for searching tabular data face challenges in efficiently matching user queries with relevant data elements, particularly due to limitations in automatic schema matching and the need for extensive exemplar queries.

Innovation Solution

A computer-implemented system that receives search parameters from a user device, compares them with stored exemplar search queries to determine corresponding rows and columns in a tabular database, and identifies the relevant cell for displaying associated data elements, utilizing techniques like stop word removal and lemmatization to generalize exemplar queries and enhance matching efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If automatic schema matching is used to search tabular data, then search speed is improved, but matching precision deteriorates due to inability to handle complex queries

Engineering Contradiction:
Improvesearch speedVSAvoidmatching precision
Core Design Contradiction:
SpeedVSMeasurement precision

Solution Approach 1:

The patent introduces exemplar queries as an intermediary between automatic schema matching and user queries. These pre-prepared exemplar queries act as a bridge, containing annotated search terms that link natural language queries to specific database schemas, thereby improving matching precision while maintaining search efficiency

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system performs preliminary action by pre-preparing and storing multiple exemplar queries with annotated search terms before actual user searches. This advance preparation creates a ready-to-use mapping between natural language and database schema, enabling faster and more accurate matching during actual search operations

Inventive Principle:
Principle #10Preliminary action

2Reliability

If more exemplar queries are stored to improve query coverage, then search accuracy is improved, but system complexity increases

Engineering Contradiction:
Improvequery coverageVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent uses copying by creating multiple variations of exemplar queries from a single annotated query template. By systematically generating copies with different search terms and parameters, the system achieves comprehensive query coverage without manually creating each exemplar query, thus reducing system complexity

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The system implements universality by designing exemplar query templates that can serve multiple functions. A single annotated template can generate various exemplar queries for different search scenarios, making the system more versatile without proportionally increasing complexity

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Productivity

If exemplar queries are generalized using stop word removal and lemmatization, then matching efficiency is improved, but information loss may occur

Engineering Contradiction:
Improvematching efficiencyVSAvoidinformation loss
Core Design Contradiction:
ProductivityVSLoss of information

Solution Approach 1:

The patent applies parameter changes by systematically modifying search terms through stop word removal and lemmatization transformations. This creates standardized forms of queries that improve matching efficiency while the annotation process preserves the original meaning and intent, balancing efficiency gains with information retention

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10061757B2Systems, methods, and computer-readable media for searching tabular data
Publication Date: 2018.08.28 GOOGLE LLC
  • US10061757B2 patent drawing
  • US10061757B2 patent drawing
  • US10061757B2 patent drawing

AI summary

Systems, methods, and computer-readable media are provided for searching a tabular database. According to certain embodiments, search parameters for searching a tabular database are received from a user device and a row of a tabular database that corresponds to the search parameters is determined. In certain embodiments, the row may be determined by comparing the search parameters with a plurality of stored exemplar search queries, each of the plurality of stored exemplar search queries comprising a search query associated with a row and a column of the tabular database. A column of the tabular database that corresponds to the search parameters is determined by comparing the search parameters with the plurality of stored exemplar search queries. In certain embodiments, at least one cell of the tabular database is determined. The determined cell may be located at the intersection of the determined row and the determined column. A data element associated with the at least one cell is sent to the user device for display.