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.

James P. Davis

dblp:81/5223 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2007
—ORCID · none

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

Databases, data management, data science and information retrieval · 4 · 4 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.

Theoretical computer science
2 papers
Logic in computer science · 100%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%
Databases, data mining, and information retrieval
3 papers
Data models and query languages · 76% Database theory · 13% Data integration and cleaning · 11%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
propositional logic
0.122007
Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis · IEEE Trans. Knowl. Data Eng. 2007
Modeling Semantic Constraints with Logic in the EARL Data Model · ICDE 1989
Requirements engineering and software design
conceptual modeling
0.112007
Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis · IEEE Trans. Knowl. Data Eng. 2007
Data models and query languages
conceptual model
0.012007
Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis · IEEE Trans. Knowl. Data Eng. 2007
Data models and query languages
entity-relationship model
0.011989
Modeling Semantic Constraints with Logic in the EARL Data Model · ICDE 1989
Data models and query languages › conceptual modeling
semantic data model
0.011989
Modeling Semantic Constraints with Logic in the EARL Data Model · ICDE 1989
Database theory › integrity constraints
semantic integrity constraints
0.011989
Modeling Semantic Constraints with Logic in the EARL Data Model · ICDE 1989
Data integration and cleaning › metadata management
data dictionary
0.011988
EDICT - An Enhanced Relational Data Dictionary: Architecture and Example · ICDE 1988

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

graph theory · 0.2boolean logic · 0.2
YearPublicationVenuePosition
2007 Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis
abstract
An important conceptual modeling activity in the development of database, object-oriented and agent-oriented systems is the capture and expression of domain constraints governing underlying data and object states. UML is increasingly used for capturing conceptual models, as it supports conceptual modeling of arbitrary domains, and has extensible notation allowing capture of invariant constraints both in the class diagram notation and in the separately denoted OCL syntax. However, a need exists for increased formalism in constraint capture that does not sacrifice ease of use for the analyst. In this paper, we codify a set of invariant patterns formalized for capturing a rich category of propositional constraints on class diagrams. We use tools of Boolean logic to set out the distinction between these patterns, applying them in modeling by way of example. We use graph notation to systematically uncover constraints hidden in the diagrams. We present data collected from applications across different domains, supporting the importance of "pattern-finding" for n-variable propositional constraints using general graph theoretic methods. This approach enriches UML-based conceptual modeling for greater completeness, consistency, and correctness by formalizing the syntax and semantics of these constraint patterns, which has not been done in a comprehensive manner before now
James P. Davis, Ronald D. Bonnell
IEEE Trans. Knowl. Data Eng.1
1989 Modeling Semantics with Concept Abstraction in the EARL Data Model
James P. Davis, Ronald D. Bonnell
ER1
1989 Modeling Semantic Constraints with Logic in the EARL Data Model
abstract
The authors present a portion of the EARL semantic data model, an augmentation of the entity-relationship model, which uses notational constructs based on propositional logic to allow a greater selection of semantic integrity constraints to be captured during the specification and design of a domain schema. The use of these logic-based constructs is shown to allow more subtle constraints to be specified, so that ambiguity can be reduced when placing constraints on the universe of discourse for database or knowledge-base applications. The notion of what are semantic constraints is discussed, and notational constructs with informal semantics are defined for the EARL model. Several examples are presented.>
James P. Davis, Ronald D. Bonnell
ICDE1
1988 EDICT - An Enhanced Relational Data Dictionary: Architecture and Example
abstract
An approach is described for enhancing an integrated relational data dictionary in order to capture and faithfully present this high-level enterprise schema in a form which can be incorporated directly into the relational database system. The approach, referred to as EDICT, allows for the specification of the enterprise schema for a database as an extension of the data dictionary by storing the schema as a set of normalized tables. In addition, it facilitates more effective use of existing data dictionaries by providing an extended metaschema which describes the structure and use of the dictionary itself.>
James P. Davis, Ronald D. Bonnell
ICDE1