Dynamic databases with optimal in order time complexity

DOI10.1515/DMA.2008.027MaRDI QIDQ3184550zbMATH OpenOpenAlexFDO

Authors I. S. Lapshov

Publication date 21 October 2009

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2008.027

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Dyn-FO: A parallel, dynamic complexity class
• Dynamic analysis of some relational databases parameters
• scientific article; zbMATH DE number 219203
• scientific article; zbMATH DE number 4129963
• Dynamic deferred data structuring

Cited in

(8)

• A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
• Numerical database system based on a weighted search tree
• Computing with time-varying data: Sequential complexity and parallel speed-up
• Information storage and search complexity theory
• Average complexity of searching for identical objects in random nonuniform databases
• scientific article; zbMATH DE number 1161259 (Why is no real title available?)
• The time complexity of the addition, removal and comparison of algorithms of table set-theoretic operations
• scientific article; zbMATH DE number 219203 (Why is no real title available?)

This page was built for publication: Dynamic databases with optimal in order time complexity

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