Live briefing
Everything about Chase (algorithm)
Database 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, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design. New applications of the chase in meta-data management and data exchange are still being discovered. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Chase (algorithm)A 5-minute orientation
- Skim a recent paper: A new chase-type soft-decision decoding algorithm for Reed-Solomon codesInfluential work since 2022
- Pick up a classic book: We Are the NerdsThe most-reprinted book on the subject
- Read the landmark paper: Fast Chase algorithm with an application in turbo decodingCited 61 times
- Go sideways: Functional dependencyA closely related topic
- Go sideways: Lossless join decompositionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Fast Chase algorithm with an application in turbo decoding
Timing algorithm for bolus chase MR digital subtraction angiography
Adaptive Chase algorithm for block turbo codes
Low-Complexity Decoding of Block Turbo Codes Based on the Chase Algorithm
Cheetah chase algorithm (CCA): a nature-inspired metaheuristic algorithm
An Adaptive Chase-Pyndiah Algorithm for Turbo Product Codes
Efficient Chase‐2 decoding algorithm for linear block codes
A Novel Chase Kötter-Vardy Algorithm
🆕 Influential since 2022
A new chase-type soft-decision decoding algorithm for Reed-Solomon codes
Chase, Pounce, and Escape Optimization Algorithm
An accurate chase-like iterative algorithm for H-matrices
An improved Chase–Pyndiah algorithm in the iterative decoding of turbo product codes
Automatic Detection of Sunspots and Solar Filaments from CHASE Data Based on Improved Simulated Annealing Genetic Algorithm
📚 Books worth reading
We Are the NerdsChristine Lagorio-Chafkin · 2014- 📕Infinite DistractionDominic Pettman · 2015
AI for Game DevelopersDavid M. Bourg, Glenn Seemann · 2004- 📕Java FoundationsJohn Lewis; Peter DePasquale; Joe Chase · 2016
Incomplete data and data dependencies in relational databasesSergio Greco · 2012- 📕Core-Chasing Algorithms for the Eigenvalue ProblemJared L. Aurentz, Thomas Mach · 2018
Analysis of algorithms for finding all spanning trees of a graphStephen Martin Chase · 1970
Tools of the imaginationSusan Piedmont-Palladino · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Functional dependency In relational database theory, a functional dependency (FD) is constraint between two attribute sets, whereby values in one set (the determinant set) determine…
- Lossless join decomposition In database design, a lossless join decomposition is a decomposition of a relation r into relations r1,r2 such that a natural join of the two smaller relations…
- Relational model The relational model (RM) is an approach to managing data using a structure and language consistent with first-order predicate logic, first described in…
- Relational algebra In database theory, relational algebra is a theory that uses algebraic structures for modeling data and defining queries on it with well founded semantics…
- Relational calculus The relational calculus consists of two calculi, the tuple relational calculus and the domain relational calculus, that is part of the relational model…
- Multivalued dependency In database theory, a multivalued dependency is a full constraint between two sets of attributes in a relation. In contrast to the functional dependency…
- Fifth normal form Fifth normal form (5NF), also known as projection–join normal form (PJ/NF), is a level of database normalization designed to remove redundancy in relational…
- Referential integrity Referential integrity is a property of data stating that all its references are valid. In the context of relational databases, it requires that if a value…