|
Please note that this page does not hosts or makes available any of the listed filenames. You
cannot download any of those files from here.
|
| [TGx]Downloaded from torrentgalaxy.to .txt |
585B |
| 0 |
342.98KB |
| 001. Chapter 1. Introduction.mp4 |
26.79MB |
| 002. Chapter 1. An example How to solve it.mp4 |
16.57MB |
| 003. Chapter 1. How to solve it, take two A book walkthrough.mp4 |
21.42MB |
| 004. Chapter 1. The structure of this book.mp4 |
25.15MB |
| 005. Chapter 1. Latency vs. bandwidth.mp4 |
21.18MB |
| 006. Part 1. Hash-based sketches.mp4 |
6.34MB |
| 007. Chapter 2. Review of hash tables and modern hashing.mp4 |
35.70MB |
| 008. Chapter 2. Usage scenarios in modern systems.mp4 |
36.61MB |
| 009. Chapter 2. Collision resolution Theory vs. practice.mp4 |
31.13MB |
| 010. Chapter 2. Hash tables for distributed systems Consistent hashing.mp4 |
20.50MB |
| 011. Chapter 2. Adding a new noderesource.mp4 |
26.89MB |
| 012. Chapter 3. Approximate membership Bloom and quotient filters.mp4 |
30.55MB |
| 013. Chapter 3. A simple implementation.mp4 |
24.20MB |
| 014. Chapter 3. A bit of theory.mp4 |
17.28MB |
| 015. Chapter 3. Bloom filter adaptations and alternatives.mp4 |
23.54MB |
| 016. Chapter 3. Understanding metadata bits.mp4 |
23.32MB |
| 017. Chapter 3. Python code for lookup.mp4 |
20.93MB |
| 018. Chapter 3. Comparison between Bloom filters and quotient filters.mp4 |
19.65MB |
| 019. Chapter 4. Frequency estimation and count-min sketch.mp4 |
31.50MB |
| 020. Chapter 4. Update.mp4 |
34.40MB |
| 021. Chapter 4. Error vs. space in count-min sketch.mp4 |
19.24MB |
| 022. Chapter 4. Range queries with count-min sketch.mp4 |
35.26MB |
| 023. Chapter 5. Cardinality estimation and HyperLogLog.mp4 |
23.14MB |
| 024. Chapter 5. HyperLogLog incremental design.mp4 |
28.71MB |
| 025. Chapter 5. LogLog.mp4 |
24.68MB |
| 026. Chapter 5. Use case Catching worms with HLL.mp4 |
18.39MB |
| 027. Chapter 5. The effect of the number of buckets (m).mp4 |
25.23MB |
| 028. Part 2. Real-time analytics.mp4 |
5.47MB |
| 029. Chapter 6. Streaming data Bringing everything together.mp4 |
44.66MB |
| 030. Chapter 6. Streaming data system A meta example.mp4 |
23.54MB |
| 031. Chapter 6. Deduplication.mp4 |
28.03MB |
| 032. Chapter 6. Practical constraints and concepts in data streams.mp4 |
28.19MB |
| 033. Chapter 6. Math bit Sampling and estimation.mp4 |
24.69MB |
| 034. Chapter 6. Biased sampling strategy.mp4 |
32.39MB |
| 035. Chapter 7. Sampling from data streams.mp4 |
42.81MB |
| 036. Chapter 7. Reservoir sampling.mp4 |
30.85MB |
| 037. Chapter 7. Biased reservoir sampling.mp4 |
37.65MB |
| 038. Chapter 7. Sampling from a sliding window.mp4 |
38.79MB |
| 039. Chapter 7. Priority sampling.mp4 |
24.02MB |
| 040. Chapter 7. Sampling algorithms comparison.mp4 |
27.34MB |
| 041. Chapter 8. Approximate quantiles on data streams.mp4 |
30.16MB |
| 042. Chapter 8. Approximate quantiles.mp4 |
22.21MB |
| 043. Chapter 8. T-digest How it works.mp4 |
18.48MB |
| 044. Chapter 8. Scale functions.mp4 |
22.26MB |
| 045. Chapter 8. Merging t-digests.mp4 |
29.34MB |
| 046. Chapter 8. Q-digest.mp4 |
30.45MB |
| 047. Chapter 8. Quantile queries with q-digests.mp4 |
40.41MB |
| 048. Part 3. Data structures for databases and external memory algorithms.mp4 |
5.86MB |
| 049. Chapter 9. Introducing the external memory model.mp4 |
36.60MB |
| 050. Chapter 9. Example 1 Finding a minimum.mp4 |
20.10MB |
| 051. Chapter 9. Example 2 Binary search.mp4 |
20.58MB |
| 052. Chapter 9. Optimal searching.mp4 |
30.43MB |
| 053. Chapter 9. External memory model Simple or simplistic.mp4 |
16.45MB |
| 054. Chapter 10. Data structures for databases B-trees, Bε-trees, and LSM-trees.mp4 |
21.03MB |
| 055. Chapter 10. Data structures in this chapter.mp4 |
26.33MB |
| 056. Chapter 10. B-tree balancing.mp4 |
20.34MB |
| 057. Chapter 10. Delete.mp4 |
29.05MB |
| 058. Chapter 10. Math bit Why are B-tree lookups optimal in external memory.mp4 |
22.46MB |
| 059. Chapter 10. Bε-trees.mp4 |
23.71MB |
| 060. Chapter 10. Lookups.mp4 |
31.33MB |
| 061. Chapter 10. Log-structured merge-trees (LSM-trees).mp4 |
30.60MB |
| 062. Chapter 10. LSM-tree cost analysis.mp4 |
19.25MB |
| 063. Chapter 11. External memory sorting.mp4 |
21.47MB |
| 064. Chapter 11. Challenges of sorting in external memory An example.mp4 |
17.03MB |
| 065. Chapter 11. External memory merge-sort (MB-way merge-sort).mp4 |
23.89MB |
| 066. Chapter 11. What about external quick-sort.mp4 |
22.11MB |
| 067. Chapter 11. Finding good enough pivots.mp4 |
29.20MB |
| 1 |
192.75KB |
| 10 |
110.77KB |
| 11 |
508.59KB |
| 12 |
178.06KB |
| 13 |
377.68KB |
| 14 |
158.03KB |
| 15 |
411.64KB |
| 16 |
458.15KB |
| 17 |
51.90KB |
| 18 |
76.17KB |
| 19 |
343.30KB |
| 2 |
92.85KB |
| 20 |
163.96KB |
| 21 |
308.85KB |
| 22 |
465.11KB |
| 23 |
299.38KB |
| 24 |
314.85KB |
| 25 |
486.19KB |
| 26 |
164.61KB |
| 27 |
115.43KB |
| 28 |
218.81KB |
| 29 |
178.71KB |
| 3 |
210.58KB |
| 30 |
280.98KB |
| 31 |
359.58KB |
| 32 |
321.95KB |
| 33 |
326.28KB |
| 34 |
310.11KB |
| 35 |
487.99KB |
| 36 |
109.46KB |
| 37 |
299.17KB |
| 38 |
469.91KB |
| 39 |
475.26KB |
| 4 |
362.37KB |
| 40 |
180.92KB |
| 41 |
365.97KB |
| 42 |
42.70KB |
| 43 |
250.10KB |
| 44 |
301.98KB |
| 45 |
397.27KB |
| 46 |
26.97KB |
| 47 |
80.23KB |
| 48 |
326.94KB |
| 49 |
476.25KB |
| 5 |
396.40KB |
| 50 |
75.64KB |
| 51 |
433.01KB |
| 52 |
508.63KB |
| 53 |
163.36KB |
| 54 |
407.61KB |
| 55 |
358.23KB |
| 56 |
252.09KB |
| 57 |
265.22KB |
| 58 |
16.92KB |
| 59 |
111.96KB |
| 6 |
409.27KB |
| 60 |
228.82KB |
| 61 |
478.98KB |
| 62 |
439.58KB |
| 63 |
47.20KB |
| 64 |
164.42KB |
| 65 |
145.56KB |
| 7 |
303.74KB |
| 8 |
249.11KB |
| 9 |
99.44KB |
| TutsNode.net.txt |
63B |