BestHub
Sign in
Tag

hash table

1 views collected around this technical thread.

JD Tech Talk
JD Tech Talk
May 19, 2025 · Backend Development

Detailed Explanation of Java ConcurrentHashMap Source Code: Constructors, put, get, resize, and Concurrency Mechanisms

This article provides an in‑depth analysis of the Java ConcurrentHashMap implementation, covering its constructor logic, hash‑table sizing, the core put and get operations, element counting with addCount, multi‑threaded resizing via transfer, treeification of bins, removal, computeIfAbsent, and the design choices that forbid null keys and values to simplify concurrency handling.

CASConcurrentHashMapJava
0 likes · 36 min read
Detailed Explanation of Java ConcurrentHashMap Source Code: Constructors, put, get, resize, and Concurrency Mechanisms
DataFunSummit
DataFunSummit
Mar 2, 2025 · Artificial Intelligence

Lightweight Algorithm Service Architecture Based on Offline Tag Knowledge Base and Real‑time Data Warehouse

This article presents a lightweight algorithm service solution that combines an offline pre‑computed tag knowledge base with a real‑time data warehouse using Flink, Doris, Hive SQL and Python to achieve short development cycles, agile iteration, low cost, and scalable deployment for classification and clustering tasks.

DorisFlinkalgorithm service
0 likes · 16 min read
Lightweight Algorithm Service Architecture Based on Offline Tag Knowledge Base and Real‑time Data Warehouse
Python Programming Learning Circle
Python Programming Learning Circle
Feb 25, 2025 · Fundamentals

Understanding Hash Tables in Python: Concepts, Operations, and Applications

This article explains the fundamentals of hash tables, covering their definition, advantages, core concepts like hash functions and collision resolution, practical Python dictionary usage with code examples, and common application scenarios such as fast look‑ups, frequency counting, and deduplication.

Data Structurescollision resolutiondictionary
0 likes · 5 min read
Understanding Hash Tables in Python: Concepts, Operations, and Applications
Bilibili Tech
Bilibili Tech
Jan 17, 2025 · Backend Development

NeighborHash: An Enhanced Batch Query Architecture for Real‑time Recommendation Systems

NeighborHash is a distributed batch‑query architecture for real‑time recommendation systems that combines a cache‑line‑optimized hash table—featuring Lodger Relocation, bidirectional cache‑aware probing, and inline‑chaining—with an NVMe‑backed key‑value service, versioned updates, and asynchronous memory‑access chaining to achieve sub‑microsecond, high‑throughput top‑N retrieval.

AMACBatch QueryDistributed Storage
0 likes · 20 min read
NeighborHash: An Enhanced Batch Query Architecture for Real‑time Recommendation Systems
Test Development Learning Exchange
Test Development Learning Exchange
Sep 16, 2024 · Fundamentals

Python dict, set, and frozenset: Common Methods, Subclassing, and Implementation Principles

This article explains Python's dict, set, and frozenset containers, lists their most frequently used methods, demonstrates how to subclass dict and create a container class, and describes the hash‑table implementation details that give these data structures their high performance.

Data StructuresPython__dict__
0 likes · 12 min read
Python dict, set, and frozenset: Common Methods, Subclassing, and Implementation Principles
IT Services Circle
IT Services Circle
Aug 17, 2024 · Fundamentals

Algorithmic Interview Problems: Travel Plan, Homework Scheduling, Flower Bed Beauty, and Simple Hash Table Restoration

This article presents four algorithmic interview problems covering travel scheduling with priority constraints, optimal homework task ordering, maximizing distinct garden beauty scores after a single flip operation, and reconstructing insertion sequences for a linear‑probing hash table, each with detailed analysis, solution ideas, and reference Python code.

algorithmcoding interviewhash table
0 likes · 15 min read
Algorithmic Interview Problems: Travel Plan, Homework Scheduling, Flower Bed Beauty, and Simple Hash Table Restoration
IT Services Circle
IT Services Circle
May 11, 2024 · Fundamentals

Hash Table Summit: Storage Structure, Collision Resolution, Mapping, and Resizing

An imaginative conference narrates how various programming language implementations—Go's map, C++'s unordered_map, Java's HashMap, Python's dict, and C#'s HashTable—discuss storage structures, collision‑resolution strategies, hash‑to‑index mapping, and initial capacity and resizing policies, highlighting their differing algorithms and trade‑offs.

Data StructuresResizingcapacity
0 likes · 9 min read
Hash Table Summit: Storage Structure, Collision Resolution, Mapping, and Resizing
Top Architecture Tech Stack
Top Architecture Tech Stack
Feb 7, 2024 · Fundamentals

Understanding Hash Tables: Concepts, Collision Resolution, and Python Implementations

This article explains the concept of hashing and hash tables, describes their characteristics and common collision‑resolution strategies such as open addressing, linear and quadratic probing, chaining, and rehashing, and provides complete Python implementations including a simple hash class, a dynamic map class, and a custom dictionary.

Data StructuresPythonchaining
0 likes · 13 min read
Understanding Hash Tables: Concepts, Collision Resolution, and Python Implementations
IT Services Circle
IT Services Circle
Sep 22, 2023 · Fundamentals

Overview of Common Data Structures and Algorithms

This article reviews essential data structures such as arrays, linked lists, stacks, queues, hash tables, and trees, explains their characteristics and trade‑offs, and introduces fundamental algorithm categories including sorting, searching, greedy, divide‑and‑conquer, and dynamic programming, with useful visualization links.

