Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Dynamic databases with optimal in order time complexity
-
I. S. Lapshov
Veröffentlicht/Copyright:
30. September 2008
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: 2006-07-10
Published Online: 2008-09-30
Published in Print: 2008-October
© de Gruyter 2008
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Artikel in diesem Heft
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
