Главная
Study mode:
on
1
Introduction
2
Example
3
Challenges
4
Common Solutions
5
Graph Data Models
6
Requirements
7
Demo
8
Questions
9
Wildcard
10
Events
11
Events in Sequence
12
Results
13
Who did that
14
Changing the expression
15
Summary statistics
16
Conclusion
17
Ajith Cody
18
Guiding Principles
19
Building Blocks
20
Abstract Syntax Trees
21
Finite State Machine
22
Regular Expressions
23
Syntax Tree
24
State Machine
25
Bounded Repeat
26
Methodology
27
Un unbounded repeat
28
Match state
29
Evaluation
30
Plan Selection
31
Provide Payment
32
Login Event
33
Apache Spark
34
Map Partition
35
Optimizations
36
Matching multiple patterns simultaneously
Description:
Explore pattern matching at scale using finite state machines in this conference talk from Strange Loop. Dive into the challenges of locating data that fits patterns within big data from non-homogeneous sources, focusing on Netflix's approach to improving the sign-up experience through experimentation. Learn about a framework for expressing user journey patterns translated into a Non-Deterministic Finite State Machine, inspired by Ken Thompson's 1968 CACM paper. Discover how this state machine is applied across billions of events using Spark, and how it's made accessible to Data Engineers, Scientists, and Analysts. Gain insights into the development of the "Conduit" framework, including design decisions and challenges encountered. The talk covers topics such as graph data models, wildcards, events in sequence, abstract syntax trees, regular expressions, Apache Spark optimizations, and matching multiple patterns simultaneously. Presented by Ajit Koti and Rashmi Shamprasad, experienced engineers from Netflix's Growth Data Engineering team, this session offers valuable knowledge for those interested in large-scale distributed systems, big data solutions, and data engineering. Read more

Pattern Matching at Scale Using Finite State Machine

Strange Loop Conference
Add to list
0:00 / 0:00