Query Processing in Main Memory Database Management Systems
Summary: Proposes an architecture for memory-resident relational DBMS, with costs and priorities distinct from disk-based systems. Evaluates operators; introduces the T-tree for efficient selection and join, and favors hashing for projections/joins while sort-merge remains viable. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9 | Implementation Techniques For Main Memory Database Systems | 1984 | SIGMOD | 0.0014279444 |
| 30 | Hashing Methods and Relational Algebra Operations | 1984 | VLDB | 0.00078672446 |
| 78 | Multiprocessor Hash-Based Join Algorithms | 1985 | VLDB | 0.00056413752 |
| 233 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB | 0.00032021526 |
Previous
Page 1 / 1
Next