| dc.contributor.author |
Lagogiannis, G |
en |
| dc.contributor.author |
Lorentzos, N |
en |
| dc.date.accessioned |
2014-06-06T06:49:48Z |
|
| dc.date.available |
2014-06-06T06:49:48Z |
|
| dc.date.issued |
2010 |
en |
| dc.identifier.issn |
18761100 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.1007/978-90-481-9794-1_1 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/4801 |
|
| dc.subject |
Algorithms |
en |
| dc.subject |
Data structures |
en |
| dc.subject |
Indexing structures |
en |
| dc.subject |
Persistence |
en |
| dc.subject.other |
B trees |
en |
| dc.subject.other |
External memory models |
en |
| dc.subject.other |
Indexing structures |
en |
| dc.subject.other |
Model of computation |
en |
| dc.subject.other |
Persistence |
en |
| dc.subject.other |
Worst case |
en |
| dc.subject.other |
Data structures |
en |
| dc.subject.other |
Indexing (of information) |
en |
| dc.subject.other |
Information science |
en |
| dc.title |
Partially persistent B-trees with constant worst case update time |
en |
| heal.type |
conferenceItem |
en |
| heal.identifier.primary |
10.1007/978-90-481-9794-1_1 |
en |
| heal.publicationDate |
2010 |
en |
| heal.abstract |
A partially persistent B-tree is presented, with a worst case constant update time, in the case that the position of the update is given. This is achieved by the use of the fat node method, which enables the transformation of an ephemeral (a, b) tree with constant update time into a partially persistent tree. Such a structure can be usZeful in persistent databases for applications in which the update time is critical. The model of computation is the external memory model. © 2011 Springer Science+Business Media B.V. |
en |
| heal.journalName |
Lecture Notes in Electrical Engineering |
en |
| dc.identifier.volume |
62 LNEE |
en |
| dc.identifier.doi |
10.1007/978-90-481-9794-1_1 |
en |
| dc.identifier.spage |
3 |
en |
| dc.identifier.epage |
6 |
en |