Implementation and evaluation of a browsing algorithm for design applications

Author

Udagawa, Yosihisa

Author_Institution

Mitsubishi Electr. Corp., Kanagawa, Japan

fYear

1991

fDate

8-12 Apr 1991

Firstpage

70

Lastpage

79

Abstract

The implementation and evaluation of an extended relational database called ADAM (advanced database abstraction mechanism) are discussed. A browsing algorithm is developed for composite objects to support reuse of the objects. The algorithm takes advantage of aggregation hierarchies to select related composite objects and to order them based on the two measures, i.e. the relative difference of matching components (RDMC) and the number of nonmatching components (NNC). The algorithm has been implemented and various kinds of experiments have been carried out with a standard integrity constraint database. The results show that the CPU time roughly linearly depends on the number of selected objects. Around 90% of the CPU time is consumed in calculating RDMC and NNC. RDMC is more sensitive to retrieval conditions than NNC

Keywords

data integrity; relational databases; ADAM; CPU time; aggregation hierarchies; browsing algorithm; composite objects; design applications; extended relational database; number of nonmatching components; relative difference of matching components; standard integrity constraint database; Algorithm design and analysis; Application software; CADCAM; Computer aided manufacturing; Data engineering; Design automation; Graphics; Information systems; Relational databases; User interfaces;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1991. Proceedings. Seventh International Conference on

Conference_Location

Kobe

Print_ISBN

0-8186-2138-9

Type

conf

DOI

10.1109/ICDE.1991.131454

Filename

131454