Monotonic query (original) (raw)
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, (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 aggregation queries, or queries with set difference.
| Property | Value |
|---|---|
| dbo:abstract | 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, (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 aggregation queries, or queries with set difference. Identifying whether a query is monotonic can be crucial for query optimization, especially in view maintenance and data stream management. Since the answer set for a monotonic query can only grow as more tuples are added to the database, query processing may be optimized by executing only the new portions of the database and adding the new results to the existing answer set. (en) |
| dbo:wikiPageID | 30104996 (xsd:integer) |
| dbo:wikiPageLength | 2920 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1120047001 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Monotonic_function dbr:Relational_algebra dbc:Database_theory dbr:Conjunctive_query dbr:Database_system dbr:Tuple dbr:Database_theory dbr:Query_optimization |
| dbp:wikiPageUsesTemplate | dbt:Notability dbt:Reflist dbt:Database-stub |
| dct:subject | dbc:Database_theory |
| rdfs:comment | 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, (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 aggregation queries, or queries with set difference. (en) |
| rdfs:label | Monotonic query (en) |
| owl:sameAs | freebase:Monotonic query wikidata:Monotonic query https://global.dbpedia.org/id/4rY3Q |
| prov:wasDerivedFrom | wikipedia-en:Monotonic_query?oldid=1120047001&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Monotonic_query |
| is dbo:wikiPageWikiLink of | dbr:List_of_technology_terms |
| is foaf:primaryTopic of | wikipedia-en:Monotonic_query |