Concatenated hash code selection
Copyright policy )Concatenated hash code selection
Summary: An algorithm for selecting the concatenated hash code for partial-match or multiple-attribute retrieval in a hashing scheme is presented. The optimal code length for each attribute is determined with respect to a merit function. Two adjustment algorithms are then presented to find the optimal code length under the integer and nonnegative lower bound constraints. Finally, an algorithm is given for incremental expansion of the concatenated hash code in an extendible hashing scheme.
- Illinois Institute of Technology United States
Data structures, algorithm, Information storage and retrieval of data, optimal code length, multiple- attribute retrieval, partial-match retrieval, hashing, concatenated hash code
Data structures, algorithm, Information storage and retrieval of data, optimal code length, multiple- attribute retrieval, partial-match retrieval, hashing, concatenated hash code
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!