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

DOI10.1007/s10559-017-9901-2zbMath1366.68100OpenAlexW2582754950MaRDI QIDQ2362811

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

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)

Related Items (1)

Nominative data with ordered set of names

Cites Work

• Unnamed Item
• Unnamed Item
• Division and renaming in relational algebras
• Projection and join in relational algebras
• Foundations of the theory of relational database models
• A relational model of data for large shared data banks

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