返回Google圖書搜尋

Efficient Rebalancing of Chromatic Search Trees

Aarhus universitet. Regionale EDB-centerJoan BoyarKim S. Larsen

出版	Aarhus University, Computer Science Department, 1992
URL	http://books.google.com.hk/books?id=4AQAHAAACAAJ&hl=&source=gbs_api

註釋Abstract: "In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to be postponed completely or partially until after peak working hours. The advantages of the proposal of Nurmi and Soisalon-Soininen are quite significant, but there are definite problems with it. First, they give no explicit upper bound on the complexity of their algorithm. Second, some of their rebalancing operations can be applied many more times than necessary. Third, some of their operations, when removing one problem, create another