Amortized constant relaxed rebalancing using standard rotations
type: Item
instance of: scholarly article
title: Amortized constant relaxed rebalancing using standard rotations
zbMATH Open document ID: 0910.68057
author: Kim S. Larsen
published in: Acta Informatica
publication date: 1999-03-29T00:00:00Z
review text: The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. This paper defines the first relaxed binary search tree with amortized constant rebalancing using only standard single or double rotations.
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1186251
zbMATH Keywords: search trees
zbMATH Keywords: amortized constant rebalancing
MaRDI profile type: Publication
full work available at URL: s002360050145
OpenAlex ID: W2082993995
DOI: 10.1007/S002360050145
Recommended article: Constant rebalanced portfolio optimization under nonlinear transaction costs
Recommended article: UNIVERSAL SEMICONSTANT REBALANCED PORTFOLIOS
Recommended article: Computing optimal rebalance frequency for log-optimal portfolios in linear time
Recommended article: Computing optimal rebalance frequency for log-optimal portfolios
Recommended article: A polynomial optimization approach to constant rebalanced portfolio selection
Recommended article: REBALANCE SCHEDULE OPTIMIZATION OF A LARGE SCALE PORTFOLIO UNDER TRANSACTION COST
Recommended article: Rebalancing with Linear and Quadratic Costs
Recommended article: Optimal rebalancing of portfolios with transaction costs
Recommended article: OPTIMAL CONSTANT-REBALANCED PORTFOLIO INVESTMENT STRATEGIES FOR DYNAMIC PORTFOLIO SELECTION
Recommended article: Q5306856
description: scientific article; zbMATH DE number 1186251