- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Database algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Database algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Database algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Database algorithms

Algorithms for Recovery and Isolation Exploiting Semantics

In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES is a recovery algorithm designed to work with a no-force, steal database approach; it is used by IBM Db2, Micr

Hi/Lo algorithm

Hi/Lo is an algorithm and a key generation strategy used for generating unique keys for use in a database as a primary key. It uses a sequence-based hi-lo pattern to generate values. It can be used wi

Canonical cover

A canonical cover for F (a set of functional dependencies on a relation scheme) is a set of dependencies such that F logically implies all dependencies in , and logically implies all dependencies in F

Join selection factor

Within computing, author O'Connell defines join selection factor as "[t]he percentage (or fraction) of records in one file that will be joined with records of another file". This can be calculated whe

Query optimization

Query optimization is a feature of many relational database management systems and other databases such as NoSQL and graph databases. The query optimizer attempts to determine the most efficient way t

Write-ahead logging

In computer science, write-ahead logging (WAL) is a family of techniques for providing atomicity and durability (two of the ACID properties) in database systems. A write ahead log is an append-only au

Z-order curve

In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space-filling curve, Morton order or Morton code map multidimensional data to one dimension while pre

Shadow paging

In computer science, shadow paging is a technique for providing atomicity and durability (two of the ACID properties) in database systems. A page in this context refers to a unit of physical storage (

Chase (algorithm)

The chase is a simple fixed-point algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in database theory as well as in practice.It is used, d

© 2023 Useful Links.