DBScholar

Back to papers

Compatible Attributes In A Universal Relation

Summary: Introduces a tree-based compatibility model for attributes in a universal-relation view to capture role-playing and subset/generalization constraints beyond traditional dependencies. Defines attribute splitting and QUEL-like naming semantics to disambiguate multi-role relationships. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
609
Venue
PODS
Year
1982
Pagerank
0.00010310871
Overall Rank
1,577 | 89.19%
DOI
10.1145/588111.588121

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{beeri_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{COMPATIBLE ATTRIBUTES IN A UNIVERSAL RELATION}},
        url = {https://dl.acm.org/doi/10.1145/588111.588121},
        doi = {10.1145/588111.588121},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Beeri, Catriel and Korth, Henry F.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

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
2,712 Improving Semantic Specification in a Relational Database 1979 SIGMOD 8.2127746e-05
Previous Page 1 / 1 Next

Semantically Similar Papers