Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

58.898 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Self-organization and evolution on large computer data structures

Thumbnail
View/Open
R98-61.pdf (118,0Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/84913

Show full item record
Gabarró Vallès, JoaquimMés informacióMés informacióMés informació
Roselló Saurí, LlorençMés informació
Document typeResearch report
Defense date1998-12
Rights accessOpen Access
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
Abstract
We study the long time evolution of a large data structure while inserting new items. It is implemented using a well known computer science approach based on 2-3 trees. We have seen self-organized critical behavior on this data structure. To tackle this problem we have introduced and studied experimentally three statistical magnitudes: the stress of a tree, the sequence of jump points and the distribution of subtrees inside a tree. The stress measures the amount of free space inside the 2-3 tree. When the stress increases some part of the tree is restructured in a way close to an avalanche. Experimentally we obtain a potential law for stress distribution. When the tree does not have more free space in any internal node, needs to grow up. When this happens, the height of the whole tree increases by one and we have a jump point. Experimentally these points have good expected behavior.A 2-3 tree is composed from a great number of other 2-3 trees called their subtrees. We have studied experimentally the distribution of the different subtrees inside the tree. Finally we analyze these results using simple theoretical models based on fringe analysis, Markov and branching processes. These models give us a quite good description of the long term process.
CitationGabarro, J., Rosello, L. "Self-organization and evolution on large computer data structures". 1998. 
Is part ofLSI-98-61-R
URIhttp://hdl.handle.net/2117/84913
Collections
  • GREC - Grup de Recerca en Enginyeria del Coneixement - Reports de recerca [4]
  • Departament de Matemàtiques - Reports de recerca [394]
  • Departament de Ciències de la Computació - Reports de recerca [1.106]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
R98-61.pdf118,0KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina