Apple proves Boolean query DAGs are P-complete, runs one in 0.8s
Apple research proves that evaluating Boolean query DAGs over an inverted index is P-complete. Its ComputePN algorithm ran a 500-node query across 8.8 million MS MARCO passages in 0.8 seconds, on logic that broke a standard Lucene parser.
Read More