Database Paper Browser

Back to papers

Relational Queries in a Domain Based DBMS

Summary: Proposes a domain based DBMS (D-model) and its storage organization; relational queries are compiled to D-model object operations. The S set is complete for translating any relational query, enabling fast equijoins and compact intermediates, scalable by parallel architectures. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2225
Venue
SIGMOD
Year
1983
Pagerank
0.00013614041
Overall Rank
1,156 | 91.96%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
741 PicoDBMS: Scaling down Database Techniques for the Smartcard 2000 VLDB 0.00017366278
4,411 An Implementation for Nested Relational Databases 1988 VLDB 6.2071929e-05
5,004 Efficient Main Memory Data Management Using the DBGraph Storage Model 1990 VLDB 5.76478e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4,418 A Domain Based Internal Schema For Relational Database Machines 1982 SIGMOD 6.2027514e-05
5,527 Design Of A Backend Processor For A Data Base Machine 1980 SIGMOD 5.4588959e-05
Previous Page 1 / 1 Next

Semantically Similar Papers