Fully dynamic distributed search trees can be balanced in O(lg2 N) time

In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the first to be fully scalable, that is, able to both grow and shrink as long as keys are inserted and deleted. We prove that in the worst case a key can be inserted, searched, or deleted with O

• Type: Journal
• Year: 2002
• Where: JPDC
• Authors: Fabio Barillari, Enrico Nardelli, Massimo Pepe
• Keywords: Dictionary Problem, JPDC 2002, Keys, Search Tree