Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

E. F. Codd

dblp:c/EFCodd · also Edgar F. Codd · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1986
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Data models and query languages · 56% Database system architecture and tuning · 35% Information retrieval · 10%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages › relational model
extended relational model
0.021979
Extending the Database Relational Model to Capture More Meaning · ACM Trans. Database Syst. 1979
Extending the Data Base Relational Model to Capture More Meaning (Abstract) · SIGMOD Conference 1979
Data models and query languages › conceptual modeling
semantic data model
0.021979
Extending the Database Relational Model to Capture More Meaning · ACM Trans. Database Syst. 1979
Extending the Data Base Relational Model to Capture More Meaning (Abstract) · SIGMOD Conference 1979
Data models and query languages
relational model
0.021986
Extending the Data Base Relational Model to Capture More Meaning (Abstract) · SIGMOD Conference 1979
An Evaluation Scheme for Database Management Systems that are claimed to be Relational · ICDE 1986
Database system architecture and tuning
database design
0.011979
Extending the Database Relational Model to Capture More Meaning · ACM Trans. Database Syst. 1979
Information retrieval › retrieval models
semantic representation
0.011979
Extending the Database Relational Model to Capture More Meaning · ACM Trans. Database Syst. 1979

Methods — techniques the papers use, named apart from their topics

integrity constraints · 0.0algebraic operators · 0.0
YearPublicationVenuePosition
1986 An Evaluation Scheme for Database Management Systems that are claimed to be Relational
abstract
This article offers basic principles for use in determining how "relational" a DBMS product is — a challenge which faces many buyers today, because almost every vendor is claiming that his DBMS product is "relational". The material is likely to be of interest to vendors also. Some of them may not realize how far from the mark they are.
E. F. Codd
ICDE1
1979 Extending the Data Base Relational Model to Capture More Meaning (Abstract)
abstract
During the last three or four years several investigators have been exploring 'semantic models' for formatted data bases. The intent is to capture (in a more or less formal way) more of the meaning of the data, so that data base design can become more systematic and the data base system itself can behave more intelligently. Two major thrusts are clear:1) the search for meaningful units that are as small as possible --- atomic semantics2) the search for meaningful units that are larger than the usual n-ary relation --- molecular semantics.In this paper we propose extensions to the relational model to support certain atomic and molecular semantics. These extensions represent a synthesis of many ideas from the published work in semantic modeling.
E. F. Codd
SIGMOD Conference1
1979 Extending the Database Relational Model to Capture More Meaning
abstract
During the last three or four years several investigators have been exploring “semantic models” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can behave more intelligently. Two major thrusts are clear. In this paper we propose extensions to the relational model to support certain atomic and molecular semantics. These extensions represent a synthesis of many ideas from the published work in semantic modeling plus the introduction of new rules for insertion, update, and deletion, as well as new algebraic operators.
E. F. Codd
ACM Trans. Database Syst.1