Database Paper Browser

Back to papers

On Relational Algebra With Marked Nulls

Summary: Defines necessary and sufficient conditions for extending relational algebra to tables with marked nulls, enabling recursive computation of the "true tuples" of a query result following the expression structure. Proves these conditions match prior axioms and shows the simple "naive" semantics (treat nulls as ordinary values) is correct for projection, positive selection, union, natural join and renaming, coinciding with Reiter's proof-theoretic response. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
699
Venue
PODS
Year
1984
Pagerank
5.9416104e-05
Overall Rank
4,759 | 66.90%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
5,388 Troubles with Nulls, Views from the Users 2022 VLDB 5.5373113e-05
5,857 Making SQL Queries Correct on Incomplete Databases: A Feasibility Study 2016 PODS 5.3000054e-05
8,803 Coping with Incomplete Data: Recent Advances 2020 PODS 4.4470842e-05
8,947 Queries with Arithmetic on Incomplete Databases 2020 PODS 4.4248197e-05
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
3,559 Incomplete Information and Dependencies in Relational Databases 1983 SIGMOD 6.9759696e-05
Previous Page 1 / 1 Next

Semantically Similar Papers