Jacobsson, M. (1982) Evaluation of a hierarchical bit-vector compression technique. Information Processing Letters 14(4): 147--149. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Storing And Retrieving Keys In A Table By Cross-Indexing - Teahan, Witten (Correct)
....pruned away if they do not contain any 1 bits. This approach is a onedimensional version of the quadtrees and octtrees that are commonly used in graphics, and is attributed to Wedekind H rder (1976) The size of a bitmap tree for uniformly distributed elements can be studied analytically. Jacobsson (1982) derives an expression for the expected size in terms of two parameters, the branching factor b of the tree and the number of levels stored, for it turns out to be economical not to store the top few levels. He concludes that the optimal branching factor is b=3. For densities of 10 or less the ....
Jacobsson, M. (1982) Evaluation of a hierarchical bit-vector compression technique. Information Processing Letters 14(4): 147--149.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC