skip to content
A constant update time finger search tree Preview this item
ClosePreview this item

A constant update time finger search tree

Author: Rajeev Raman; Paul Frederick Dietz
Publisher: Rochester, N.Y. : University of Rochester, Dept. of Computer Science, [1989]
Series: University of Rochester.; Department of Computer Science.; Technical report
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Levcopolous and Overmars [LO88] described a search tree in which the time to insert or delete a key was O(1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Kos81, HM82,  Read more...
Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...

WorldCat

Find it in libraries globally
Worldwide libraries own this item

Details

Document Type: Book
All Authors / Contributors: Rajeev Raman; Paul Frederick Dietz
OCLC Number: 23662275
Notes: "December 1989."
Description: 14 pages ; 28 cm.
Series Title: University of Rochester.; Department of Computer Science.; Technical report
Responsibility: Rajeev Raman, Paul Dietz.

Abstract:

Abstract: "Levcopolous and Overmars [LO88] described a search tree in which the time to insert or delete a key was O(1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Kos81, HM82, Tsa85]. Levcopolous and Overmars left open the question of whether a data structure could be designed which allowed updates in constant time and supported fingers. We answer the question in the affirmative by giving an algorithm in the RAM with logarithmic word size."
Retrieving notes about this item Retrieving notes about this item

Reviews

User-contributed reviews

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.