Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras (Q2362811): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Q3992694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of the theory of relational database models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection and join in relational algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Division and renaming in relational algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340207 / rank
 
Normal rank

Revision as of 02:47, 14 July 2024

scientific article
Language Label Description Also known as
English
Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras
scientific article

    Statements

    Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2017
    0 references
    complexity of algorithms
    0 references
    database
    0 references
    table algebra
    0 references

    Identifiers