ZIB

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

A note on optimal multiway split trees (1991)

Liu, L. T. ; Chen, Gen-Huey ; Wang, Yue-Li

Springer

BIT 31 (1991), S. 220-229

add to mindlist on the mindlist

Details

ISSN: 1572-9125

Keywords: E.1 ; I.1.2 ; Split tree ; dynamic programming

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: Abstract Split trees are suitable data structures for storing records with different access frequencies. Under assumption that the access frequencies are all distinct, Huang has proposed anO(n 4 logm) time algorithm to construct an (m+1)-way split tree for a set ofn keys. In this paper, we generalize Huang's algorithm to deal with the case of non-distinct access frequencies. The technique used in the generalized algorithm is a generalization of Hesteret al.'s, where the binary case was considered. The generalized algorithm runs inO(n 5 logm) time.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01931282

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit