Category:Database theory

• Database theory (computing)

A

• Analytical base table (computing)
• Attribute domain (computing)

B

• Bidirectionalization (computing)

C

• Canonical cover (computing)
• Chase (algorithm) (computing)
• Codd's 12 rules (computing)
• Conjunctive query (computing)

D

• Data cube (computing)
• Data event (computing)
• Data item (computing)
• Database catalog (computing)
• Database design (computing)
• Database dump (computing)
• Database repair (computing)
• Database storage structures (computing)
• Dependency theory (database theory) (computing)

E

• Embedded dependency (computing)
• Entity–attribute–value model (computing)
• Equality-generating dependency (computing)
• Evolutionary database design (computing)
• Exclusive relationship (programming) (computing)

F

• Full table scan (computing)

H

• Hyperview (computing) (computing)

I

• Imieliński-Lipski algebra (computing)
• Imieliński–Lipski algebra (computing)
• International Conference on Database Theory (computing)

K

• Key-value database (computing)
• Key–value database (computing)

M

• Monotonic query (computing)

N

• Nested set model (computing)

O

• Online aggregation (computing)

P

• PACELC theorem (computing)
• Persistent Object Identifier (computing)
• Principle of orthogonal design (computing)
• Probabilistic database (computing)

R

• Range reporting (computing)
• Range searching (computing)
• Recursive join (computing)
• Relational database (computing)
• Rollback (data management) (computing)

S

• Single Table Inheritance (computing)
• Supra-entity (computing)
• Symposium on Principles of Database Systems (computing)

T

• Temporal database (computing)
• Transitive dependency (computing)
• Triplestore (computing)
• Tuple-generating dependency (computing)

U

• Universal relation assumption (computing)

V

• V-optimal histograms (computing)
• View (SQL) (computing)