Thumbnail
Access Restriction
Subscribed

Author Stanfel, Larry E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Double chaining ♦ Information retrieval ♦ Tree structures ♦ File searching
Abstract In Y.N. Patt's paper “Variable Length Tree Structures Having Minimum Average Search Time” [Comm. ACM 12 (Feb. 1969)], the tree structures obtained are not actually optimal with respect to the two-dimensional chaining devised by Sussenguth in his 1963 paper. This note points out that the result can be described as “optimal” only under the constraint—which Patt implicity assumes—that no key be allowed to prefix another.
Description Affiliation: Colorado State Univ., Fort Colins (Stanfel, Larry E.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 12
Issue Number 10
Page Count 1
Starting Page 582
Ending Page 582


Open content in new tab

   Open content in new tab
Source: ACM Digital Library