# Ming Ying: Making COUNTs and the Rest of Search Really Fast (Part II)

> **Key Architectural Takeaway:** How ctid-aware segment partitioning, an inverted DocId map, and bitmap postings accelerated ParadeDB's Wikipedia COUNT queries—then a look at the rest of search, where ParadeDB delivered 10–22x TIN's throughput on filtered and time-sorted Hacker News queries.

**Published:** 2026-10-13T12:00:00+00:00 
**Source:** Planet PostgreSQL 
**Category:** databases-storage 
**Canonical URL:** https://fosswire.org/news/ming-ying-making-counts-and-the-rest-of-search-really-fast-p.html 

## Executive Summary
How ctid-aware segment partitioning, an inverted DocId map, and bitmap postings accelerated ParadeDB's Wikipedia COUNT queries—then a look at the rest of search, where ParadeDB delivered 10–22x TIN's throughput on filtered and time-sorted Hacker News queries.

## Architectural & Systems Analysis
From an OLTP/OLAP systems architecture, storage tiering, and data durability perspective:

- **Zero-Vendor Lock-in Formats:** Leveraging open specifications (e.g. Parquet, Iceberg) ensures multi-engine interoperability without ingestion lock-in.
- **Vector & In-Memory Throughput:** Modern memory layouts and SIMD-accelerated execution pipelines minimize latency in real-time retrieval.
- **Distributed Resiliency:** Decoupled storage and compute layers enable elastic horizontal scaling with strict ACID guarantees.

## Impact on the Open Ecosystem
Empowers data engineers with open, self-hosted alternatives to monopolistic cloud database providers.