Using a text editor, copy the following list of names and scores and save it as a flat comma-separated values file named scores.csv: Name,Score Joe Besser,70 Curly Joe DeRita,0 Larry Fine,80 Curly Howard,65 Moe Howard,100 Shemp Howard,85
Using your desktop database, import scores.csv.
Open the imported table and view the results.
Use a wizard to create a query for the imported table that displays the table in order by score from highest to lowest.
Use a wizard to create a form for the imported table that allows you to view and modify names and scores.
Use a wizard to create a report for the imported table using the query created above that displays the table in order by score from highest to lowest.
Use relational and non-relational databases to compare and contrast what they do and how they work.
A database is a collection of schemas, tables, queries, reports, views and other objects.[3]
A query language is a computer language used to make queries (or questions about data) in databases and information systems.[4]
A database server is a computer program that provides database services to other computer programs or computers as defined by the client–server model.[5]
A database management system (DBMS) is a computer software application that interacts with the user, other applications, and the database itself to capture and analyze data. A general-purpose DBMS is designed to allow the definition, creation, querying, update, and administration of databases.[6]
A database engine (or storage engine) is the underlying software component that a database management system (DBMS) uses to create, read, update and delete data from a database.[7]
A relational database presents data to the user as a collection of related tables with each table consisting of a set of rows and columns.[8]
The schema of a database is its structure described in a formal language supported by the database management system (DBMS). The schema describes the tables, records (rows), fields (columns), and other database objects.[9]
A database table is a collection of related data held in a structured format within a database consisting of fields (columns), and records (rows).[10]
A database row or record represents a single, implicitly structured data item in a table.[11]
A database column or field is a set of data values of a particular simple type, one value for each row of the database.[12]
A primary key uniquely specifies a record within a table. In order for an attribute to be a good primary key it must not repeat.[13]
A foreign key is a field in a relational table that matches the primary key column of another table. The foreign key can be used to cross-reference tables. Foreign keys do not need to have unique values in the referencing relation. [14]
A database constraint restricts the data that can be stored in relations. The two principal rules for the relational model are known as entity integrity and referential integrity.[15]
Semi-structured data does not obey the formal structure of data models associated with relational databases or other forms of data tables. Instead, tags are used to separate data elements indicating records and fields. Examples include XML and JSON.[16]
A NoSQL (originally referring to "non SQL" or "non relational") database provides a mechanism for storage and retrieval of data that is modeled in means other than the tabular relations used in relational databases.[17]
NoSQL database benefits include simplicity and scalability, but lack enforced consistency across the data.[18]
NoSQL data structures include key-value pairs and document databases.[19]
Database tables and indexes may be stored on disk in one of a number of forms, including ordered/unordered flat files and a variety of structured binary files.[20]
Unordered files offer good insertion performance but inefficient retrieval times. Ordered files provide more efficient retrieval but lower insertion efficiency.[21]
A database index is a data structure that improves the speed of data retrieval operations on a database table. Indexes are used to quickly locate data without searching every row in a database table every time a database table is accessed.[22]
A hierarchical database is a data model in which the data is organized into a tree-like structure. This model mandates that each child record has only one parent, whereas each parent record can have one or more child records.[23]
A flat-file database is a database which is stored on its host computer system as an ordinary file.[24]
File-based database engines have limited performance compared to process-based database engines in regard to:[25]
Multiple concurrent users
Scalability
Speed
Variety of data
Databases may employ storage redundancy through replication (with one or more copies) to increase data availability (both to improve performance of simultaneous multiple end-user accesses to a database object, and to provide resiliency in a case of partial failure of a database).[26]