Skip to document

Define the ff. terms - Database Management

Database Management
Course

BS Computer Science (BSCS)

225 Documents
Students shared 225 documents in this course
Academic year: 2020/2021
Uploaded by:
Anonymous Student
This document has been uploaded by a student, just like you, who decided to remain anonymous.
University of Perpetual Help System DALTA

Comments

Please sign in or register to post comments.

Preview text

Asynchronous Activity 2.

Define the following terms:

  1. data structure
  • Data Structure can be defined as the group of data elements that provides an efficient way of storing and organizing data in the computer so that it can be used efficiently. Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science i., Operating systems, Compiler Design, Artificial intelligence, Graphics, and many more.
  1. data manipulation
  • A data manipulation language (DML) is a computer programming language used for adding (inserting), deleting, and modifying (updating) data in a database. A DML is often a sublanguage of a broader database language such as SQL, with the DML comprising some of the operators in the language.
  1. data integrity
  • Data integrity is the overall completeness, accuracy, and consistency of data. This can be indicated by the absence of alteration between two instances or between two updates of a data record, meaning data is intact and unchanged.
  • Data integrity is usually imposed during the database design phase through the use of standard procedures and rules. It is maintained through the use of various error- checking methods and validation procedures
  1. primary key
  • A primary key is a special relational database table column (or combination of columns) designated to uniquely identify each table record.
  • A primary key is used as a unique identifier to quickly parse data within the table. A table cannot have more than one primary key.
  1. composite key
  • In database design, a composite key is a candidate key that consists of two or more attributes (table columns) that together uniquely identify an entity occurrence (table row).
  1. domain constraints
  • Domain constraints are the most elementary form of integrity constraint. They are tested easily by the system whenever a new data item is entered into the database.

Asynchronous Activity 2.

  1. entity integrity
  • Entity Integrity constraint uniquely identifies each row in a table. The primary key assures the entity integrity constraint is applied to a table.
  • It also states that value in primary key fields cannot be null.
  1. referential integrity
  • Referential Integrity is an important feature of an application database design. Referential Integrity refers to the ability of the database to keep related data from being corrupted. The data references between tables must remain intact.
  1. insertion anomaly
  • An insertion anomaly is the inability to add data to the database due to the absence of other data. For example, assume Student Group is defined so that null values are not allowed. If a new employee is hired but not immediately assigned to a Student Group, then this employee could not be entered into the database.
  1. deletion anomaly
  • A deletion anomaly is the unintended loss of data due to the deletion of other data
  1. modification anomaly
  • Incorrect data may have to be changed, which could involve many records having to be changed, leading to the possibility of some changes being made incorrectly.
  1. regular entities
  • Regular entities are entities that have an independent existence and generally represent real-world objects such as persons and products. Regular entity types are represented by rectangles with a single line.
  1. weak entities
  • a weak entity is an entity that cannot be uniquely identified by its attributes alone; therefore, it must use a foreign key in conjunction with its attributes to create a primary key.
  1. associative entities
  • Associative entities are connections that describe a relationship between two different entities.
  1. composite attribute
  • An attribute composed of many other attributes is called a composite attribute.

  • a composite attribute is represented by an oval comprising of ovals.

Was this document helpful?

Define the ff. terms - Database Management

Course: BS Computer Science (BSCS)

225 Documents
Students shared 225 documents in this course
Was this document helpful?
Asynchronous Activity 2.1
Define the following terms:
1. data structure
- Data Structure can be defined as the group of data elements that provides an
efficient way of storing and organizing data in the computer so that it can be used
efficiently. Some examples of Data Structures are arrays, Linked List, Stack, Queue,
etc. Data Structures are widely used in almost every aspect of Computer Science i.e.,
Operating systems, Compiler Design, Artificial intelligence, Graphics, and many more.
2. data manipulation
- A data manipulation language (DML) is a computer programming language used for
adding (inserting), deleting, and modifying (updating) data in a database. A DML is
often a sublanguage of a broader database language such as SQL, with the DML
comprising some of the operators in the language.
3. data integrity
- Data integrity is the overall completeness, accuracy, and consistency of data. This can
be indicated by the absence of alteration between two instances or between two
updates of a data record, meaning data is intact and unchanged.
-
- Data integrity is usually imposed during the database design phase through the use
of standard procedures and rules. It is maintained through the use of various error-
checking methods and validation procedures
4. primary key
- A primary key is a special relational database table column (or combination of
columns) designated to uniquely identify each table record.
-
- A primary key is used as a unique identifier to quickly parse data within the table. A
table cannot have more than one primary key.
5. composite key
- In database design, a composite key is a candidate key that consists of two or more
attributes (table columns) that together uniquely identify an entity occurrence (table
row).
6. domain constraints
- Domain constraints are the most elementary form of integrity constraint. They are
tested easily by the system whenever a new data item is entered into the database.