Skip to main content
Workforce LibreTexts

3.4: Key Terms

  • Page ID
    45552
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)
    access control
    security-driven restriction of access to ensure that only authenticated users are able to interact with specific resources
    ACID (atomicity, consistency, isolation, and durability)
    characteristics that ensure transactions are fully completed or not executed (atomicity), the database remains accurate and follows its rules (consistency), transactions do not interfere with each other (isolation), and a transaction stays saved even if the system crashes (durability)
    B-tree index
    most common type of index; maintains a balanced tree structure, providing efficient insertion, deletion, and lookup operations
    back end
    part of a software application that handles data, logic, and operations, supporting what users interact with on the front end
    bitmap index
    type of index that uses 0s and 1s to show where a value is in a database
    check constraint
    rule that specifies the value that can be entered into a column
    conceptual design
    creation of a simple model of data for database design, focusing on what is needed and how it is connected
    data cleanliness
    accuracy and consistency of data and the lack of duplicated or missing information
    data consistency
    data remain consistent and accurate across the database
    data independence
    data can be restructured without affecting the programs that use it
    data lake
    type of database that stores large amounts of raw data in their original format until the data are needed
    data life cycle
    stages that data undergo from creation to deletion, ensuring data remain accurate, accessible, and valuable throughout their life cycle
    data redundancy
    duplication of data
    data retrieval
    process of obtaining specific information from a database or storage system
    data warehouse
    type of database that integrates data from various sources and stores them in a combined manner
    database access tool
    provides graphical user interfaces (GUIs) to facilitate database interaction without writing extensive code
    database management system (DBMS)
    software system that manages, stores, and process data, ensuring it is organized, accessible, and secure
    database schema
    structure of tables, including columns and data types
    denormalization
    addition of redundant data for the purpose of making things run faster and meeting specific requirements
    foreign key
    column or set of columns in one table that establishes a relationship with the primary key in another table
    front end
    part of a software application that users interact with, including the design and user interface
    functional dependency
    how one piece of data relates to another within a table
    hash index
    type of index that uses a hash function to map data to a fixed-size table
    indexing
    technique used to improve the speed of data retrieval operations in a database
    integration test
    test to check the interaction between modules
    logical design
    detailed database model that defines tables, columns, primary keys, and foreign keys
    normalization
    technique in the design process where data are organized and stored only once, to eliminate the duplication of data
    NoSQL database (Not Only SQL)
    database that does not use the traditional table structure of SQL databases
    NoSQL database management system
    type of database that provides a mechanism for storing and retrieving data that is not based on the traditional relational database model
    object-oriented database management system (OODBMS)
    database management system that stores data in the form of objects, similar to the way data are represented in object-oriented programming
    orphaned record
    record that references another record that no longer exists
    physical design
    creation of a physical structure from a logical design via actual implementation in the database
    primary key
    unique identifier for each data entry in a database table
    referential constraint
    maintains relationship between tables, making sure that a foreign key in one table matches a primary key in another table
    relational database
    stores data in tables with rows and columns, making it ideal for structured data
    relational database management system (RDBMS)
    database management system that stores and organizes data in a structured way using tables
    requirements analysis
    studying how a business operates to determine what data should be stored and how the data should be used
    semistructured data
    data that have some organization but do not fit neatly into tables
    structured data
    data that are highly organized and easily searchable
    Structured Query Language (SQL)
    standard language used to query and manage data in relational databases
    system test
    test to evaluate the overall functionality
    unit test
    test to verify individual functions
    unstructured data
    data that lack predefined structure and require advanced techniques for analysis
    user acceptance testing
    test to ensure the system meets the needs of end users

    This page titled 3.4: Key Terms is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by OpenStax via source content that was edited to the style and standards of the LibreTexts platform.