IP Library Granted Patent US 12,665,969
Granted Patent B2
US 12,665,969 · App. 18/790,531 · Granted Jun 23, 2026

Technologies for generating optimized event sequence indices for real-time event flow visualizations and analytics

Inventors: Ankit Pat (Menlo Park, CA); Maciej Dabrowski (Galway, IE)
Assignee: Genesys Cloud Services, Inc.
H04M3/5175
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,665,969
App. No.
18/790,531
Filed
Jul 31, 2024
Granted
Jun 23, 2026
Kind
B2
Art Unit
2691
USPC
379/265.06
Abstract

A method for generating an inverted search index for event sequence visualization may include determining, from an event sequence dataset containing event sequences and events, event pair combinations based on identified unique singleton events. The method may further include establishing a positional ordering for each singleton event and each event pair combination and generating a respective event sequence set for each event sequence. The method may also include determining whether each unique singleton event and each event pair combination exists or does not exist within each event sequence, and populating, for each respective event sequence set and according to the positional ordering, data indicative of whether each unique singleton event and each event pair combination exists or does not exist within the event sequence for the respective event sequence set. The method may also include generating the inverted search index including each respective event sequence set for each event sequence.

Claims (20)

1 . A method for generating a forward search index for real-time event sequence visualization, the method comprising:

retrieving, by a computing system, an event sequence dataset, wherein the event sequence dataset includes data for a plurality of event sequences and a plurality of events, and wherein each event sequence of the plurality of events sequences includes at least one event of the plurality of events;

determining, by the computing system, a plurality of unique singleton events from the plurality of events included in the event sequence dataset;

determining, by the computing system, a plurality of unique n-tuple event patterns from the plurality of event sequences and the at least one event of the plurality of events included in each of the plurality of event sequences;

generating, by the computing system, an event pattern set for each unique singleton event of the plurality of unique singleton events and each unique n-tuple event pattern of the plurality of unique n-tuple event patterns;

populating, by the computing system and for each event pattern set, data indicative of an existence of the unique singleton event or the unique n-tuple event pattern in at least one of the plurality of event sequences; and

generating, by the computing system, the forward search index including each event pattern set for each unique singleton event of the plurality of unique singleton events and each unique n-tuple event pattern of the plurality of unique n-tuple event patterns.

2 . The method of claim 1 , wherein each n-tuple event pattern of the plurality of n-tuple event patterns is an ordered 2-tuple event pattern.

3 . The method of claim 1 , further comprising:

identifying, by the computing system, each event sequence of the plurality of event sequences from the event sequence dataset; and

identifying, by the computing system, the plurality of events included in the event sequence dataset.

4 . The method of claim 1 , further comprising parsing, by the computing system, the event sequence dataset to identify each event sequence of the plurality of event sequences and each event of the plurality of events.

5 . The method of claim 1 , further comprising:

determining, by the computing system, an occurrence of each event of the plurality of events; and

generating, by the computing system, the event sequence dataset including each event of the plurality of events determined to have occurred.

6 . The method of claim 1 , wherein each event of the plurality of events is associated with one or more attributes.

7 . The method of claim 1 , wherein generating the forward search index comprises generating an encoded forward search index in which each event pattern set for each unique singleton event of the plurality of unique singleton events and each unique n-tuple event pattern of the plurality of unique n-tuple event patterns is encoded as a bit vector.

8 . The method of claim 7 , wherein generating the encoded forward search index comprises:

establishing, by the computing system, a positional ordering for each event sequence of the plurality of event sequences; and

populating, by the computing system and for each event pattern set included in the encoded forward search index, first data or second data according to the positional ordering for each event sequence of the plurality of event sequences, wherein the first data is indicative of the existence of the unique singleton event or the unique n-tuple event pattern in each of the plurality of event sequences, and the second data is indicative of an absence of the unique singleton event or the unique n-tuple event pattern in each of the plurality of event sequences.

