Category:Database theory

• Database theory

A

• Analytical base table
• Attribute domain

B

• Bidirectionalization

C

• Canonical cover
• Chase (algorithm)
• Closed-world assumption
• Codd's 12 rules
• Conjunctive query

D

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

E

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

F

• Fixed-point logic
• Full table scan

H

• Hyperview (computing)

I

• Imieliński–Lipski algebra
• Incomplete database
• International Conference on Database Theory

K

• Key–value database

M

• Monotonic query

N

• Nested set model

O

• Online aggregation
• Ordered Key-Value Store

P

• PACELC theorem
• Persistent object identifier
• Principle of orthogonal design
• Probabilistic database

Q

• Query evaluation

R

• Range reporting
• Range searching
• Recursive join
• Regular path query
• Relational database
• Relational transducer
• Rollback (data management)

S

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

T

• Temporal database
• Transitive dependency
• Triplestore
• Tuple-generating dependency

U

• Uncertain database
• Universal relation assumption

V

• V-optimal histograms
• View (SQL)

Y

• Yannakakis algorithm