构建倒排索引搜索引擎

项目概述

本项目实现一个面向 full-text search 的完整系统，核心要解决的问题是 resolving boolean and ranked queries against a corpus that is indexed incrementally as documents arrive。整体由 Tokenizer pipeline、Posting list writer、TF-IDF ranker、Merge segment、Query parser 五个模块组成，每个模块单一职责、可独立测试，最后通过集成测试验证端到端正确性。设计上把 a rare term whose posting list is a single long array that dominates query latency for phrase queries 作为第一类需求先行处理，而非事后再补。

架构与关键决策

数据模型为 an inverted index of term-to-posting-list mappings, segmented by document id range and merged in the background。Tokenizer pipeline 定义其余阶段共同依赖的数据形状并在边界处校验输入；Posting list writer 承载 full-text search 的正确性逻辑；TF-IDF ranker 专门处理 a rare term whose posting list is a single long array that dominates query latency for phrase queries，在失败路径上给出明确的拒绝、重试或降级策略；Merge segment 提供可观测性，每次操作输出带关联 id 的结构化事件；Query parser 在过载时按既定方式降级，避免过载演变为数据损坏。配置与代码分离，使风险变更可经 diff 审阅。

实施与测试

按五个阶段依次实现 Tokenizer pipeline、Posting list writer、TF-IDF ranker、Merge segment、Query parser，每阶段配套聚焦单测。集成测试组合各模块并驱动真实 full-text search 场景：先验证正常路径，再刻意触发 a rare term whose posting list is a single long array that dominates query latency for phrase queries 并断言系统降级而非损坏。所有依赖均在进程内或被桩替换，用例在 CI 中确定可复现。

限制与后续

• 单区域设计，多区域复制超出范围。
• Tokenizer pipeline 默认进程内，未水平共享。
• 无鉴权层，假定部署在强制身份的边缘之后。

代码示例

# setup for inverted-index-search
pnpm init
pnpm add express minisearch stemmer
pnpm add -D typescript tsx vitest

inverted_index_search/
├── src/index.ts
├── src/tokenizer-pipeline.ts
├── src/posting-list-writer.ts
├── tests/inverted_index_search.test.ts
└── package.json

// Tokenizer pipeline: full-text search core
export function tokenizerpipeline(input: TokenizerpipelineInput): TokenizerpipelineResult {
  // Build the tokenizer pipeline that anchors full-text search and defines the core data shape.
  return processTokenizerpipeline(input);
}

// Posting list writer — handles full-text search Add the posting list writer
export class Postinglistwriter {
  constructor(private opts: PostinglistwriterOptions) {}
  async run(ctx: Context): Promise<PostinglistwriterOutput> {
    return this.execute(ctx);
  }
}

// TF-IDF ranker: full-text search stage
export const tfidfranker = (next: Next) => async (req: Request) => {
  const out = await transform(req);
  return next(out);
};

// Merge segment for full-text search
export async function mergesegment(stream: AsyncIterable<Chunk>): Promise<Aggregate> {
  let acc = init();
  for await (const c of stream) acc = merge(acc, c);
  return acc;
}

// Query parser: full-text search finalization
export function queryparser(state: State): Result {
  validate(state);
  return finalize(state);
}

# run the full-text search test suite
pnpm vitest run