Database theory

Source: Wikipedia, the free encyclopedia.

Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of

database management systems
.

Theoretical aspects of data management include, among other areas, the foundations of query languages, computational complexity and expressive power of queries, finite model theory, database design theory, dependency theory, foundations of concurrency control and database recovery, deductive databases, temporal and spatial databases, real-time databases, managing uncertain data and probabilistic databases, and Web data.

Most research work has traditionally been based on the relational model, since this model is usually considered the simplest and most foundational model of interest. Corresponding results for other data models, such as object-oriented or semi-structured models, or, more recently, graph data models and XML, are often derivable from those for the relational model.[1]

Database theory helps one to understand the complexity and power of query languages and their connection to

fixpoint logic such as Datalog were studied.[3] The theory also explores foundations of query optimization and data integration. Here most work studied conjunctive queries, which admit query optimization even under constraints using the chase
algorithm.

The main research conferences in the area are the

(ICDT).

See also

References

  1. ^ "A website on the Theoretical Foundations of Data Management".
  2. ^ Aho, A.V. and Ullman, J.D., 1979, January. Universality of data retrieval languages. In Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (pp. 110-119).
  3. ^ Maier, D., Tekle, K.T., Kifer, M. and Warren, D.S., 2018. Datalog: concepts, history, and outlook. In Declarative Logic Programming: Theory, Systems, and Applications (pp. 3-100).

General references

External links