NYU Faculty Digital Archive
metadata only
INTRODUCTION TO QUERY PROCESSING
Query processing in databases can be divided into two steps: selecting an 'optimal' evaluation strategy, and executing it. We first present elementary nested loop and relational algebra algorithms for query execution and point out some opportunities for improving their performance. A survey of o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient Path Query Processing in Relational Database Systems#2771
- Branching and circuits : algorithmic techniques for efficient query evaluation#1079594
- Maximizing Accuracy & Efficiency with Oracle JD Edwards#100671
- Domain-Specific Data Quality Analysis Using Technology-Independent Query Templates#411152
- Provenance of HAVING Queries in Semirings with Monus#1108872
Record · ID 933660
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive