Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Theoretical Computer Science
 

Summary: Theoretical
ELSEVIEd
Computer Science
Theoretical Computer Science 220 (1999) 345-362
www.elsevier.com/locate/tcs
Heaps and heapsort on secondary storage *
R. Fadel", K.V. Jakobsen", J. Katajainen",`, J. Teuholab,*
aDepartment of Computing, University of Copenhagen, Universitetsparken 1,
DK-2100 Copenhagen East, Denmark
b Department of Computer Science, University of Turku, Lemminktiisenkatu 14 A,
FIN-20520 Turku, Finland
Abstract
A heap structure designed for secondary storage is suggested that tries to make the best use
of the available buffer space in primary memory. The heap is a complete multi-way tree, with
multi-page blocks of records as nodes, satisfying a generalized heap property. A special feature
of the tree is that the nodes may be partially filled, as in B-trees. The structure is complemented
with priority-queue operations insert and delete-max. When handling a sequence of S operations,
the number of page transfers performed is shown to be 0(x:=,( l/P) logCMip,(N#`)), where
P denotes the number of records fitting into a page, M the capacity of the buffer space in
records, and Ni the number of records in the heap prior to the ith operation (assuming P 2 1

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences