Testing containment of conjunctive queries under functional and inclusion dependencies (Q1057666): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114685266 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90081-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005032394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences among Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion dependencies and their interaction with functional dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relational model of data for large shared data banks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A normal form for relational databases that is based on domains and keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Conjunctive Queries that Contain Untyped Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The implication problem for functional and inclusion dependencies / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:35, 14 June 2024

scientific article
Language Label Description Also known as
English
Testing containment of conjunctive queries under functional and inclusion dependencies
scientific article

    Statements

    Testing containment of conjunctive queries under functional and inclusion dependencies (English)
    0 references
    0 references
    1984
    0 references
    The relational database model is studied from the point of view of optimization of queries. A brief basic definition of the relational database model, a formal definition of inclusion (IND) and functional (FD) dependencies and the ''key-based'' property are presented (Section 2). Next, the authors show how to test for query containment in nondeterministic polynomial time if the set of dependencies obeys a fixed bound on IND width and either contains no FD or is ''key-based''. The results assume that infinite databases are allowed (Section 3). The following discussion deals with a more practical problem: containment for finite databases (Section 4). Final remarks and a discussion of open problems and directions of future research are added to conclude the article.
    0 references
    functional dependencies
    0 references
    inclusion dependencies
    0 references
    relational database
    0 references
    optimization of queries
    0 references
    query containment
    0 references

    Identifiers