Uncertain database

Type of database


title: "Uncertain database" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["data-management", "database-theory"] description: "Type of database" topic_path: "technology/databases" source: "https://en.wikipedia.org/wiki/Uncertain_database" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

::summary Type of database ::

An uncertain database is a kind of database studied in database theory. The goal of uncertain databases is to manage information on which there is some uncertainty. Uncertain databases make it possible to explicitly represent and manage uncertainty on the data, usually in a succinct way.

Formal definition

At the basis of uncertain databases is the notion of possible world. Specifically, a possible world of an uncertain database is a (certain) database which is one of the possible realizations of the uncertain database. A given uncertain database typically has more than one, and potentially infinitely many, possible worlds.

A formalism to represent uncertain databases then explains how to succinctly represent a set of possible worlds into one uncertain database.

Types of uncertain databases

Uncertain database models differ in how they represent and quantify these possible worlds:

  • Incomplete databases are a compact representation of the set of possible worlds – the use of NULL in SQL, arguably the most commonplace instantiation of uncertain databases, is an example of incomplete database model.
  • Probabilistic databases are a compact representation of a probability distribution over the set of possible worlds.
  • Fuzzy databases are a compact representation of a fuzzy set of the possible worlds.

Though mostly studied in the relational setting, uncertain database models can also be defined in other relational models such as graph databases or XML databases.

Incomplete database

The most common database model is the relational model. Multiple incomplete database models have been defined over the relational model, that form extensions to the relational algebra. These have been called Imieliński–Lipski algebras:

  • Relations with NULL values, also called Codd tables
  • c-tables
  • v-tables

Example

The following table is a relation of an incomplete database, described in the formalism of NULL values: ::data[format=table]

idNameSalary
1Alice10,000
2Bob
3Charlie
::

There are infinitely many possible worlds for this incomplete database, obtained by replacing the "NULL" values with concrete values. For instance, the following relation is a possible world:

::data[format=table]

idNameSalary
1Alice10,000
2Bob8,000
3Charlie12,000
::

References

References

  1. (2009). "Managing and Mining Uncertain Data".
  2. (1984-09-20). "Incomplete Information in Relational Databases". Journal of the ACM.
  3. (1995). "Foundations of Databases". [[Addison-Wesley]].
  4. (2011). "Probabilistic Databases". Synthesis Lectures on Data Management.
  5. Petry, Frederick E.. (1996). "Fuzzy Databases". International Series in Intelligent Technologies.
  6. (2018). "On Uncertain Graphs". Synthesis Lectures on Data Management.
  7. (2007-06-11). "Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems". Association for Computing Machinery.

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::

data-managementdatabase-theory