Monotonic query
id:
monotonic-query-245-12676626
title:
Monotonic query
text:
In database theory and systems, a monotonic query is one that does not lose any tuples it previously made output, with the addition of new tuples in the database. Formally, a query q over a schema R is monotonic if and only if for every two instances I, J of R, I ⊆ J ⇒ q ( I ) ⊆ q ( J ) (q must be a monotonic function). An example of a monotonic query is a select-project-join query containing only conditions of equality (also known as conjunctive queries). Examples of non-monotonic queries are a
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Monotonic_query
date created:
date modified:
2024-04-16T18:32:12Z
main entity:
{"identifier":"Q6902032","url":"https://www.wikidata.org/entity/Q6902032"}
image:
fields total:
13
integrity:
13