About: Chase (algorithm)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Chase (algorithm) Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDatabaseAlgorithms, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FChase_%28algorithm%29

The chase is a simple fixed-point algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in database theory as well as in practice.It is used, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design. New applications of the chase in meta-data management and data exchange are still being discovered. The chase process is confluent. There exist implementations of the chase algorithm, some of them are also open-source.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:WikicatDatabaseAlgorithms
rdfs:label	Chase (algorithm) (en)
rdfs:comment	The chase is a simple fixed-point algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in database theory as well as in practice.It is used, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design. New applications of the chase in meta-data management and data exchange are still being discovered. The chase process is confluent. There exist implementations of the chase algorithm, some of them are also open-source. (en)
dcterms:subject	Database algorithms Database theory
Wikipage page ID	18943673 (xsd:integer)
Wikipage revision ID	1046631670 (xsd:integer)
Link from a Wikipage to another Wikipage	Jeffrey D. Ullman Database algorithms David Maier Database theory Functional dependency Database theory Join dependency Alberto O. Mendelzon Alfred Aho Alfred V. Aho Database Fixed-point iteration Projection (relational algebra) Relation (database) Attribute (computing) Jeffrey Ullman Jennifer Widom Serge Abiteboul Victor Vianu Yehoshua Sagiv Relation schema Confluence (rewriting system) dbr:Catriel_Beeri dbr:Boris_Motik dbr:Donatello_Santoro dbr:Efthymia_Tsamoura dbr:George_Konstantinidis dbr:Giansalvatore_Mecca dbr:Michael_Benedikt_(computer_scientist) dbr:Paolo_Papotti dbr:Richard_B._Hull dbr:Tableau_query
sameAs	Chase (algorithm) Chase (algorithm) Chase (algorithm) Chase (algorithm)
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_book
has abstract	The chase is a simple fixed-point algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in database theory as well as in practice.It is used, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design. New applications of the chase in meta-data management and data exchange are still being discovered. The chase has its origins in two seminal papers of 1979, one by Alfred V. Aho, , and Jeffrey D. Ullman and the other by David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv. In its simplest application the chase is used for testing whether the projection of a relation schema constrained by some functional dependencies onto a given decomposition can be recovered by rejoining the projections. Let t be a tuple in where R is a relation and F is a set of functional dependencies (FD). If tuples in R are represented as t1, ..., tk, the join of the projections of each ti should agree with t on where i = 1, 2, ..., k. If ti is not on , the value is unknown. The chase can be done by drawing a tableau (which is the same formalism used in ). Suppose R has attributes A, B, ... and components of t are a, b, .... For ti use the same letter as t in the components that are in Si but subscript the letter with i if the component is not in Si. Then, ti will agree with t if it is in Si and will have a unique value otherwise. The chase process is confluent. There exist implementations of the chase algorithm, some of them are also open-source. (en)
prov:wasDerivedFrom	wikipedia-en:Chase_(algorithm)?oldid=1046631670&ns=0
page length (characters) of wiki page	8386 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Chase_(algorithm)
is Link from a Wikipage to another Wikipage of	Dependency theory (database theory) Equality-generating dependency Embedded dependency Functional dependency Database theory Join dependency Chase Tuple-generating dependency
is Wikipage disambiguates of	Chase
is foaf:primaryTopic of	wikipedia-en:Chase_(algorithm)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software