<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.quizz.vn/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://wiki.quizz.vn/feed.php">
        <title>Wiki.Quizz.vn - data-structures-algorithms</title>
        <description></description>
        <link>https://wiki.quizz.vn/</link>
        <image rdf:resource="https://wiki.quizz.vn/lib/exe/fetch.php?media=wiki:dokuwiki.svg" />
       <dc:date>2026-06-26T16:30:52+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.quizz.vn/doku.php?id=data-structures-algorithms:hash-table-concept&amp;rev=1779576933&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.quizz.vn/doku.php?id=data-structures-algorithms:redis-rabbitmq-kafka-data-structure-comparison&amp;rev=1779577575&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://wiki.quizz.vn/lib/exe/fetch.php?media=wiki:dokuwiki.svg">
        <title>Wiki.Quizz.vn</title>
        <link>https://wiki.quizz.vn/</link>
        <url>https://wiki.quizz.vn/lib/exe/fetch.php?media=wiki:dokuwiki.svg</url>
    </image>
    <item rdf:about="https://wiki.quizz.vn/doku.php?id=data-structures-algorithms:hash-table-concept&amp;rev=1779576933&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2026-05-23T22:55:33+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>hash-table-concept</title>
        <link>https://wiki.quizz.vn/doku.php?id=data-structures-algorithms:hash-table-concept&amp;rev=1779576933&amp;do=diff</link>
        <description>Hash Table Concept

A hash table is a data structure that stores data as key-value pairs and uses a hash function to quickly compute the storage location.

Basic Idea

When we write:
set(&quot;abc&quot;, &quot;xyz&quot;)
Internally, it becomes:
index = hash(&quot;abc&quot;) % array_size
A[index] = (&quot;abc&quot;, &quot;xyz&quot;)</description>
    </item>
    <item rdf:about="https://wiki.quizz.vn/doku.php?id=data-structures-algorithms:redis-rabbitmq-kafka-data-structure-comparison&amp;rev=1779577575&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2026-05-23T23:06:15+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>redis-rabbitmq-kafka-data-structure-comparison</title>
        <link>https://wiki.quizz.vn/doku.php?id=data-structures-algorithms:redis-rabbitmq-kafka-data-structure-comparison&amp;rev=1779577575&amp;do=diff</link>
        <description>Redis vs RabbitMQ vs Kafka (Data Structure Comparison)

1. Redis

Yes — Redis main data structure is:

	*  Hashtable (key → value) stored in RAM

Key idea

	*  Very fast lookup: O(1)
	*  Works like an in-memory dictionary

Mental model

	*  Redis = key-value store (like a dictionary / hashmap)</description>
    </item>
</rdf:RDF>
