Geodesic
Dynamic databases with optimal in order time complexity
Diskretnaya Matematika, Tome 20 (2008) no. 3, pp. 89-100

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DM_2008_20_3_a8,
     author = {I. S. Lapshov},
     title = {Dynamic databases with optimal in order time complexity},
     journal = {Diskretnaya Matematika},
     pages = {89--100},
     publisher = {mathdoc},
     volume = {20},
     number = {3},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2008_20_3_a8/}
}
TY  - JOUR
AU  - I. S. Lapshov
TI  - Dynamic databases with optimal in order time complexity
JO  - Diskretnaya Matematika
PY  - 2008
SP  - 89
EP  - 100
VL  - 20
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2008_20_3_a8/
LA  - ru
ID  - DM_2008_20_3_a8
ER  - 
%0 Journal Article
%A I. S. Lapshov
%T Dynamic databases with optimal in order time complexity
%J Diskretnaya Matematika
%D 2008
%P 89-100
%V 20
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2008_20_3_a8/
%G ru
%F DM_2008_20_3_a8
I. S. Lapshov. Dynamic databases with optimal in order time complexity. Diskretnaya Matematika, Tome 20 (2008) no. 3, pp. 89-100. http://geodesic.mathdoc.fr/item/DM_2008_20_3_a8/