The P-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs

Researchers analyze the complexity of evaluating Boolean query DAGs over inverted indices, proving the problem is P-Complete. They propose ComputePN, an algorithm that efficiently evaluates these queries by avoiding exponential blowup and universal scan penalties.