IP Library › Granted Patent US 12,493,615
Granted Patent B2
US 12,493,615 · App. 19/092,787 · Granted Dec 9, 2025

System and method for improving efficiency in natural language query processing utilizing language model

Inventors: Daniel Lazarev (Tel Aviv, IL); Barak Sharoni (Tel Aviv, IL); Bar Magnezi (Tel Aviv, IL)
Assignee: Wiz, Inc.
G06F16/243G06F16/212G06F16/2455
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,493,615
App. No.
19/092,787
Filed
Mar 27, 2025
Granted
Dec 9, 2025
Kind
B2
Examiner
THAI, HANH B
Art Unit
2163
USPC
707/760
Abstract

A system and method for generating a database query based on a natural language query is presented. The method includes receiving an unstructured natural language query directed to a security database, wherein the security database includes a representation of a computing environment; selecting a group of database queries from a plurality of preexisting database queries based on a similarity to the unstructured natural language query; generating a context for processing by a language model, the context including the selected group of database queries, an identified technology, and a schema of the computing environment; processing a prompt and the generated context utilizing the language model to generate a second database query; and executing the second database query on the security database.

Claims (59)

1 . A method for generating a database query based on a natural language query, comprising:

receiving an unstructured natural language query directed to a security database, wherein the security database includes a representation of a computing environment;

selecting a group of database queries from a plurality of preexisting database queries based on a similarity to the unstructured natural language query;

generating a context for processing by a language model, the context including the selected group of database queries, an identified technology, and a schema of the computing environment;

processing a prompt and the generated context utilizing the language model to generate a second database query; and

executing the second database query on the security database.

2 . The method of claim 1 , wherein selecting the group of database queries further comprises:

vectorizing each of: the preexisting database queries and the unstructured natural language query;

determining a similarity score between vector of a preexisting database query and a vector of the unstructured natural language query; and

selecting preexisting database queries based on a similarity score exceeding a predetermined threshold.

3 . The method of claim 2 , further comprising:

re-ranking the selected preexisting database queries; and

generating the context based on the re-ranked preexisting database queries.

4 . The method of claim 1 , further comprising:

generating the prompt for a large language model based on the unstructured natural language query and a first database query.

5 . The method of claim 4 , further comprising:

determining a data schema, the data schema utilized to represent an entity of the computing environment; and

generating the prompt further based on the determined data schema.

6 . The method of claim 5 , further comprising:

determining the data schema based on the unstructured natural language query.

7 . The method of claim 4 , further comprising:

generating the prompt further based on a technology identifier, the technology identifier determined based on data extracted from the unstructured natural language query.

8 . The method of claim 1 , further comprising:

parsing the received natural language query to a textual input including a plurality of text elements; and

matching a text element of the plurality of text elements to a data schema.

9 . A non-transitory computer-readable medium storing a set of instructions for generating a database query based on a natural language query, the set of instructions comprising:

one or more instructions that, when executed by one or more processors of a device, cause the device to:

receive an unstructured natural language query directed to a security database, wherein the security database includes a representation of a computing environment;

select a group of database queries from a plurality of preexisting database queries based on a similarity to the unstructured natural language query;

generate a context for processing by a language model, the context including the selected group of database queries, an identified technology, and a schema of the computing environment;

process a prompt and the generated context utilizing the language model to generate a second database query; and

execute the second database query on the security database.

10 . A system for generating a database query based on a natural language query comprising:

a processing circuitry;

a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:

receive an unstructured natural language query directed to a security database, wherein the security database includes a representation of a computing environment;

select a group of database queries from a plurality of preexisting database queries based on a similarity to the unstructured natural language query;

generate a context for processing by a language model, the context including the selected group of database queries, an identified technology, and a schema of the computing environment;

process a prompt and the generated context utilizing the language model to generate a second database query; and

execute the second database query on the security database.

11 . The system of claim 10 , wherein the memory contains further instructions that, when executed by the processing circuitry for selecting the group of database queries, further configure the system to:

vectorize each of: the preexisting database queries and the unstructured natural language query;

determine a similarity score between vector of a preexisting database query and a vector of the unstructured natural language query; and

