|
This article is cited in 4 scientific papers (total in 4 papers)
Dynamic databases with optimal in order time complexity
I. S. Lapshov
Abstract:
We investigate the complexity of basic operations over dynamic databases including search, insertion, and deletion of records. We suggest a structure of a database and corresponding algorithms which with the use of two parallel computing processes permit to fulfil these operations over a database in a constant time on the average and with logarithmic complexity in the worst case.
Received: 10.07.2006
Citation:
I. S. Lapshov, “Dynamic databases with optimal in order time complexity”, Diskr. Mat., 20:3 (2008), 89–100; Discrete Math. Appl., 18:4 (2008), 367–379
Linking options:
https://www.mathnet.ru/eng/dm1016https://doi.org/10.4213/dm1016 https://www.mathnet.ru/eng/dm/v20/i3/p89
|
Statistics & downloads: |
Abstract page: | 541 | Full-text PDF : | 224 | References: | 61 | First page: | 12 |
|