Optimization: Not All That Glitters Is Gold (StudentDay)
summary
Presentation introduces a custom data structure not found in the JDK, built quickly by hand, aimed at speeding up string-processing tasks. It shows two real applications: using the structure to compare texts via the Longest Common Subsequence (LCS) algorithm and to select an appropriate pattern from a set of 200,000 candidates within a microsecond.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 1:40Data structures warm-up
- 5:14What is TROY
- 8:29Wikipedia author ranking
- 18:03Real Time Bidding traffic filtering
- 23:25JMH performance testing
- 27:45User-Agent pattern search
- 30:59Optimization with TROY
- 32:44Results and speedup
- 33:06Source code and examples
- 33:50Q&A
related talks
45mHow difficult can it be to write efficient code?
01h 00mLatest Java Best Practices
47mHow the JVM Optimizes Generic Code - A Deep Dive
02h 44mValue Types and Pattern Matching: 1–1, Data at the Center
50mThe Hidden Art of Thread-Safe Programming: Exploring java.util.con...
43mLearning modern Java the playful way
51mSecrets of top performance in Java revealed
52mFuture of Java