Assignments (2)
SUPPLEMENT TO SECURITY AGREEMENT Recorded May 1, 2025
From: GENESYS CLOUD SERVICES, INC.
To: GOLDMAN SACHS BANK USA, AS COLLATERAL AGENT
Reel/Frame 071146/0687 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 17, 2024
From: PAT, ANKIT; DABROWSKI, MACIEJ
To: GENESYS CLOUD SERVICES, INC.
Reel/Frame 069611/0769 →
Continuity (1)
Related Publication 20260039752A1 · Feb 5, 2026
References Cited (18)
US 20150039574A1 · Dubey · 2015 [cited by examiner]
US 20230038616A1 · Hopcroft · 2023 [cited by examiner]
US 20230050135A1 · Thiel · 2023 [cited by applicant]
US 20230334034A1 · Murgai · 2023 [cited by examiner]
Gang Luo et al: “Resource-adaptive real-time new event detection”, Proceedings of the ACM Sigmod International Conference on Management of Data, Beijing, China, Jun. 12-14, 2007, ACM, 2 Penn Plaza, Suite 701, New York, … [cited by applicant]
International Search Report and Written Opinion of the ISA, mailed Oct. 6, 2025 for related International application PCT/2025/039270, filed Jul. 25, 2025, which claims priority to the instant application. [cited by applicant]
Sanghvi, Y.; A Simple Guide to Sequence Pattern Mining: Types & 4 Algorithms; May 19, 2022; retrieved from the Internet Jul. 29, 2024; available at https://hevodata.com/learn/sequence-pattern-mining/. [cited by applicant]
Kadioğlu, S et al.; Seq2Pat: Sequence-to-pattern generation to bridge pattern mining with machine learning; AI Magazine; 2023; pp. 54-66; vol. 44; available at https://onlinelibrary.wiley.com/doi/epdf/10.1002/aaai.12081… [cited by applicant]
Hosseininasab, A. et al.; Constraint-Based Sequential Pattern Mining with Decision Diagrams; Proceedings of The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19); 2019; pp. 1495-1502; available at https:… [cited by applicant]
Fidelity Investments et al.; Seq2Pat: Sequence-to-Pattern Generation Library “README.md”; May 31, 2024; retrieved from the Internet Jul. 29, 2024; available at https://github.com/fidelity/seq2pat/blob/master/README.md. [cited by applicant]
Gyacsok, A.; sequence-mining 0.0.3: Sequence mining SPAM algorithm implementation; Sep. 20, 2022; retrieved from the Internet Jul. 29, 2024; available at https://pypi.org/project/sequence-mining/. [cited by applicant]
Gao, C.; prefixspan 0.5.2: PrefixSpan, BIDE, and FEAT in Python 3; Sep. 29, 2018; retrieved from the Internet Jul. 29, 2024; available at https://pypi.org/project/prefixspan/. [cited by applicant]
Wikipedia; Silhouette (clustering); Jul. 1, 2024; retrieved from the Internet Jul. 29, 2024; available at https://en.wikipedia.org/wiki/Silhouette_(clustering). [cited by applicant]
Pascoe, A.; HyperLogLog and MinHash; Jul. 10, 2013; retrieved from the Internet Jul. 29, 2024; available at https://tech.nextroll.com/blog/data/2013/07/10/hll-minhash.html. [cited by applicant]
Gupta, U.; Probabilistic Data Structures: Part 2; Sep. 6, 2023; retrieved from the Internet Jul. 29, 2024; available at https://www.linkedin.com/pulse/probabilistic-data-structures-part-2-ujjwal-gupta. [cited by applicant]
Burroughs, S.; B+Tree Basics; Mar. 18, 2016; retrieved from the Internet Jul. 29, 2024; available at https://www.youtube.com/watch?v=49P_GDeMDRo. [cited by applicant]
Burroughs, S.; B+Tree Deletions; Mar. 18, 2016; retrieved from the Internet Jul. 29, 2024; available at https://www.youtube.com/watch?v=QrbaQDSuxIM. [cited by applicant]
Fisher, D.; B+ Tree Basics 1; Mar. 23, 2013; retrieved from the Internet Jul. 29, 2024; available at https://www.youtube.com/watch?v=CYKRMz8yzVU. [cited by applicant]