Skip to content

Commit 73493d8

Browse files
committed
Added links on trie data structure
1 parent bcf1911 commit 73493d8

File tree

1 file changed

+6
-2
lines changed

1 file changed

+6
-2
lines changed

chap08_membership_structures/README.md

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11

2-
### The idea
2+
### The idea of *bloom filter*
33
- Making *test membership in a set* **quicker**. That means two things:
44
- Less queries to the *server*, let most of the stuff happen in the *client*
55
- Less interaction <small>(cuz the less operations made by the algorithm)</small> to the *disk*
@@ -11,7 +11,7 @@
1111
2. Used when the data is **really large** and you need search it, whereas small error rate is *accepted*.
1212
3. Is it *in it* or *not*?
1313

14-
### How does it work <small>(my own notes/thoughts)</small>
14+
### How does *bloom filter* work <small>(my own notes/thoughts)</small>
1515
- Stage zero
1616
- Instead of using mostly-used-for-arrays algorithms, we use *fast hash stuff* and *low-cost operations* <small>(like switching `0` and `1` in a *bit array*)</small>.
1717
- But of course, we made some trade-offs, such as, the bits cannot be *removed* and the algorithm won't be *100% correct*.
@@ -55,3 +55,7 @@
5555
3. More on this
5656
- [What are Bloom filters?](https://blog.medium.com/what-are-bloom-filters-1ec2a50c68ff)
5757
- [ Simple Bloom filter implementation in Python 3 (for use with the HIBP password list)](https://gist.github.com/marcan/23e1ec416bf884dcd7f0e635ce5f2724)
58+
- *Trie*
59+
1. [Trying to Understand Tries](https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014) <small>([*Vaidehi Joshi*](https://medium.com/@vaidehijoshi))</small>
60+
2. [An implementation on Github](https://github.com/ZoranPandovski/al-go-rithms/tree/master/data_structures/trie)
61+
3. [Trie on Wikipedia](https://en.wikipedia.org/wiki/Trie)

0 commit comments

Comments
 (0)