IMPORTANT NOTE: Timing of sessions and room locations are subject to change.
The Sched app allows you to build your schedule but is not a substitute for your event registration. In order to attend OpenSearchCon Europe 2026, please visit our website to register.
This schedule is automatically displayed in Central European Summer Time (UTC+02:00). To see the schedule in your preferred timezone, please select from the drop-down located at the bottom of the menu to the right.
Sign up or log in to add sessions to your schedule and sync them to your phone or calendar.
Search systems are hitting a wall. Static sharding causes hotspots, slow queries, and costly overprovisioning. But what if your search infrastructure could evolve in real time - splitting, scaling, and optimizing itself on the fly?
We present a cutting-edge dynamic shard topology in OpenSearch that redefines how scalability and search efficiency coexist. Inspired by distributed systems principles and real-world cloud constraints, this architecture uses a root-child shard model with mutually exclusive hash ranges to enable conflict-free, high-throughput ingestion and ultra-fast targeted search.
But we didn’t stop there. We embedded a playoff-style lookup algorithm - a smarter alternative to brute-force fan-out—ensuring queries scale logarithmically, not linearly.
The result? 🔹 True infinite horizontal scalability without reindexing. 🔹 Near-zero latency lookups, even during shard splits. 🔹 Elastic, self-healing architecture balancing cost, performance, and reliability.
This isn't a prototype. It's cloud-native and production-ready. If you're building systems at scale - or aiming to - this session will change how you think about search.
Senior Software Engineer with 12+ years of experience, currently driving online shard split for scalable search in AWS OpenSearch. Key contributor to OpenSearch Serverless launch and achieved 70% boost via async S3 multipart upload. Built a Hystrix-style circuit breaker in Go. Past... Read More →
