Gambit: An Interactive Database Design Tool for Data Structures, Integrity Constraints, and Transactions

1985 ◽  
Vol SE-11 (7) ◽  
pp. 574-583 ◽  
Author(s):  
R.P. Braegger ◽  
A.M. Dudler ◽  
J. Rebsamen ◽  
C.A. Zehnder
Keyword(s):  
Data Structures ◽  
Database Design ◽  
Design Tool ◽  
Integrity Constraints

scholarly journals NORMALIZATION IN DATABASE DESIGN

2018 ◽  
Vol 4 (1) ◽  
pp. 34
Author(s):  
Zainul Efendy
Keyword(s):  
Data Structures ◽  
Query Language ◽  
Database Design ◽  
Simple Solution ◽  
Transaction Model ◽  
Model Form

This research is done to find a simple solution how to find a normalization techniques are appropriate in database design, normalization techniques has several steps of which are forms of abnormal, normalization first, normalization 2st and normalization 3st, only 3 stages rare to be discussed in this study, as in lectures often find their students do not understand to implement this normalization techniques. The results of this study include determining the database data structures, forming sql (structural query language) by using MySQL DBMS and prototype transaction model form.

Methodical Spatial Database Design with Topological Polygon Structures

2012 ◽  
Vol 3 (1) ◽  
pp. 21-30
Author(s):  
Jean Damascène Mazimpaka
Keyword(s):  
Design Process ◽  
Spatial Data ◽  
Spatial Databases ◽  
Early Stage ◽  
Spatial Database ◽  
Database Design ◽  
Integrity Constraints ◽  
Data Types ◽  
Data Infrastructure ◽  
Database Development

Spatial databases form the foundation for a Spatial Data Infrastructure (SDI). For this, a spatial database should be methodically developed to accommodate its role in SDI. It is desirable to have an approach to spatial database development that considers maintenance from the early stage of database design and in a flexible way. Moreover, there is a lack of a mechanism to capture topological relations of spatial objects during the design process. This paper presents an approach that integrates maintenance of topological integrity constraints into the whole spatial database development cycle. The approach is based on the concept of Abstract Data Types. A number of topological classes have been identified and modelling primitives developed for them. Topological integrity constraints are embedded into maintenance functions associated with the topological classes. A semi-automatic transformation process has been developed following the principles of Model Driven Architecture to simplify the design process.

Database Design Based on B

2009 ◽  
pp. 440-456 ◽  
Author(s):  
Elvira Locuratolo
Keyword(s):  
Data Structures ◽  
Formal Method ◽  
Real Life ◽  
Database Design ◽  
Model Transformations ◽  
Software Systems ◽  
The Novel ◽  
Life Changes ◽  
Semantic Data ◽  
Object Models

This chapter is devoted to the integration of the ASSO features in B. ASSO is a database design methodology defined for achieving conceptual schema consistency, logical schema correctness, flexibility in reflecting the real-life changes on the schema and efficiency in accessing and storing information. B is an industrial formal method for specifying, designing, and coding software systems. Starting from a B specification of the data structures and of the transactions allowed on a database, two model transformations are designed: The resulting model, called Structured Database Schema, integrates static and dynamics exploiting the novel concepts of Class-Machine and Specialized Class-Machine. Formal details which must be specified if the conceptual model of ASSO is directly constructed in B are avoided; the costs of the consistency obligations are minimized. Class-Machines supported by semantic data models can be correctly linked with Class-Machines supported by object Models.

Semantic integrity constraints in knowledge-based database design systems

1996 ◽  
Vol 20 (1) ◽  
pp. 1-37 ◽  
Author(s):  
Veda C. Storey ◽  
Heng-Li Yang ◽  
Robert C. Goldstein
Keyword(s):  
Database Design ◽  
Integrity Constraints ◽  
Knowledge Based ◽  
Design Systems

TOWARDS A UNIFORM STRUCTURED REPRESENTATION FOR APPLICATION GENERATION

1991 ◽  
Vol 01 (01) ◽  
pp. 39-55 ◽  
Author(s):  
BRUCE I. BLUM
Keyword(s):  
Data Structures ◽  
Computational Models ◽  
Integrity Constraints ◽  
Static Data ◽  
Efficient Performance ◽  
Operational Models ◽  
Representation Scheme ◽  
Structured Representation

This paper presents an overview of a representation scheme being developed to define static data structures, the restrictions that establish the data model's integrity constraints, and the computational models that operate on the data. The context for this discussion is the role of a uniform structured representation for application generation in which semantically-rich expressions of the application's behavior are transformed into operational models with efficient performance.

Sign in / Sign up

Export Citation Format

Share Document