This paper presents a methodology driven by database constraints for designing and developing(database)software applications.Much needed and with excellent results,this paradigm guarantees the highest possible quality...This paper presents a methodology driven by database constraints for designing and developing(database)software applications.Much needed and with excellent results,this paradigm guarantees the highest possible quality of the managed data.The proposed methodology is illustrated with an easy to understand,yet complex medium-sized genealogy software application driven by more than 200 database constraints,which fully meets such expectations.展开更多
Homogeneous binary function products are frequently encountered in the sub-universes modeled by databases,spanning from genealogical trees and sports to education and healthcare,etc.Their properties must be discovered...Homogeneous binary function products are frequently encountered in the sub-universes modeled by databases,spanning from genealogical trees and sports to education and healthcare,etc.Their properties must be discovered and enforced by the software applications managing such data to guarantee plausibility.The(Elementary)Mathematical Data Model provides 17 types of dyadic-based homogeneous binary function product constraint categories.MatBase,an intelligent data and knowledge base management system prototype,allows database designers to simply declare them by only clicking corresponding checkboxes and automatically generates code for enforcing them.This paper describes the algorithms that MatBase uses for enforcing all 17 types of homogeneous binary function product constraint,which may also be employed by developers without access to MatBase.展开更多
Interval index structure plays an important role in constraint database systems. A dynamic interval index structure DM-tree is presented in this paper. The advantage of the DM-tree compared with other interval index ...Interval index structure plays an important role in constraint database systems. A dynamic interval index structure DM-tree is presented in this paper. The advantage of the DM-tree compared with other interval index structures is that the dynamic operations of insertion and deletion can be operated on the new structure. The storage complexity of the tree is O(n), and the query I/O complexity is O(log n+t/B). To improve the performance of the inserting and deleting operations, some methods such as neighbored-constraint and update-late are applied. The I / O complexity of inserting and deleting operations is the same as that in B-tree, i.e., O(log n).展开更多
MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data mod...MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data modeling.Besides their relational-type constraints,they often exhibit mathematical properties that are not covered by the Relational Data Model.This paper presents and discusses the MatBase algorithm that assists database designers in discovering all non-relational constraints associated to them,as well as its algorithm for enforcing them,thus providing a significantly higher degree of data quality.展开更多
文摘This paper presents a methodology driven by database constraints for designing and developing(database)software applications.Much needed and with excellent results,this paradigm guarantees the highest possible quality of the managed data.The proposed methodology is illustrated with an easy to understand,yet complex medium-sized genealogy software application driven by more than 200 database constraints,which fully meets such expectations.
文摘Homogeneous binary function products are frequently encountered in the sub-universes modeled by databases,spanning from genealogical trees and sports to education and healthcare,etc.Their properties must be discovered and enforced by the software applications managing such data to guarantee plausibility.The(Elementary)Mathematical Data Model provides 17 types of dyadic-based homogeneous binary function product constraint categories.MatBase,an intelligent data and knowledge base management system prototype,allows database designers to simply declare them by only clicking corresponding checkboxes and automatically generates code for enforcing them.This paper describes the algorithms that MatBase uses for enforcing all 17 types of homogeneous binary function product constraint,which may also be employed by developers without access to MatBase.
基金Supported by the National Natural Science Foundation of China under grant !Nos.69933010 and69773012.
文摘Interval index structure plays an important role in constraint database systems. A dynamic interval index structure DM-tree is presented in this paper. The advantage of the DM-tree compared with other interval index structures is that the dynamic operations of insertion and deletion can be operated on the new structure. The storage complexity of the tree is O(n), and the query I/O complexity is O(log n+t/B). To improve the performance of the inserting and deleting operations, some methods such as neighbored-constraint and update-late are applied. The I / O complexity of inserting and deleting operations is the same as that in B-tree, i.e., O(log n).
文摘MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data modeling.Besides their relational-type constraints,they often exhibit mathematical properties that are not covered by the Relational Data Model.This paper presents and discusses the MatBase algorithm that assists database designers in discovering all non-relational constraints associated to them,as well as its algorithm for enforcing them,thus providing a significantly higher degree of data quality.
