Show simple item record

dc.contributor.authorBaeza-Yates, Ricardo
dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.authorMesseguer Peypoch, Xavier
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-11-11T10:26:59Z
dc.date.available2016-11-11T10:26:59Z
dc.date.issued1997-09
dc.identifier.citationBaeza-Yates, R., Gabarro, J., Messeguer, X. "Fringe analysis for parallel MacroSplit insertion algorithms in 2--3 trees". 1997.
dc.identifier.urihttp://hdl.handle.net/2117/96525
dc.description.abstractWe extend the fringe analysis (used to study the expected behavior of balanced search trees under sequential insertions) to deal with synchronous parallel insertions on 2--3 trees. Given an insertion of k keys in a tree with n nodes, the fringe evolves following a transition matrix whose coefficients take care of the precise form of the algorithm but does not depend on k or n. The derivation of this matrix uses the binomial transform recently developed by P. Poblete, J. Munro and Th. Papadakis. Due to the complexity of the preceding exact analysis, we develop also two approximations. A first one based on a simplified parallel model, and a second one based on the sequential model. These two approximated analysis prove that the parallel insertions case does not differ significantly from the sequential case, namely on the terms O(1/n^2).
dc.format.extent12 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-97-38-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherFringe analysis
dc.subject.otherSynchronous parallel insertions
dc.subject.other2--3 trees
dc.titleFringe analysis for parallel MacroSplit insertion algorithms in 2--3 trees
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1874241
dc.description.versionPostprint (published version)
local.citation.authorBaeza-Yates, R.; Gabarro, J.; Messeguer, X.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder