Nested Record Query Index

Problem

Given a list of records where each record is a nested dictionary, implement a function that preprocesses the records and answers equality-based search queries efficiently. Each query is a dictionary mapping dot-separated field paths (such as "user.name" or "meta.region") to required values. Return the list of record IDs that satisfy all query conditions.

Constraints

• 1 <= len(records) <= 10^4
• Each record contains a unique integer id
• Nested depth is at most 5
• Each query contains 1 to 10 equality filters
• Field values used in queries are strings, integers, or booleans