Database Paper Browser

Back to papers

An Efficient Implementation Of A Relational Data Base

Summary: Proposes a dispersed relational representation partitioning a relation into id, value, and optional link across IDENTIFICATION, VALUE, LINK memories. DBM uses modified CAMs with a GMR to store and process value and link parts efficiently. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7700
Venue
VLDB
Year
1985
Pagerank
4.1905499e-05
Overall Rank
13,034 | 9.42%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 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 Extending the Data Base Relational Model to Capture More Meaning 1979 SIGMOD 0.0015464728
Previous Page 1 / 1 Next

Semantically Similar Papers