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

DOI10.1007/S10559-017-9901-2zbMATH Open1366.68100OpenAlexW2582754950MaRDI QIDQ2362811FDOQ2362811

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

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

zbMATH Keywords

databasetable algebracomplexity of algorithms

Mathematics Subject Classification ID

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

Cites Work

• A relational model of data for large shared data banks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of the theory of relational database models
• Division and renaming in relational algebras
• Projection and join in relational algebras

Cited In (1)

• Nominative data with ordered set of names

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)