select preexisting database queries based on a similarity score exceeding a predetermined threshold.

12 . The system of claim 11 , wherein the memory contains further instructions which when executed by the processing circuitry further configure the system to:

re-rank the selected preexisting database queries; and

generate the context based on the re-ranked preexisting database queries.

13 . The system of claim 10 , wherein the memory contains further instructions which when executed by the processing circuitry further configure the system to:

generate the prompt for a large language model based on the unstructured natural language query and a first database query.

14 . The system of claim 13 , wherein the memory contains further instructions which when executed by the processing circuitry further configure the system to:

determine a data schema, the data schema utilized to represent an entity of the computing environment; and

generate the prompt further based on the determined data schema.

15 . The system of claim 14 , wherein the memory contains further instructions which when executed by the processing circuitry further configure the system to:

determine the data schema based on the unstructured natural language query.

16 . The system of claim 13 , wherein the memory contains further instructions which when executed by the processing circuitry further configure the system to:

generate the prompt further based on a technology identifier, the technology identifier determined based on data extracted from the unstructured natural language query.

17 . The system of claim 10 , wherein the memory contains further instructions which when executed by the processing circuitry further configure the system to:

parse the received natural language query to a textual input including a plurality of text elements; and

match a text element of the plurality of text elements to a data schema.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 10, 2025
From: LAZAREV, DANIEL; SHARONI, BARAK; MAGNEZI, BAR
To: WIZ, INC.
Reel/Frame 071374/0184 →
Continuity (3)
Continuation In Part 18651037 · Apr 30, 2024
Continuation 18457054 · Aug 28, 2023
Related Publication 20250225128A1 · Jul 10, 2025
References Cited (141)
US 7657424B2 · Bennett · 2010 [cited by examiner]
US 7725307B2 · Bennett · 2010 [cited by examiner]
US 7937402B2 · Feng · 2011 [cited by examiner]
US 8146146B1 · Coviello et al. · 2012 [cited by applicant]
US 8645122B1 · Di Fabbrizio · 2014 [cited by examiner]
US 9141663B2 · Mavrov · 2015 [cited by examiner]
US 10127224B2 · Deleeuw · 2018 [cited by examiner]
US 10158677B1 · DiCorpo · 2018 [cited by examiner]
US 10263838B2 · Eda · 2019 [cited by examiner]
US 10304444B2 · Mathias · 2019 [cited by examiner]
US 10417346B2 · Kim · 2019 [cited by examiner]
US 10678810B2 · Rehal · 2020 [cited by applicant]
US 10754877B2 · Kassko et al. · 2020 [cited by applicant]
US 10789292B2 · Manor · 2020 [cited by examiner]
US 10922342B2 · Wang · 2021 [cited by examiner]
US 10997968B2 · Wanas · 2021 [cited by examiner]
US 11080607B1 · Demtchenko · 2021 [cited by examiner]
US 11210268B2 · Albrecht · 2021 [cited by examiner]
US 11303666B1 · Peters et al. · 2022 [cited by applicant]
US 11468054B2 · Chaudhuri · 2022 [cited by examiner]
US 11469963B2 · Forte et al. · 2022 [cited by applicant]
US 11516158B1 · Luzhnica · 2022 [cited by examiner]
US 11544282B1 · Chor et al. · 2023 [cited by applicant]
US 11544343B1 · Bhushan et al. · 2023 [cited by applicant]
US 11551421B1 · Bhushan et al. · 2023 [cited by applicant]
US 11563813B1 · Bhushan et al. · 2023 [cited by applicant]
US 11574429B1 · Tam et al. · 2023 [cited by applicant]
US 11579764B1 · Argroves et al. · 2023 [cited by applicant]
US 11593669B1 · Chhabra et al. · 2023 [cited by applicant]
US 11601324B1 · Fletcher et al. · 2023 [cited by applicant]
US 11604794B1 · Nallapati et al. · 2023 [cited by applicant]
US 11604877B1 · Gallien et al. · 2023 [cited by applicant]
US 11620541B1 · Ghosh et al. · 2023 [cited by applicant]
US 11630695B1 · Aleti et al. · 2023 [cited by applicant]
US 11644940B1 · Chor et al. · 2023 [cited by applicant]
US 11651571B1 · Bhushan et al. · 2023 [cited by applicant]
US 11663109B1 · Deaderick et al. · 2023 [cited by applicant]
US 11663382B1 · Cascioli · 2023 [cited by applicant]
US 11670062B1 · Bhushan et al. · 2023 [cited by applicant]
US 11670288B1 · Das et al. · 2023 [cited by applicant]
US 11675473B1 · Breeden et al. · 2023 [cited by applicant]
US 11675816B1 · Chandrasekharan et al. · 2023 [cited by applicant]
US 11676072B1 · Chandrasekharan et al. · 2023 [cited by applicant]
US 11676345B1 · Bhushan et al. · 2023 [cited by applicant]
US 11676582B2 · Nowak-Przygodzki · 2023 [cited by examiner]
US 11687413B1 · Chen et al. · 2023 [cited by applicant]
US 11693710B1 · Aleti et al. · 2023 [cited by applicant]
US 11704219B1 · Lerner et al. · 2023 [cited by applicant]
US 11714683B1 · Roberts et al. · 2023 [cited by applicant]
US 11720686B1 · Cross et al. · 2023 [cited by applicant]
US 11726750B1 · Arcadinho · 2023 [cited by examiner]
US 11727643B1 · Bhushan et al. · 2023 [cited by applicant]
US 11729074B1 · Mishra et al. · 2023 [cited by applicant]
US 11734886B1 · Bhushan et al. · 2023 [cited by applicant]
US 11741131B1 · Dwivedi et al. · 2023 [cited by applicant]
US 11755405B1 · Satish et al. · 2023 [cited by applicant]
US 11762869B1 · Werner · 2023 [cited by applicant]
US 11769017B1 · Gray · 2023 [cited by examiner]
US 11782917B2 · Chaudhuri · 2023 [cited by examiner]
US 11789940B2 · Jiao et al. · 2023 [cited by applicant]
US 11809497B2 · Beringer et al. · 2023 [cited by applicant]
US 11860914B1 · Qadrud-Din · 2024 [cited by examiner]
US 11861320B1 · Gajek · 2024 [cited by examiner]
US 11861321B1 · O'Kelly · 2024 [cited by examiner]
US 11928569B1 · Douthit · 2024 [cited by examiner]
US 12001550B1 · Schindel · 2024 [cited by examiner]
US 12282502B2 · Whitehead, Jr. et al. · 2025 [cited by applicant]
US 20040117189A1 · Bennett · 2004 [cited by examiner]
US 20050131695A1 · Lucente · 2005 [cited by examiner]
US 20050172261A1 · Yuknewicz et al. · 2005 [cited by applicant]
US 20080010259A1 · Feng · 2008 [cited by examiner]
US 20080091681A1 · Dwivedi et al. · 2008 [cited by applicant]
US 20100153412A1 · Mavrov · 2010 [cited by examiner]
US 20100262454A1 · Sommer · 2010 [cited by examiner]
US 20100287220A1 · Aust · 2010 [cited by examiner]
US 20130018920A1 · Griffin · 2013 [cited by applicant]
US 20140095469A1 · Chen et al. · 2014 [cited by applicant]
US 20150026219A1 · Manor · 2015 [cited by examiner]
US 20160179787A1 · Deleeuw · 2016 [cited by examiner]
US 20170212884A1 · Kim · 2017 [cited by examiner]
US 20170278514A1 · Mathias · 2017 [cited by examiner]
US 20180004870A1 · Ohayon et al. · 2018 [cited by applicant]
US 20180052824A1 · Ferrydiansyah · 2018 [cited by examiner]
US 20180062916A1 · Eda · 2018 [cited by examiner]
US 20180137401A1 · Kumar et al. · 2018 [cited by applicant]
US 20190222593A1 · Craig et al. · 2019 [cited by applicant]
US 20190377824A1 · Wang · 2019 [cited by examiner]
US 20200244700A1 · Moon · 2020 [cited by examiner]
US 20200349919A1 · Wanas · 2020 [cited by examiner]
US 20200394190A1 · Chaudhuri · 2020 [cited by examiner]
US 20210049158A1 · Jiao et al. · 2021 [cited by applicant]
US 20210173829A1 · Zeng · 2021 [cited by examiner]
US 20210182489A1 · Barkan · 2021 [cited by examiner]
US 20210209167A1 · Feng et al. · 2021 [cited by applicant]
US 20210272554A1 · Robert Jose · 2021 [cited by examiner]
US 20220035802A1 · Penzo · 2022 [cited by examiner]
US 20220036153A1 · O'Malia · 2022 [cited by examiner]
US 20220229832A1 · Li · 2022 [cited by examiner]
US 20220300542A1 · Schwartz · 2022 [cited by examiner]
US 20220318507A1 · Barkan · 2022 [cited by examiner]
US 20220398583A1 · Crudele et al. · 2022 [cited by applicant]
US 20220414228A1 · Difonzo · 2022 [cited by examiner]
US 20230018809A1 · Deshmukh · 2023 [cited by applicant]
US 20230061234A1 · Calado et al. · 2023 [cited by applicant]
US 20230074406A1 · Baeuml · 2023 [cited by examiner]
US 20230078177A1 · Wang et al. · 2023 [cited by applicant]
US 20230083512A1 · Newman · 2023 [cited by examiner]
US 20230085500A1 · Hong · 2023 [cited by examiner]
US 20230088034A1 · Salman · 2023 [cited by applicant]
US 20230112921A1 · Cai · 2023 [cited by examiner]
US 20230139000A1 · Apger et al. · 2023 [cited by applicant]
US 20230142344A1 · Nakar · 2023 [cited by applicant]
US 20230161821A1 · Beringer et al. · 2023 [cited by applicant]
US 20230164098A1 · Cai et al. · 2023 [cited by applicant]
US 20230177363A1 · Li et al. · 2023 [cited by applicant]
US 20230222029A1 · Vutukuru et al. · 2023 [cited by applicant]
US 20230224324A1 · Karabey et al. · 2023 [cited by applicant]
US 20230224377A1 · Bathla et al. · 2023 [cited by applicant]
US 20230237053A1 · Dangoor · 2023 [cited by examiner]
US 20230237277A1 · Reza · 2023 [cited by examiner]
US 20230244938A1 · Wei · 2023 [cited by examiner]
US 20230252140A1 · Coulter · 2023 [cited by applicant]
US 20230259705A1 · Tunstall-Pedoe · 2023 [cited by examiner]
US 20230274086A1 · Tunstall-Pedoe · 2023 [cited by examiner]
US 20230274094A1 · Tunstall-Pedoe · 2023 [cited by examiner]
US 20230274733A1 · Nowak-Przygodzki · 2023 [cited by examiner]
US 20230316001A1 · Araki · 2023 [cited by examiner]
US 20230319074A1 · Murphy et al. · 2023 [cited by applicant]
US 20230319097A1 · Murphy et al. · 2023 [cited by applicant]
US 20230325154A1 · Arcadinho · 2023 [cited by examiner]
US 20230325725A1 · Lester · 2023 [cited by examiner]
US 20230351026A1 · Cross et al. · 2023 [cited by applicant]
US 20240020538A1 · Socher · 2024 [cited by examiner]
US 20240062016A1 · Tong · 2024 [cited by examiner]
US 20240403273A1 · Zangri et al. · 2024 [cited by applicant]
US 20240403428A1 · Lal et al. · 2024 [cited by applicant]
US 20240419918A1 · Vangala et al. · 2024 [cited by applicant]
US 20240427810A1 · Tishbi et al. · 2024 [cited by applicant]
US 20250200027A1 · Fu · 2025 [cited by examiner]
International Search Report for PCT/IB2024/058430, dated Dec. 19, 2024. Searching Authority, Israel Patent Office, Jerusalem, Israel. [cited by applicant]
Written Opinion of the Searching Authority for PCT/IB2024/058430, dated Dec. 19, 2024. Searching Authority, Israel Patent Office, Jerusalem, Israel. [cited by applicant]
Cited By (2)
US 12,626,067 US 12,717,834