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

57.066 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.

Skip trees, an alternative data structure to skip-lists in a concurrent approach

Thumbnail
View/Open
R96-4.ps (234,1Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/82542

Show full item record
Messeguer Peypoch, XavierMés informacióMés informacióMés informació
Document typeResearch report
Defense date1996-01
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 present a new type of search trees isomorphic to Skip-lists, i.e., there is a one-to-one mapping that commutes with the update algorithms. Moreover, as Skip-trees inherit all the race properties from Skip-lists, they can be selected as well as Skip-lists. We design a concurrent algorithm on the fly approach to update skip-trees. Among other advantages, this algorithm is more compressive than the one designed by Pugh for Skip-lists. It is based on the closest relationship between Skip-trees and the family of B-trees that allows the translation of local rules between them. From a practical point of view, although the Skip-list should be in main memory, the Skip-trees can be registered into secondary external storage, therefore it can be likely to analyse its ability to manage Databases.
CitationMesseguer, X. "Skip trees, an alternative data structure to skip-lists in a concurrent approach". 1996. 
URIhttp://hdl.handle.net/2117/82542
Collections
  • Departament de Ciències de la Computació - Reports de recerca [1.104]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
R96-4.ps234,1KbPostscriptView/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