Content deleted Content added
Fixed typo #article-section-source-editor Tags: Mobile edit Mobile app edit iOS app edit |
m Open access bot: hdl updated in citation with #oabot. |
||
Line 22:
* The maximal element in each bucket is stored in the stratified tree and each bucket is stored in the structure as an unordered linked list.
The size of this data structure is bounded by the number of elements stored in the structure that is O(m). The insertion of a new maximal element is done in constant O(1) expected and amortized time. Finally query to find an element can be done in this structure in O(log(log n)) worst-case time.<ref>{{Cite journal |last=Lenhof |first=Hans-Peter |last2=Smid |first2=Michiel |date=1994 |title=Using persistent data structures for adding range restrictions to searching problems |url=http://dx.doi.org/10.1051/ita/1994280100251 |journal=RAIRO - Theoretical Informatics and Applications |volume=28 |issue=1 |pages=25–49 |doi=10.1051/ita/1994280100251 |issn=0988-3754|hdl=11858/00-001M-0000-0014-AD4F-B |hdl-access=free }}</ref>
==Techniques for preserving previous versions==
| |||