Dynamic databases with optimal in order time complexity

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.