RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 2008, Volume 20, Issue 3, Pages 89–100 (Mi dm1016)  

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.

DOI: https://doi.org/10.4213/dm1016

Full text: PDF file (149 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2008, 18:4, 367–379

Bibliographic databases:

UDC: 519.7
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

Citation in format AMSBIB
\Bibitem{Lap08}
\by I.~S.~Lapshov
\paper Dynamic databases with optimal in order time complexity
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 3
\pages 89--100
\mathnet{http://mi.mathnet.ru/dm1016}
\crossref{https://doi.org/10.4213/dm1016}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2467457}
\zmath{https://zbmath.org/?q=an:05618988}
\elib{http://elibrary.ru/item.asp?id=20730256}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 4
\pages 367--379
\crossref{https://doi.org/10.1515/DMA.2008.027}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-53349163566}


Linking options:
  • http://mi.mathnet.ru/eng/dm1016
  • https://doi.org/10.4213/dm1016
  • http://mi.mathnet.ru/eng/dm/v20/i3/p89

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. E. Gasanov, “Information storage and search complexity theory”, J. Math. Sci., 168:1 (2010), 32–48  mathnet  crossref  mathscinet
    2. Snegova E., “Criteria for reducibility of moving objects closeness problem”, Advances in databases and information systems, Lecture Notes in Computer Science, 6295, Springer, Berlin, 2010, 583–586  crossref  isi  scopus
    3. E. A. Snegova, “A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search”, Discrete Math. Appl., 21:5-6 (2011), 701–725  mathnet  crossref  crossref  mathscinet  elib
    4. Romanov A.M., “Disjoint Hamiltonian Cycles in Minimum Distance Graphs of 1-Perfect Codes”, Australas. J. Comb., 69:2 (2017), 215–221  mathscinet  zmath  isi
  • Дискретная математика
    Number of views:
    This page:361
    Full text:112
    References:44
    First page:12

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020