# US 2020/0394193 A1 · Text search of database with one-pass indexing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0394193 A1
- Document ID: US20200394193A1
- Status: Published application
- Kind: A1
- Application number: 16/071,364
- Filed: 2016-01-29
- Published: 2020-12-17
- Earliest claimed: 2016-01-29
- Assignees: Entit Software LLC
- Applicants: Entit Software LLC
- Inventors: Qiming Chen; Meichun Hsu; Malu G. Castellanos
- Web page: https://patentgrep.com/patent/US20200394193A1

## CPC

- G06F 16/24542: {Plan optimisation}
- G06F 16/24553: {of query operations}
- G06F 16/2452: Query translation
- G06F 16/284: {Relational databases}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system and method for a text search of a database, including converting a text search expression to a query plan and implementing the text search as the query plan on the database. The implementing of the text search includes a one-pass indexing as a single scan of an inverse index table associated with the database.

## Claims

### Claim 1

A method of text search of a database, comprising:
receiving a text search expression for a text search of a database;
converting the text search expression to a query plan comprising multiple search tokens; and
performing, based on the query plan, a one-pass indexing comprising a single scan of an inverse index table associated with the database to identify documents in the database having the multiple search tokens.

### Claim 2 (depends on 1)

The method of claim 1, comprising retrieving the documents having the multiple search tokens, wherein performing the one-pass indexing does not comprise performing a multi-pass scan or a self-Join of the inverse index table.

### Claim 3 (depends on 1)

The method of claim 1, wherein the multiple search tokens comprise a first search token and a second search token, wherein the text search expression comprises multiple words, wherein the first search token is a first word of the text search expression, and the second search token is a second word of the text search expression, wherein performing the one-pass indexing comprises identifying and counting documents of the database matching the first search token to give a first set of a list of documents, and identifying and counting documents of the database matching the second search token to give a second set of list of documents.

### Claim 4 (depends on 3)

The method of claim 3, comprising implementing the text search on the database, wherein implementing the text search includes performing the one-pass index scan comprising combining the first set with the second set to give a union bag.

### Claim 5 (depends on 4)

The method of claim 4, wherein the text search expression comprises two words, wherein documents in the union bag having a count of two are documents that contain the first search token and the second search token.

### Claim 6 (depends on 1)

The method of claim 1, wherein the database comprises a relational database, wherein the query plan comprises a structured query language (SQL) query plan, wherein converting the text search expression to a query plan comprises converting, via a text-search SQL-query generator, the text search expression into the SQL query plan to provide for direct leveraging of SQL operators in the text search.

### Claim 7

A computing device for a text search of a database, the computing device comprising:
a processor;
a network interface to couple the computing device to a database; and
memory storing a search portal to:
process words for a text search into a query plan comprising more than one search token; and
implement a one-pass indexing comprising a scan of an inverted index table of the database to determine documents in the database having the more than one search token.

### Claim 8 (depends on 7)

The computing device of claim 7, wherein the search portal to retrieve the documents having the more than one search token, wherein to implement the one-pass indexing does not comprise performing a multi-pass scan or a self-join of the inverted index table.

### Claim 9 (depends on 7)

The computing device of claim 7, wherein the more than one search token comprise a first search token and a second search token, wherein to implement the one-pass indexing comprises to determine and count documents of the database matching the first search token to give a first set of a list of documents, and to determine and count documents of the database matching the second search token to give a second set of list of documents.

### Claim 10 (depends on 9)

The computing device of claim 9, wherein the one-pass indexing scan comprises to combine the first set with the second set to give a union bag to determine documents that contain the first search token and the second search token.

### Claim 11 (depends on 10)

The computing device of claim 10, wherein the words for the text comprise two words, wherein the first search token is a first word of the two words, and the second search token is a second word of the two words, and wherein documents listed in the union bag having a count of two are documents that contain the first search token and the second search token.

### Claim 12 (depends on 7)

The computing device of claim 7, wherein the database comprises a relational database, wherein the query plan comprises a structured query language (SQL) query plan, wherein the search portal comprises a text-search SQL-query generator to process the words for the text search into the SQL query plan that directly applies SQL operators in the text search implemented as the SQL query plan on the database.

### Claim 13

A tangible, non-transitory, computer-readable medium comprising instructions comprising a text search engine that direct a processor to:
transform a text search expression comprising multiple words into a query plan; and
apply the query plan on the database, including executing a one-pass indexing comprising a sole scan of an inverse word index of the database to note documents in the database having the multiple words.

### Claim 14 (depends on 13)

The computer-readable medium of claim 13, wherein the instructions comprising the text search engine to direct the processor to retrieve the documents having the multiple search tokens, and wherein the one-pass indexing does not comprise a multi-pass scan or a self-join of the inverse word index.

### Claim 15 (depends on 13)

The computer-readable medium of claim 13, wherein the database comprises a relational database, wherein the query plan comprises a structured query language (SQL) query plan, wherein the instructions comprising the text search engine comprise a text-search SQL-query generator to direct the processor to transform the text search expression into the SQL query plan that directly utilizes SQL operators in a text search of the database based on the text search expression and applied as the SQL query plan.
