NodeCompressionTable
NodeCompressionTable is a compact data structure used to map node identifiers to a dense, reduced set of codes in graph or tree representations. Its primary purpose is to decrease memory usage and improve cache locality when handling large graphs by replacing potentially large or sparse node IDs with small, contiguous codes.
A NodeCompressionTable typically consists of a forward mapping from original node identifiers to compressed codes, and
Construction and usage commonly involve renumbering nodes into a dense range (for example, 0 to N-1) or
Performance characteristics depend on the original identifier space and the chosen encoding method. Benefits include reduced
Applications span large-scale graph databases, network simulations, and graph-serialization formats. Related concepts include node ID remapping,