Database Paper Browser

Back to papers

Relational Algebras, Logic, And Functional Programming

Summary: Relational algebra ↔ functional language equivalence enables higher-order relations and recursive definitions. Higher-order data structures as recursive relations; enables DB tech within applicative languages; signals 5th-generation data management. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2259
Venue
SIGMOD
Year
1984
Pagerank
4.1945683e-05
Overall Rank
13,038 | 9.30%
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 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
12 The Functional Data Model and the Data Language DAPLEX 1979 SIGMOD 0.0011248121
422 Non First Normal Form Relations To Represent Hierarchically Organized Data 1984 PODS 0.00023677809
Previous Page 1 / 1 Next

Semantically Similar Papers