Property Management Support Retrieval Architecture — Setting Query Limits for PDF Answers A developer outlined a bounded retrieval architecture for property-management support knowledge bases, arguing that RAG pipelines should enforce explicit query limits — maximum vector candidates, reranked passages, context tokens, and a retrieval deadline — kept in configuration so tests exercise the same constraints as production. The design enforces candidate limits in the adapter and token limits before generation, emitting reasons like candidate_limit or deadline with query and source IDs rather than silently truncating. The writeup warns that duplicate or superseded policy PDFs can produce conflicting answers, and recommends logging source IDs, rejecting superseded material, and escalating to human review when effective dates are missing. Short answer: for a customer-support knowledge base, use a retrieval architecture with hard, observable query limits, then spend that budget on the smallest set of PDF passages that can answer a property manager's question. A bounded retriever is easier to debug and cheaper to operate than a search call that keeps expanding until a prompt looks full. The data flow is straightforward: extract text from lease guides, maintenance policies, and resident notices; split it into passages with source and page metadata; retrieve candidates for the incoming question; and give only an authorized, bounded context to the generator. Retrieval-Augmented Generation RAG joins a retriever with a generator, so the answer can use evidence outside the generator's fixed training data. The boundary between those stages is where query limits belong. I care about this boundary because a support corpus grows quietly. One month it is 400 PDFs; six months later it is years of policy revisions, duplicate move-in packets, and scanned addenda. A larger top-k feels safe until latency, token use, and irrelevant passages become the actual incident. Treat a query limit as a contract, not a single integer. Define a maximum number of vector candidates, a maximum number of reranked passages, a maximum context-token allowance, and a deadline for the complete retrieval stage. Keep the values in configuration so a test can exercise the same limits as production. Here is a small TypeScript shape for that contract. It does not depend on a particular search product; the adapter can call a local index or an HTTP service. type QueryBudget = { candidateLimit: number; passageLimit: number; contextTokens: number; deadlineMs: number; }; type SupportQuery = { text: string; propertyId: string; budget: QueryBudget; }; type Passage = { text: string; sourceId: string; page: number; score: number; }; interface Retriever { retrieve query: SupportQuery, signal: AbortSignal : Promise