Algorithms, usage, and implementation in Progress OpenEdge
#ProgressOpenEdge #BalticAmadeus #DatabaseIndexing #DataStructures
Learn the core ideas behind searching algorithms and data structures.
In this video, our Baltic Amadeus developer walks through simple search methods, compares performance across different programming languages, and explains how binary trees and B-trees help systems handle data efficiently.
You'll also see why many systems, including Progress OpenEdge, use B-tree structures for indexing and what makes them so effective in real-world applications.
Have questions about OpenEdge development? Get in touch with our team: https://www.ba.lt/en/services/progres...
00:00 - The Plan
00:58 - Linear Search
02:05 - Linear Search Performance Benchmark
05:15 - An Improved Solution: Binary Search
07:09 - A Generalised Problem
07:38 - Binary Search Trees
08:51 - B-Trees
09:12 - Use Cases
10:18 - Why B-Trees are Used (Memory Hierarchy)
13:14 - Properties of a B-Tree
16:51 - Searching for a key
18:19 - Insertion Algorithm
24:34 - Deletion Algorithm
37:01 - B-Tree Performance Benchmark
40:30 - Conclusions
41:45 - Q&A