DBScholar

Back to papers

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)

Paper ID
2372
Venue
SIGMOD
Year
1986
Pagerank
0.0001105702
Overall Rank
1,355 | 90.71%
DOI
10.1145/16894.16878

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lehman_sigmod86,
        title = {{Query Processing in Main Memory Database Management Systems}},
        author = {Lehman, Tobin J and Carey, Michael J},
        series = {{SIGMOD} '86},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/16894.16878},
        url = {https://dl.acm.org/doi/10.1145/16894.16878},
        year = {1986}
}

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
7 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.00083340894
80 Hashing Methods and Relational Algebra Operations 1984 VLDB 0.00036536643
152 Multiprocessor Hash-Based Join Algorithms 1985 VLDB 0.00029038365
219 A Study of Index Structures for Main Memory Database Management Systems 1986 VLDB 0.00024293529
Previous Page 1 / 1 Next

Semantically Similar Papers