Tag archive

#search

Topic-specific entry points for internal linking, discovery, and deeper subject exploration.

5 articles

Skip Lists in Java: The Probabilistic Alternative to Balanced Trees

A Skip List is a probabilistic data structure that allows for fast search, insertion, and deletion in a sorted list of elements. It is often described as a "multi-layered linked list." While balanced trees like AVL or Re…

Apr 20, 20263 min read

Deep Dive

#dsa#java#skip list

System DesignAdvanced

System Design: Building a Search Indexing Platform

Search gets demoed as a search box. Search gets operated as a distributed data synchronization problem. The hard part is usually not querying Elasticsearch or OpenSearch. The hard part is getting the right data into the…

Apr 10, 202611 min read

Deep Dive

#system design#search#elasticsearch

DatabasesAdvanced

Elasticsearch Query Optimization: From Slow to Sub-100ms

Elasticsearch is a distributed search and analytics engine built on top of Apache Lucene. At small scale, it's fast regardless of what you do. At production scale — billions of documents, hundreds of concurrent queries,…

May 29, 20258 min read

Deep Dive

#elasticsearch#search#performance

DatabasesAdvanced

Elasticsearch Deep Dive: Inverted Index, Mappings, and Query DSL

Most engineers use Elasticsearch as a black box: index some JSON, run a search, get results. When search quality is poor or performance degrades at scale, they reach for random settings without understanding why. This ar…

Feb 24, 202511 min read

Deep Dive

#elasticsearch#search#inverted index

System DesignAdvanced

System Design: Search Autocomplete at Google Scale

Search autocomplete — the dropdown that appears as you type — seems simple but is one of the most latency-sensitive features in any product. Google returns suggestions in under 100ms for billions of queries per day. This…

Feb 20, 202511 min read

Deep Dive

#system design#search#autocomplete