Comparing Two Bottom-up Database Design Methods

نویسندگان

  • Hsiang-Jui Kung
  • Hui-Lien Tung
چکیده

Bottom-up database design is a difficult task for novice database designers and is particularly challenging to teach. To address the problem, two methods—textbook and cookbook—have been suggested. The textbook method describes the Codd’s normalization algorithm and data model visualization adopted by most textbooks. The cookbook method illustrates a simple and straightforward normalization algorithm and ER diagram mapping technique proposed by the authors. This paper describes the conceptual framework, experimental design, and results of a laboratory study that employed novice designers to compare the error rates of the two methods (between subjects) at two levels of task complexity. Results indicate that the cookbook method led to significant lower error rates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

9 An Object - Oriented Approach to the Design of Flexible Manufacturing Systems

In this paper a hybrid top-down/bottom-up method that can be viewed as an extension of the traditional dynamic modeling technique using Petri Nets and Parametric Design is presented as an approach to the design of Flexible Manufacturing Systems. The resulting method supports a clear separation of functionality among the design objects by using the ADV/ADO objectoriented design framework. Thus, ...

متن کامل

Methodology of Schema Integration for New Database Applications: A Practitioner's Approach

A practitioner’s approach to integrate databases and evolve them so as to support new database applications is presented. The approach consists of a joint bottom-up and top-down methodology; the bottom-up approach is taken to integrate existing database using standard schema integration techniques(B-Schema), the top-down approach is used to develop a database schema for the new applications(T-S...

متن کامل

Query Evaluation in Recursive Databases: Bottom-up and Top-down Reconciled

It is desirable to answer queries' posed to deductive databases by computing fixpoints because such computations are directly amenable to set-oriented fact processing. However, the classical fixpoint procedures based on bottom-up processingthe naive and semi-naive methodsare rather primitive and often inefficient. In this article, we rely on bottom-up meta-interpretation for formalizing a new f...

متن کامل

Deductive and Object-Oriented Databases

It is desirable to answer queries posed to deductive databases by computing fix-points because such computations are directly amenable to set-oriented fact processing. However, the classical fixpoint procedures based on bottom-up reasoning-the naive and semi-naive methods-are rather primitive and often inefficient. In this article, we rely on bottom-up meta-interpretation for formalizing a new ...

متن کامل

Bottom-up Induction of Functional Dependencies from Relations

Data dependencies express the presence of structure in database relations, that can be utilised in the database design process. The discovery of data dependencies can be viewed as an induction process. Like in induction, we can distinguish between topdown approaches and bottom-up approaches. In top-down approach, dependencies are generated and then tested against the given relation. Since each ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007