Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras

DOI10.1007/S10559-017-9901-2MaRDI QIDQ2362811zbMATH OpenOpenAlexFDO

Authors V. N. Red'ko, I. S. Kanarskaya, A. S. Senchenko, D. B. Buj

Publication date 14 July 2017

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-017-9901-2

zbMATH Keywords

databasetable algebracomplexity of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• Estimates of the complexity of algorithms of implementation of set-theoretic operations in table algebras
• The time complexity of the addition, removal and comparison of algorithms of table set-theoretic operations
• scientific article; zbMATH DE number 1445373
• scientific article; zbMATH DE number 3954266
• scientific article; zbMATH DE number 742985

Cites work

• scientific article; zbMATH DE number 3874668 (Why is no real title available?)
• scientific article; zbMATH DE number 42986 (Why is no real title available?)
• A relational model of data for large shared data banks
• Division and renaming in relational algebras
• Foundations of the theory of relational database models
• Projection and join in relational algebras

Cited in

(3)

• Estimates of the complexity of algorithms of implementation of set-theoretic operations in table algebras
• Nominative data with ordered set of names
• The time complexity of the addition, removal and comparison of algorithms of table set-theoretic operations

This page was built for publication: Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362811)