Aborted Transaction A transaction that does not complete successfully.

No permanent changes are made to a database by an aborted transaction

Abstract Data Type (ADT) A type of object that defines a domain of values and a set of operations designed to work with these values
Abstract Machine A model of the key features of some system without any implementation detail
Abstraction The process of modeling ‘real-world’ concepts in a computational medium
Abstraction Mechanism A mechanism for constructing hierarchies of object classes
Access Mechanism An algorithm embodied in software established for accessing data
Accommodation The process of producing a logical model from a conceptual model
Active Data Dictionary That part of a database system that contains meta-data and is used to control DBMS operations
Active Database System A database system with embedded update functions
Additional Integrity The business rules relevant to some application domain that cannot be specified using the inherent integrity mechanisms of some data model
After-Image Log A history of the new or modified values that result when transactions are applied to a database
Aggregation An abstraction mechanism or process by which an object is used to group together a number of other objects
ANSI/SPARC Architecture In 1975 the American National Standards Institute Standards Planning and Requirements Committee (ANSI-SPARC) proposed a three-level architecture for DBMS
Application Data Model A blue-print of data requirements
Assert An in-built function within Datalog
Assertion Some statement about the characteristics of some UoD. A command in SQL2
Association An abstraction mechanism. Instances of one object are linked to instances of another object
Atomicity A property of a transaction. Atomicity ensures that a transaction either executes completely or is aborted
Attribute A column in a relation. A property of an object or entity
Authorization The facilities available for enforcing database security
Bachman, Charles The creator of the Integrated Data Store (IDS) at General Electric – one of the first DBMS
Behavioral Abstraction That part of an object model concerned with the specification of behavior
Behavioral Inheritance The inheritance of methods
Bit An abbreviation of binary digit – one of the two digits (0 and 1) used in binary notation
Block A group of records treated as a unit on some secondary storage device. A term sometimes treated as a synonym for page
Bottom-up Data Analysis The process of arriving at a logical schema via normalization
Boyce–Codd Normal Form A stronger normal form than third normal form. A BCNF schema is one
in which every functional determinant is a candidate key
Bracketing Notation A shorthand notation for recording the structural detail associated with a relational schema
B-Tree A type of index structure based on balanced trees that allows efficient access to data
Business Area Data Model 32 A data model specified for some business area
Byte A set of binary digits considered as a unit
Candidate Key An attribute or group of attributes capable of acting as a primary key
Cardinality The number of attributes in a relation. The number of instances of an entity associated with some other entity
Chasm Trap A connection trap. A misconception that the relationship between two entities can be generated by traversing other relationships in a data model
Checkpointing A technique used to limit the amount of searching that needs to be performed against a log file in order to carry out recovery effectively. Checkpointing involves force-writing
database buffers to secondary storage at pre-determined intervals
Classic Data Model A term used to encapsulate the hierarchical, network and relational data models. Data models maintaining a fundamental record orientation
Classification involves grouping objects that share common characteristics into an object class
Closed-World Assumption The assumption that the only thing known about some UoD is represented in a database
Closure A property of a query language in which the results from one query can be operated upon by another query
Clustering The process of storing logically related records close together on some secondary storage device
Clustering Index An index used to help maintain the physical clustering of a stored file
CODASYL An acronym for the Conference on Data Systems Languages, a committee that developed standards leading to the Cobol language. The Database Task Group (DBTG) sub-
committee of CODASYL developed specifications on which the network data model is based
CODASYL Data Model See Network Data Model
Commit A command used to make permanent in a database the results of some transaction. A keyword in SQL
Complex Object An object with inherent hierarchical structure
Compound Determinant A determinant consisting of two or more attributes
Conceptual Data Dictionary A data dictionary used to represent a conceptual model
Conceptual Model A model of the ‘real world’ expressed using constructs such as entities, relationships and attributes
Conceptual Modelling The process of developing a conceptual model
Conceptual Schema A level of the ANSI/SPARC architecture
Concurrency The process by which simultaneous access to a database is enabled for multiple users
Concurrent Transactions Two or more transactions that overlap both in terms of time and the data they wish to access
Concurrency Control That facility provided by the kernel of a DBMS that enables concurrency
Connection Trap A set of design problems associated with E-R modelling. See also Fan Trap, Chasm Trap
Consistency That property of a transaction which ensures that the changes caused by a transaction maintain the database as an accurate reflection of its real-world domain
Constraint See Integrity Constraint
Corporate Data Model A data model specified for an entire organisation
Corporate Data Modelling The process of developing a corporate data model
Cost-Based Optimization See Statistically Based Optimisation
Covering Subclass Sub-classes are covering if no other subclasses other than those specified are possible for a particular superclass
CRUD functions Create, Read, Update, Delete functions The process by which a database attempts to represent the properties of
Data Sets of symbols
Data Abstraction objects in the real world
Data Administration That function concerned with the management, planning and documentation of the data resource of some organisation
Data Administrator The person or persons tasked with data administration functions in some organisation
Data Analysis The process involved in producing a logical model of some database system
Data Analyst A term frequently used to described the person or persons tasked with requirements analysis, conceptual modelling and logical database design
Data Control That part of a data model concerned with controlling access to databases and/or facilities of a DBMS
Data Control Language That part of a database sublanguage concerned with data control
Data Definition That part of a data model concerned with defining data structures
Data Definition Language That part of a database sublanguage concerned with data definition
Data Definition Language Compiler That module of a DBMS concerned with updating the system catalog
Data Dictionary A term used either to denote the system tables of some relational DBMS or to denote a more encompassing representation of the data used by some enterprise
Data Independence Buffering data from the processes that use such data
Data Integration A collection of data that displays no redundancy
Data Integrity That part of a data model concerned with specifying the business rules appropriate to some application domain
Data Integrity Language (DIL) That part of a database sublanguage concerned with data integrity
Data Management The process of recording and manipulating data
Data Management Layer A layer of an information technology system
Data Manipulation That part of a data model concerned with the manipulation of data in data structures
Data Manipulation Language (DML) That part of a database sublanguage concerned with data manipulation
Data Mart A small data warehouse
Data Mining The process of extracting previously unknown data from large databases and using it to make organisational decisions
Data Model An architecture for data or a blueprint of data requirements for some application
Data Modelling See Conceptual Modelling
Data Organisation The way in which data is structured on physical storage devices
Data Security The process of ensuring the security of data
Data Sharing The process of ensuring the sharing of data among two or more users or application systems
Data Structure An organised element of some database
Data Subsystem See Data Management Layer
Data Type A definition for the data appropriate to attributes
Data Warehouse A subject-oriented, integrated, time-variant, and non-volatile collection of data used in support of management decision making
Data Warehousing The process of building and managing data warehouses
Database An organised pool of logically related data
Database Administration The activity of managing given database systems
Database Administration Toolkit The set of tools available to the database administrator for administering database systems
Database Administrator A person given responsibility for managing a particular database system or a limited number of database systems
Database Design The process of modelling ‘real-world’ constructs in a database system
Database Development The entire process of constructing some database system
Database Implementation Taking the decisions of physical database design and implementing them in a chosen DBMS
Database Management System A suite of computer software providing the interface between users and a database or databases
Database Manager A module of a DBMS concerned with controlling all access to file manager functions
Database Sublanguage A programming language designed specifically for initiating DBMS functions
Database System A term used to encapsulate the constructs of a data model, DBMS and database
Database Task Group (DBTG) A part of the Cobol programming community chartered to define a standard data definition and data manipulation language
Datalog A variant of Prolog designed for database work
Datum A unit of data
Deadlock The state in which transactions have locked the data needed by each other
Decision Support Database A database used to enable decision making in some organisation
Deductive Data Model The data model based on formal logic
Deductive Databases A database adhering to the deductive data model
Degree The number of tuples in a relation. Also a term used to denote the number of instances relevant to some relationship in the E-R approach
De-Normalisation The process of moving back from a fully normalised data set to prior normal forms to meet performance requirements
Dependency An association between data items
Dependency Diagram See Determinacy Diagram
Dependent Data item A data item whose values are determined by some other data item
Determinacy See dependency
Determinacy Diagram A diagram which documents the determinancies between data items relevant to some application domain. Used in the process of normalisation by synthesis
Determinancy Diagramming The process of producing a determinancy diagram
Determinant A data item which determines the values of some other data item
Difference An operator in the relational algebra. A commutative operator that produces a result from two relations in the tuples in the resulting table that is not present in both input tables
Direct Access Access to data based on a physical address
Disjoint Subclass Subclasses are disjoint if they do not overlap
Disk Manager That part of an operating system which translates logical block requests into physical block identifiers
Distributed Database Design The process of designing a distributed database system
Distributed Database System A distributed database system is a database system which is fragmented or replicated on the various configurations of hardware and software located usually at
different geographical sites within an organisation
Distribution the distribution of processing or data in some database system
Distribution Analysis That part of physical database design concerned with the assignment of processing and/or data to different parts of a computer network
Divide An operator of the relational algebra. Divide takes two tables (one a unary table, the other a binary table) as input and produces one table as output. The resulting table contains tuples
where a match is achieved between rows of the unary table and that of the binary table
Domain A pool of values from which the actual values represented in an attribute of a relation are taken
Domain Integrity An inherent integrity mechanism in the relational data model concerned with enforcing the concepts of domains
Domain Relational Calculus A variant of the relational calculus which acts as the foundation for QBE interfaces
Duplicated Data A data value is duplicated when an attribute has two or more identical values
Durability The property of a transaction that ensures that all changes caused by a transaction persist in time
Encapsulation The packaging together of data and procedures within a defined interface
Entity Some aspect of the ‘real world’ which has an independent existence and can be uniquely identified
Entity Integrity An inherent integrity rule of the relational data model. Every relation must have a primary key and a primary key should be unique and not null
Entity Life Histories A technique used to specify the key events affecting the ‘life’ of some entity
Entity Model A model of the entities, relationships and attributes pertaining to some application
Entity-Relationship Data Model A data model, originally proposed by P.P.S. Chen, which utilises three primary constructs: entities, relationships and attributes
Entity-Relationship Diagramming A technique for graphically representing a conceptual model using constructs from the entity-relationship data model
Equi-Join The equi-join operator is a product with an associated restrict. It combines two tables but only for rows where the values match in the join columns of two tables
E-R Diagramming See Entity-Relationship Diagramming
Event An event is something that happens at a point in time to some defined object
Exclusivity A term used in E-R diagramming to describe the situation in which two or more relationships are mutually exclusive
Extended-Relational Data Model See Post-Relational Data Model
Extension A term used to describe the total set of the data in some database
External Schema A layer in the ANSI/SPARC architecture which describes data and relationships of interest to application systems or end-users
Fact A positive assertion about some UoD
Factbase A collection of facts or positive assertions
Fan Trap A connection trap. The incorrect assumption that an entity linking two other entities will act in the capacity of a data bridge between the entities
Field An element of physical data organisation. A record is a collection of fields
Fifth Normal Form Generally speaking, a fourth normal-form table is in fifth normal form if it cannot be non-loss decomposed into a series of smaller tables
File An element of physical data organisation
File Manager That module of some operating system that translates between the data structures supported by some DBMS and files on disk
Finite State Machine A hypothetical mechanism which can be in one of a finite number of discrete states at one time. Events occur at discrete points in time and cause changes to the machine’s
state
First Normal Form A relation is in first normal form if and only if every non-key attribute is functionally dependent upon the primary key
Foreign Key An attribute of a relation which references the primary key of some other relation
Formalism See Representation Formalism
Fourth Normal Form A relation is in fourth normal form if there are no independent multi-valued dependencies evident in the schema
Fragment Some subset of a database schema
Functional Determinancy Two data items, A and B, are said to be in a functionally determinant or dependent relationship if the same value of data item B always appears with the same value of
data item A
Generalisation An abstraction mechanism or process by which a higher-order object is formed to emphasise the similarities between lower-order objects
Generalisation Hierarchy A hierarchy of object classes linked by generalisation relationships and in which each subclass has only one superclass
Generalisation Lattice A collection of object classes linked by generalisation relationships in which subclasses may have more than one superclass.
Hash A parallel partitioning strategy which involves placing tuples by applying a hashing function to an attribute in each tuple
Hashed File A form of physical organisation in which records are stored in terms of some hash function
Hashing An algorithm for converting logical values to physical addresses
Hierarchical Data Model A data model in which data structures are arranged in hierarchies of parent-child relationships
Homonym the same term used to denote dissimilar objects or entities
Human Activity System Systems consisting of people, conventions and artifacts designed to serve human needs
Identifier Special attributes which serve to uniquely identify the instances of classes
Inclusivity In the E-R approach two relationships are said to be inclusive if one cannot participate in one relationship without participating in the other
Index A mechanism which associates logical values with physical addresses
Index Sequential File A form of file structure in which the sequence of records is maintained by an index
Information Data set in some meaningful context
Information Management System (IMS) One of the earliest DBMS developed at IBM
Information System A system designed to deliver information for some organisation
Information Systems Architecture A specification of the information, information systems and information technology needed by some organisation
Information Systems Planning The process of defining some information systems architecture
Information Technology 29 Technology that includes computers and communications designed to enable information systems
Information Technology System The information technology component of some information system
Inherent Integrity The integrity rules built into some data model
Inheritance The process by which subclasses acquire the attributes, methods and relationships of its superclass
Instance Diagram A representation of the instances of entities and the relationships between such instances
Integrated Data Store (IDS) One of the earliest DBMS developed at General Electric
Integrity Maintaining the logical consistency of some database
Integrity Analysis That part of the physical database design process concerned with the specification of integrity associated with some database application
Integrity Constraint A rule for enforcing integrity
Intension See Schema
Interface (Database) The intervening system between toolkit products and DBMS kernel A layer in the ANSI/SPARC architecture which describes the way in which data is stored and accessed
from secondary storage devices
Interface Subsystem A layer of an information technology system
Internal Schema A layer in the ANSI/SPARC architecture which describes the way in which data is stored and accessed from secondary storage device
Intersection An operator of the relational algebra. Fundamentally the opposite of union. Produces a result table which contains the tuples common to both input tables
ISA See Specialisation
Isolation The property of a transaction that ensures that changes made by one transaction only become available to other transactions after the transaction has completed
Join An operator of the relational algebra which associates data between tables. The operator takes two relations as input and produces one relation as output. See also Equi-Join, Natural Join,
Product
Kernel The core data management facilities of a DBMS such as concurrency control
Key That field or fields within a file used to identify records
Knowledge Information which is related in larger frameworks of information
Legacy Database System A database application that was produced some time in the past but which is critically important to some organisation
Lock A mechanism used in concurrency control. A lock can be set on some database element (such as a row) by a user or application system and prevents other users/systems from updating that
element Logical data dictionaries are used to record data requirements independency
Locking A pessimistic form of concurrency control
Logical Data Dictionary(s) are used to record data requirements independently of how these requirements are to be met
Logical Data Independence Immunity of external schemas to changes in a conceptual schema
Logical Database Design That part of the database design process that produces a logical data model
Logical Model An implementation-independent model
Logical Modelling The process of producing logical models
Logical Organisation The form of data organisation defined in some data model
Manual Record Manager The earliest form of data management embodied in traditional forms of writing on physical media
Mass Deployment Database A database used to deliver data to the desktop
MDSM Minimum Data Set Model. A corporate data model produced for the UK National Health Service in the late 1980s.
Meronymic Relation The range of semantic relations between parts of things and their wholes – after the Greek word ‘meros’ for part.
Message An object-oriented mechanism for activating methods
Meta-Data Data about data. A term particularly used to define the primary property of a data dictionary
Method A defined operation associated with an object
Multi-Database System See Federated Database System
Multimedia A term used to describe the handling of diverse and complex media (sound, video etc.) within computing applications
Multiple Inheritance Multiple inheritance occurs when a given object class may be a subclass of more than one superclass
Multi-User Access Access to databases by multiple users
Multi-Valued Determinancy Data item B is said to be non-functionally dependent on data item A if for every value of data item A there is a delimited set of values for data item B
Natural Join The natural join operator is a product with an associated restrict followed by a project of one of the join columns
Negation The process of denying an assertion or including a negative assertion
Nested Relation An extension to the relational data model proposed for handling complex objects
Network Data Model A data model in which data structures are arranged in network-like structures
Networked Database System Term used to describe the application of Internet technologies in the construction of database systems
Non-Functional Determinancy/Dependency See Multi-Valued Determinancy
Non-Loss Decomposition The approach to normalisation in which a relation is decomposed into a number of other relations but without losing the fundamental associations between data items
Non-Procedural Query Language A query language in which the user can specify what is required and not how to achieve the result
Normal Form A stage in the normalisation process
Normalisation is the process of identifying the logical associations between data items and designing a database which will represent such associations but without suffering from file
maintenance anomalies
Null A special character used in relational systems to represent missing or incomplete information
Object Some real-world thing which can be uniquely identified. A package of data and procedures
Object Class An object class is a grouping of similar objects
Object Life Histories A variation of the entity life history technique applied to objects
Object Model A model of some database expressed using object-oriented constructs
Object Modelling The process of developing an object model
Object-Oriented A term applied to programming languages, design methods and database systems to mean providing support for constructs such as objects, classes, generalisation aggregation
etc.
Object-Oriented Data Model The application of object-oriented principles to data modelling
Object-Relational Data Model See Post-Relational Data Model
OLAP On-line Analytical Processing. A technology that supports complex analytical processing
On-line Network Data Managers A form of data management developed in the mid-1960s reliant on technologies such as teleprocessing monitors and early DBMS
Optionality A rule applied to entities to describe their participation in some relationship
Ordered File A form of physical data organisation in which records in a file are ordered in terms of one or more fields
Outer Join A form of join in which we wish to keep all the rows in one of the input relations whether or not they match
Overlapping Subclass Subclasses that share certain semantics
Parallel Database System Any database system utilizing parallel technology
Parent-Child Relationship A one-to-many relationship between record-types
Partial Subclass Subclasses are partial if other subclasses of a superclass are possible
Participation See Optionality
Passive Data Dictionary A data dictionary external to a database and DBMS built to record the complexities of a given database structure for use by application development staff and database
administrators (DBAs)
Performance That characteristic of a database system concerned with the efficiency of execution and operation
Persistence Characteristic of data in which data is held for some duration
Physical Data Dictionary Physical data dictionaries are used to record data structures. The set of system tables at the heart of a relational DBMS is a physical data dictionary
Physical Data Independence The immunity of the conceptual schema to changes made to the physical schema
Physical Database Design The process of producing a implementation plan for some database
Physical Model An implementation model for some database
Physical Modelling The process of producing a physical model
Physical Organisation That form of data organisation defined in secondary storage devices
Physical Schema See Internal Schema
Physical Symbol System A set of physical patterns that are manipulated to generate intelligent action
Piecemeal Development The process of planning for and developing database systems on an individual basis without concern for aspects of integration
Post-Relational Data Model A term used to encapsulate some of the contemporary extensions to the relational data model such as triggers and stored procedures
Pre-Compiler A software module used prior to the compilation process
Predicate A label applied to some property of a Nod. An element of a Datalog proposition
Primary Key An attribute or group of attributes used to uniquely identify the tuples of a relation
Primary Storage Primary storage includes media that can be directly acted upon by the central processing unit (CPU) of the computer, such as main memory or cache memory. Primary storage
usually provides fast access to relatively low volumes of data
Primitive Data Model A set of data models in objects are represented as record structures grouped in file structures
Procedural Query Language A query language in which a sequence of operations is expressed to satisfy some query
Product Product takes two relations as input and produces as output one relation composed of all the possible combinations of input rows
Production Database Databases used to collect and disseminate operational data
Programmed Record Managers One of the earliest forms of data management developed on stored program computers
Project An operator of the relational algebra. The project operator takes a single relation as input and produces a single relation as output with a subset of the columns from the input relation in
the output relation
Prolog Programming in Logic – an artificial intelligence language
Propagation Constraints A constraint detailing what should happen between two tables linked by referential integrity
Punched-Card Record Managers A form of data management based on the recording and manipulation of data punched onto card
Query A retrieval operation expressed against some database
Query Function A function which retrieves data from a database
Query Language That part of a DML which enables users to express queries against a database
Query Processor That module of a DBMS concerned with the management of queries
Record A physical data structure composed of fields
Record Type A collection of records used to store data relevant to some entity
Recovery The process of copying backed-up data onto a database
Recursive Relationship A relationship in which an entity is related to itself
Redundant Data A data value is redundant if you can delete it without losing information
Referential Integrity An inherent integrity constraint of the relational data model. Referential integrity states that a foreign key value must either refer to a primary key value somewhere in a
database or be null
Relation The primitive data structure in the relational data model
Relational Algebra A candidate for the manipulative part of the relational data model. A procedural query language
Relational Calculus A candidate for the manipulative part of the relational data model based on the predicate calculus. A non-procedural query language
Relational Data Model A data model originally created by E. F. Codd in the 1970s
Relationship An association between entities or objects
Replicate Some copy of the whole of or part of some database
Replication The process of producing replicates
Representation Formalism A set of syntactic and semantic conventions that make it possible to describe things
Requirements Analysis The stage in the database development process involved in the elicitation of data requirements
Requirements Elicitation See Requirements Analysis
Restrict An operator in the relational algebra which extracts rows from an input relation matching some condition
Retract An in-built function in Datalog
Role The distinct meaning applied to a relationship between two entities
Rollback The process of returning to a previous state prior to the execution of some transaction
Row A collection of attribute values in the relational data model
Rules Subsystem A layer of an information technology system
Schema A term used to refer to the intension of some database
Second Normal Form A relation is in second normal form if and only if it is in 1NF and every non-key attribute is fully functionally dependent on the primary key
Secondary Storage Secondary storage cannot be processed directly by the CPU. It hence provides slower access than primary storage but can handle much larger volumes of data. Two of the
most popular forms of secondary storage are magnetic disk and magnetic tape
Security Analysis That part of physical database design concerned with the specification of appropriate authorization rights for a defined user community
Semantic Data Model (SDM) That class of data models that were created with the aim of incorporating more semantics into a data model
Sequential Organisation A form of data organisation in which records are placed in the file in the order in which they are inserted
Set Type A construct in the Network Data Model. A description of a one-to-many relationship between record types
Specialisation is the process of creating a new object class by introducing additional detail to the description of an existing object class
State A state is a moment in the life of an object. Also used to describe a moment in the life of some database
State Transition Diagram A graphic technique for representing a finite state machine
Static Constraint A restriction defined on states
Stored Procedure A package of logic resident within some database system
Strategic Data Planning The process which identifies priorities for data systems, particularly using the construct of a corporate data model
Structural Abstraction That part of object modelling concerned with specifying relationships of association, aggregation and generalisation
Structural Inheritance The inheritance of attributes and relationships between classes
Structured Query Language The standard database sublanguage for relational and non-relational access
Synonym An alternative name provided for a database construct
Synthesis The approach to normalisation based around the process of synthesising a fully normalised schema from an analysis of dependencies
System A coherent set of interdependent components which exists for some purpose, has some stability, and can be usefully viewed as a whole
System Buffer Structure of some operating system used for storing and manipulating temporary data
System Catalog See System Tables
System Tables The meta-database at the heart of a relational DBMS
System/R The first prototype relational DBMS
TableSpace A construct used in some DBMS to collect a series of related tables together
Ternary Relationship A relationship between three or more entities
Third Normal Form A state in which all relations in a database are fully normalised
Three-Valued Logic A modification of traditional two-valued logic (true, false) to accommodate the use of nulls in relational systems
Toolkit (Database) The range of tools either packaged as part of some DBMS or provided by third-party vendors
Top-Down Data Analysis Generally equated with techniques such as E-R diagramming. Data analysis conducted from abstract constructs to schema definition
Totality See Cardinality
Transaction A logical unit of work. A transaction transforms a database from one consistent state to another consistent state
Transaction Analysis A physical database design process in which an analysis of likely transactions impacting upon a database is performed with the aim of designing the database to handle
performance implications
Transaction Log A stored history of the transactions that have impacted on a database over an established period of time
Transaction Management The process of managing multiple transactions impacting upon some database
Transaction Subsystem A layer of an information technology system concerned with managing transactions
Transition A movement between two states
Transition Constraint A rule relating given states of a database
Transitive Determinancy Any situation in which A determines B, B determines C and A also determines C
Trigger An action that is automatically executed by a DBMS when the database achieves a certain state
Tuple See Row
Tuple Relational Calculus A variant of the relational calculus on which languages such as SQL are founded
Two-Phase Locking A protocol that guarantees that transactions are serialisable
UML Unified Modelling Language. An attempt to develop a standard syntax for object modelling
Union An operator in the relational algebra. Union produces a melding of rows from two original input relations having the same structure
Universal Server The use of database systems to support both traditional and non-traditional data
Universe of Discourse Term used to described that aspect of the real world being addressed in a database development effort
Unnormalised Data Set A data set subject to update anomalies
Update Function A standard, application-specific operation performed against some database application
Usage Analysis A physical database design process in which an analysis is made of likely patterns of usage particularly in terms of retrieval operations
View A virtual table or a window into a database. Implemented as a packaged query in SQL. Also a term used to refer to a conceptual model developed for a particular business area
View Integration The process by which a number of application data models are integrated to form one uniform data model
View Modelling The process of modelling the data requirements of a number of distinct areas of the organisation with the aim of later integration
Volatility Term used to describe the degree to which given data structures are subject to update activity
Volume Analysis A physical database design process in which estimates are made as to the volume of data needed to be handled in a database