AlgorithmsData StructuresLinked List
0 likes · 8 min read
Overview of Common Data Structures and Algorithms
Test Development Learning Exchange
Test Development Learning Exchange
Aug 12, 2023 · Fundamentals

Understanding Python Dictionaries: Definition, Implementation, Operations, and Comprehensions

This article explains what Python dictionaries are, how they are implemented using hash tables, their key characteristics, various ways to create and access them, how to perform add, delete, and update operations, view their contents, and use dictionary comprehensions for concise construction.

CRUDData StructurePython
0 likes · 13 min read
Understanding Python Dictionaries: Definition, Implementation, Operations, and Comprehensions
Top Architect
Top Architect
Oct 30, 2022 · Fundamentals

Understanding Hash Tables: Storage Mechanism, Collisions, and Resolution Techniques

This article explains how hash tables store key‑value pairs as array entries, describes hash collisions when different keys map to the same index, and outlines two common resolution methods—open addressing and chaining—while also providing visual illustrations and practical insights.

Data Structureschainingcollision
0 likes · 4 min read
Understanding Hash Tables: Storage Mechanism, Collisions, and Resolution Techniques
政采云技术
政采云技术
Oct 18, 2022 · Databases

Understanding Redis Internal Data Structures: SDS, Hash Tables, Ziplist, Quicklist, and Skiplist

This article explains Redis's superior performance by detailing its six underlying data structures—Simple Dynamic Strings, hash tables, ziplist, quicklist, skiplist, and integer sets—covering their implementations, memory optimizations, collision handling, and lookup complexities, with code examples and diagrams.

Data StructuresIn-Memory DatabaseRedis
0 likes · 12 min read
Understanding Redis Internal Data Structures: SDS, Hash Tables, Ziplist, Quicklist, and Skiplist
Yiche Technology
Yiche Technology
Jul 18, 2022 · Fundamentals

Deep Dive into Go's Map Implementation: Hash Tables, Hash Functions, and Runtime Mechanics

This article provides a comprehensive analysis of Go's map implementation, covering its hash‑table foundation, key type constraints, hash function characteristics, collision resolution strategies, runtime initialization, internal structures like hmap and bmap, and the various operations for creation, access, update, deletion, and resizing.

Data StructuresGoInitialization
0 likes · 21 min read
Deep Dive into Go's Map Implementation: Hash Tables, Hash Functions, and Runtime Mechanics
HelloTech
HelloTech
Jul 6, 2022 · Databases

Understanding Redis Internal Data Structures: SDS, Linked List, and Dictionary Implementation

The article details Redis’s core low‑level data structures—Simple Dynamic Strings (SDS) with length‑aware headers, a custom doubly linked list for O(1) head/tail access, and a hash‑table dictionary employing MurmurHash, incremental rehashing, and packed headers to optimize memory and performance across versions.

C++Data StructuresDatabase
0 likes · 18 min read
Understanding Redis Internal Data Structures: SDS, Linked List, and Dictionary Implementation
DaTaobao Tech
DaTaobao Tech
Jun 29, 2022 · Frontend Development

Design and Implementation of a Reactive Data System in Tubes

The article presents Tubes, Alibaba’s high‑performance terminal renderer, and argues that a hash‑table‑based reactive data system—tracking dependencies, triggering updates only for changed inputs, and making Tubes idempotent—eliminates manual loop control, reduces developer burden, and delivers up to 1,350× read speed‑up and hundreds of milliseconds faster first‑screen rendering on low‑end devices.

Dependency TrackingFront-end ArchitectureReactive Data
0 likes · 16 min read
Design and Implementation of a Reactive Data System in Tubes
Selected Java Interview Questions
Selected Java Interview Questions
May 12, 2022 · Fundamentals

How Hash Tables Store Data and Resolve Collisions

This article explains the basic structure of hash tables, how keys are mapped to array indices, the problem of hash collisions, and two common resolution strategies—open addressing and chaining—illustrated with diagrams and a concise summary.

Data Structureschainingcollision resolution
0 likes · 3 min read
How Hash Tables Store Data and Resolve Collisions
Python Programming Learning Circle
Python Programming Learning Circle
Apr 7, 2022 · Fundamentals

Understanding Hash Tables and Implementing Them in Python

This article explains the concept of hashing and hash tables, describes their characteristics and collision‑resolution strategies, showcases practical Python implementations with load‑factor handling and resizing, and highlights common applications such as dictionaries and network session tables.

Data Structurescollision resolutiondictionary
0 likes · 13 min read
Understanding Hash Tables and Implementing Them in Python
Python Programming Learning Circle
Python Programming Learning Circle
Feb 14, 2022 · Fundamentals

Python List vs Set: Performance Comparison and Underlying Implementation Details

This article compares the lookup speed of Python lists and sets on large datasets, presents benchmark code and results, and explains why sets are dramatically faster by examining the internal C‑level implementations of list (dynamic array) and set/dict (hash table) including resizing rules and collision‑resolution strategies.

Data StructuresPythondynamic array
0 likes · 13 min read
Python List vs Set: Performance Comparison and Underlying Implementation Details
Python Programming Learning Circle
Python Programming Learning Circle
Jan 24, 2022 · Fundamentals

Comparing Python List and Set Lookup Performance and Their Underlying Implementations

This article benchmarks Python list versus set lookups on large datasets, explains why sets are dramatically faster, and delves into the internal C‑level implementations of list as a dynamic array and set/dict as hash tables, including resizing rules and collision handling.

Data StructuresPythondynamic array
0 likes · 12 min read
Comparing Python List and Set Lookup Performance and Their Underlying Implementations