Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-08-24T04:34:38.214Z Has data issue: false hasContentIssue false
  • English
  • Français

An open ended tree

Published online by Cambridge University Press:  13 May 2003

HENK VANDECASTEELE  and
GERDA JANSSENS
HENK VANDECASTEELE
Affiliation:
PharmaDM, Ambachtenlaan 54D, B-3001 Leuven, Belgium (email: Henk.Vandecasteele@PharmaDM.com)
GERDA JANSSENS
Affiliation:
Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium (email: Gerda.Janssens@cs.kuleuven.ac.be)
Get access Rights & Permissions [Opens in a new window]

Abstract

An open ended list is a well known data structure in Prolog programs. It is frequently used to represent a value changing over time, while this value is referred to from several places in the data structure of the application. A weak point in this technique is that the time complexity is linear in the number of updates to the value represented by the open ended list. In this programming pearl we present a variant of the open ended list, namely an open ended tree, with an update and access time complexity logarithmic in the number of updates to the value.

Keywords

abstract data entrybinary treeISO-compatible Prologlogarithmic time complexity

Information

Type
PROGRAMMING PEARL
Information
Theory and Practice of Logic Programming , Volume 3 , Issue 3 , May 2003 , pp. 377 - 385
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable