倒排索引遍历被证明为 P-完全问题 The P-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs

精读摘要

现代 AI 智能体越来越依赖搜索基础设施执行复杂的神经符号推理工作流，这些工作流常编译成深度嵌套、非单调的布尔查询。但标准倒排索引查询策略在应对这类结构时面临严重的理论极限：有状态迭代器模型（逐文档处理，DAAT）在结构上受限于 NC¹ 公式求值，展开查询时最坏情况出现 O(2^|Q|) 的指数爆炸。这提示搜索系统设计需要新的算法路径。 Modern AI agents increasingly rely on search infrastructure to execute complex neuro-symbolic reasoning workflows that compile into deeply nested, non-monotonic Boolean queries. Standard inverted-index evaluation strategies face severe theoretical limits on such structures: stateful Document-at-a-Time iterator models are structurally bounded by NC1 formula evaluation, suffering worst-case exponential blowup in query complexity. New algorithmic paths are needed for search system design.