0 views collected around this technical thread.
This article explains how MySQL's InnoDB engine implements full‑text search using inverted indexes, shows how to create and use full‑text indexes with various query modes, demonstrates Boolean operators and query expansion, and covers index removal techniques.
This article explains how MySQL InnoDB implements full‑text search using inverted indexes, shows how to create and drop full‑text indexes, and demonstrates the three query modes—Natural Language, Boolean, and Query Expansion—along with their syntax, operators, relevance calculation, and practical examples.
This article explains how Elasticsearch transforms simple keyword matching into a high‑performance, scalable search engine by using inverted indexes, term dictionaries, posting lists, term indexes, stored fields, doc values, segments, and distributed node architectures to achieve fast, reliable full‑text search on massive data sets.
The article introduces Archer, a new big‑data warehouse engine built on Iceberg that adds an inverted‑index mechanism using Tantivy to provide full‑text and JSON search, storage‑compute separation, and significant performance gains over traditional Elasticsearch and Iceberg connectors.
This article provides a comprehensive, top‑down and bottom‑up explanation of ElasticSearch’s core architecture, detailing nodes, shards, Lucene segments, inverted indexes, stored fields, document values, caching, query processing, routing, and scaling considerations for efficient search operations.
This article explains MySQL InnoDB full-text search, covering inverted index structures, creation and usage of full-text indexes, query modes such as natural language, boolean, and query expansion, and provides practical SQL examples and considerations for effective text searching.
This article explains how MySQL InnoDB implements full‑text search using inverted indexes, covers the creation and usage of FULLTEXT indexes, demonstrates various MATCH…AGAINST query modes such as natural language, boolean, and query expansion, and shows how to manage and delete full‑text indexes with practical SQL examples.
This article explains how MySQL InnoDB implements full‑text search using inverted indexes, shows how to create and drop FULLTEXT indexes, and demonstrates natural language, boolean, and query‑expansion search modes with concrete SQL examples and operator details.
This article explores how to achieve fast, scalable data retrieval in million‑level high‑concurrency scenarios by replacing naïve full‑combination rule matching with column‑wise inverted indexes and bitmap operations, dramatically reducing time complexity and improving stability while leveraging RoaringBitmap compression for space efficiency.
This article explains the fundamental concepts of search engine technology—including forward and inverted indexes, tokenizers, stop words, synonym handling, ranking algorithms, and NLP integration—and provides a concise Go implementation with code examples and performance testing.
This article demonstrates how to implement a basic big‑data search engine in Python by creating a Bloom filter for fast existence checks, designing tokenization functions for major and minor segmentation, building an inverted index, and supporting AND/OR queries with example code and execution results.
This article explains why full‑text search is needed, how InnoDB implements it with inverted indexes, the syntax for creating and using full‑text indexes, the different query modes (natural language, boolean, query expansion), and how to delete full‑text indexes in MySQL.
The team analyzed Lucene’s disk‑based inverted index and built a custom in‑memory inverted‑index service for Himalaya’s ad engine, encoding terms as 64‑bit keys, supporting real‑time updates and BooleanQuery‑style and custom expression filtering, which cut query latency from ~50 ms to under 5 ms and enabled massive scaling.
This article explains how Apache Doris implements a high‑performance, column‑oriented inverted index to address the challenges of massive, real‑time log data storage and analysis, delivering dramatically higher write throughput, lower storage costs, and faster query performance than traditional Elasticsearch and Loki solutions.
This article details Meituan's search‑engine optimization for its food‑delivery platform, describing the performance bottlenecks of Elasticsearch's inverted‑list query and merge phases, the design of a run‑length‑encoding (RLE) index, custom hash‑map term look‑ups, sparse RoaringBitmap structures, integration steps, and the resulting 84% latency reduction.
This article explains the core concepts of Elasticsearch, including how its inverted index works, the structure of term dictionaries and posting lists, shard and replica configuration, cluster node roles, the detailed write, refresh, flush, and merge processes, as well as how search queries are executed across distributed shards.
This article explains the core concepts of Elasticsearch, including the structure and purpose of inverted indexes, how shards and replicas are organized in a cluster, and the detailed workflows for writing, reading, searching, and deleting documents within a distributed environment.
This article explains the fundamentals of structured and unstructured data, introduces Lucene’s inverted index, and details how Elasticsearch builds on Lucene to provide distributed, near‑real‑time search with concepts such as clusters, shards, replicas, routing, and performance optimizations.
This article explains the fundamentals of search, why traditional databases struggle with large‑scale text queries, introduces full‑text search and inverted indexes, describes Lucene as the core library, and details ElasticSearch's distributed architecture, features, and common use cases.
This article explains what search is, why traditional databases struggle with full‑text queries, introduces the concepts of inverted indexes and Lucene, and shows how ElasticSearch combines distributed architecture, real‑time analytics, and powerful search features to solve these problems.