# US 2026/0300319 A1 · Event-augmented generation

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

- Number: US 2026/0300319 A1
- Document ID: US20260300319A1
- Status: Published application
- Kind: A1
- Application number: 19/093,908
- Filed: 2025-03-28
- Published: 2026-10-01
- Earliest claimed: 2025-03-28
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Anders Tungeland GJERDRUM; Age Andre KVALNES; Jan-Ove Almli KARLBERG
- Web page: https://patentgrep.com/patent/US20260300319A1

## CPC

- G06F 16/282: {Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes}
- G06F 18/245: relating to the decision surface
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In various examples, an event-augmented generation tool determines whether to notify a client that an ingress event modifies data associated with a query. For example, a query footprint represents data stored in a data storage system that satisfies a query. In such examples, the event-augmented generation tool generates a predicate set that represents at least a portion of the query footprint. In an embodiment, the predicate set includes a mask representing a set of values and a Bloom filter. In one example, ingress events are evaluated based on the predicate set to determine whether data corresponding to the ingress event satisfies the query.

## Claims

### Claim 1

A method comprising:
obtaining data corresponding to an ingress event associated with a data store; and
determining the data modifies a query footprint associated with a query by at least:
generating a hash value based on the data;
applying a bitmask to the hash value based on a mask included in a predicate set associated with the query;
querying a Bloom filter included in the predicate set; and
transmitting to a client associated with the query an indication that the ingress operation modifies the query footprint.

### Claim 2 (depends on 1)

The method of claim 1, wherein determining the data modifies the query footprint further comprises:
generating a second hash value based on second data obtained from the ingress event;
applying a second bitmask to the second hash values based on a second mask included in a second predicate set associated with the query; and
querying a second Bloom filter included in the second predicate set.

### Claim 3 (depends on 2)

The method of claim 2, wherein the first predicate and the second predicate are stored in a hierarchical structure.

### Claim 4 (depends on 3)

The method of claim 3, wherein hierarchical structure includes a decision tree.

### Claim 5 (depends on 2)

The method of claim 2, wherein transmitting to the client associated with the query the indication that the ingress operation modifies the query footprint is based on a result of querying the Bloom filter and the second Bloom filter indicating inclusion of the data in the Bloom filter and inclusion of the second data in the second Bloom filter.

### Claim 6 (depends on 1)

The method of claim 1, wherein the method further comprises adding the data to the Bloom filter.

### Claim 7 (depends on 1)

The method of claim 1, wherein the query is obtained from a machine learning model.

### Claim 8

A non-transitory computer-readable medium storing executable instructions embodied thereon, that, as a result of being executed by a processing device, cause the processing device to perform operations comprising:
obtaining a query from a client;
determining a query footprint associated with the query, the query footprint indicating data that satisfies the query;
generating a predicate set associated with the query footprint based on a predicate included in the query by at least generating a mask corresponding to the predicate;
generating a Bloom filter associated with the predicate set, the Bloom filter storing values that satisfy the predicate included in the query; and
evaluating an ingress event based on the predicate set.

### Claim 9 (depends on 8)

The medium of claim 8, wherein the operations further comprise generating a second predicate set based on a second predicate included in the query.

### Claim 10 (depends on 9)

The medium of claim 9, wherein the operations further comprise storing the predicate and the second predicate in a hierarchical data structure based on a cardinality associated with the predicate.

### Claim 11 (depends on 8)

The medium of claim 8, wherein the predicate includes at least one of: an equality predicate, a range predicate, a set membership predicate, a pattern matching predicate, a Boolean predicate, a temporal predicate, a negation predicate, and an existence predicate.

### Claim 12 (depends on 8)

The medium of claim 8, wherein the mask includes a set of bits representing the predicate.

### Claim 13 (depends on 12)

The medium of claim 12, wherein the set of bits represent a set of values indicated in the predicate.

### Claim 14 (depends on 13)

The medium of claim 13, wherein the set of values represent a range of values that satisfy the predicate.

### Claim 15 (depends on 8)

The medium of claim 8, wherein evaluating the ingress event further comprises:
extracting metadata from the ingress event;
generating a hash value based on the metadata and a hash function;
applying the mask to the hash value to generate a result; and
querying the Bloom filter based on the result.

### Claim 16

A system comprising:
a memory component; and
a processing device coupled to the memory component, the processing device to perform operations comprising:
detecting an ingress event;
determining the ingress event modifies a query footprint associated with a query by at least evaluating the ingress event based on a predicate set associated with the query footprint, the predicate set including a mask applied to data included in the ingress event and a Bloom filter to determine inclusion in the query footprint; and
transmitting an indication that the ingress operation modifies the query footprint to a client associated with the query.

### Claim 17 (depends on 16)

The system of claim 16, wherein determining the ingress event modifies the query footprint associated with the query further comprises evaluating the ingress event based on a second predicate set associated with the query footprint.

### Claim 18 (depends on 16)

The system of claim 16, wherein the operations further comprise:
obtaining the query;
generating the mask to represent a set of values that satisfy a predicate included in the query; and
storing the set of values in the Bloom filter.

### Claim 19 (depends on 16)

The system of claim 16, wherein evaluating the ingress event further comprises evaluating a plurality of predicate sets maintained in a decision tree.

### Claim 20 (depends on 16)

The system of claim 16, wherein the predicate set represents a predicate included in the query, the predicate including at least one of: an equality predicate, a range predicate, a set membership predicate, a pattern matching predicate, a Boolean predicate, a temporal predicate, a negation predicate, and an existence predicate.
