A balanced search tree with O(1) worst case update time
Acta Informatica
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A constant update time finger search tree
Information Processing Letters
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal finger search trees in the pointer machine
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Design of Dynamic Data Structures
Design of Dynamic Data Structures
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Partially persistent data structures of bounded degree with constant update time
Nordic Journal of Computing
An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
A programming and problem-solving seminar
A programming and problem-solving seminar
New dynamic balanced search trees with worst-case constant update time
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We present two solutions for achieving a partially persistent B-tree with a worst case constant update time, in the case that the position of the update is given. The motivation for this work came from the observation that a known, general approach, which reduces the update cost of partially persistent data structures to a constant, has an inherent weakness concerning partially persistent B-trees, because it creates big nodes that cannot be retrieved from secondary memory in a constant time. Due to this, the I/O complexity of the resulting partially persistent B-tree is affected. Thus, we attack this specific problem, i.e. we do not develop a general approach for all partially persistent data structures. For our objectives, we add partial persistence to an ephemeral B-tree with constant worst case update time, by applying two known general methods, the fat-node and the node-copying method, that transform an ephemeral data structure into a partially persistent. The solution based on node-copying is asymptotically optimal.