AlgorithmsandDataStructuresforMassiveDatasets
Posted on 01 Dec 09:11 | by AD-TEAM | 21 views
Algorithms-and-Data-Structures-for-Massive-Datasets
Language: English
Files Type: mp4| Size: 1.68 GB
Video: 09:52:37 | 1280X720 | 398 Kbps
Audio: mp4a-40-2 | 125 Kbps | AAC
Genre:eLearning
Videos Files :
001. Chapter 1. Introduction.mp4 (26.79 MB)
002. Chapter 1. An example How to solve it.mp4 (16.57 MB)
003. Chapter 1. How to solve it, take two A book walkthrough.mp4 (21.42 MB)
004. Chapter 1. The structure of this book.mp4 (25.15 MB)
005. Chapter 1. Latency vs. bandwidth.mp4 (21.18 MB)
006. Part 1. Hash-based sketches.mp4 (6.34 MB)
007. Chapter 2. Review of hash tables and modern hashing.mp4 (35.7 MB)
008. Chapter 2. Usage scenarios in modern systems.mp4 (36.61 MB)
009. Chapter 2. Collision resolution Theory vs. practice.mp4 (31.13 MB)
010. Chapter 2. Hash tables for distributed systems Consistent hashing.mp4 (20.5 MB)
011. Chapter 2. Adding a new noderesource.mp4 (26.89 MB)
012. Chapter 3. Approximate membership Bloom and quotient filters.mp4 (30.55 MB)
013. Chapter 3. A simple implementation.mp4 (24.2 MB)
014. Chapter 3. A bit of theory.mp4 (17.28 MB)
015. Chapter 3. Bloom filter adaptations and alternatives.mp4 (23.54 MB)
016. Chapter 3. Understanding metadata bits.mp4 (23.32 MB)
017. Chapter 3. Python code for lookup.mp4 (20.93 MB)
018. Chapter 3. Comparison between Bloom filters and quotient filters.mp4 (19.65 MB)
019. Chapter 4. Frequency estimation and count-min sketch.mp4 (31.5 MB)
020. Chapter 4. Update.mp4 (34.4 MB)
021. Chapter 4. Error vs. space in count-min sketch.mp4 (19.24 MB)
022. Chapter 4. Range queries with count-min sketch.mp4 (35.26 MB)
023. Chapter 5. Cardinality estimation and HyperLogLog.mp4 (23.14 MB)
024. Chapter 5. HyperLogLog incremental design.mp4 (28.71 MB)
025. Chapter 5. LogLog.mp4 (24.68 MB)
026. Chapter 5. Use case Catching worms with HLL.mp4 (18.39 MB)
027. Chapter 5. The effect of the number of buckets (m).mp4 (25.23 MB)
028. Part 2. Real-time analytics.mp4 (5.47 MB)
029. Chapter 6. Streaming data Bringing everything together.mp4 (44.66 MB)
030. Chapter 6. Streaming data system A meta example.mp4 (23.54 MB)
031. Chapter 6. Deduplication.mp4 (28.03 MB)
032. Chapter 6. Practical constraints and concepts in data streams.mp4 (28.19 MB)
033. Chapter 6. Math bit Sampling and estimation.mp4 (24.69 MB)
034. Chapter 6. Biased sampling strategy.mp4 (32.39 MB)
035. Chapter 7. Sampling from data streams.mp4 (42.81 MB)
036. Chapter 7. Reservoir sampling.mp4 (30.85 MB)
037. Chapter 7. Biased reservoir sampling.mp4 (37.65 MB)
038. Chapter 7. Sampling from a sliding window.mp4 (38.79 MB)
039. Chapter 7. Priority sampling.mp4 (24.02 MB)
040. Chapter 7. Sampling algorithms comparison.mp4 (27.34 MB)
041. Chapter 8. Approximate quantiles on data streams.mp4 (30.16 MB)
042. Chapter 8. Approximate quantiles.mp4 (22.21 MB)
043. Chapter 8. T-digest How it works.mp4 (18.48 MB)
044. Chapter 8. Scale functions.mp4 (22.26 MB)
045. Chapter 8. Merging t-digests.mp4 (29.34 MB)
046. Chapter 8. Q-digest.mp4 (30.45 MB)
047. Chapter 8. Quantile queries with q-digests.mp4 (40.41 MB)
048. Part 3. Data structures for databases and external memory algorithms.mp4 (5.86 MB)
049. Chapter 9. Introducing the external memory model.mp4 (36.6 MB)
050. Chapter 9. Example 1 Finding a minimum.mp4 (20.1 MB)
051. Chapter 9. Example 2 Binary search.mp4 (20.58 MB)
052. Chapter 9. Optimal searching.mp4 (30.43 MB)
053. Chapter 9. External memory model Simple or simplistic.mp4 (16.45 MB)
054. Chapter 10. Data structures for databases B-trees, Bε-trees, and LSM-trees.mp4 (21.03 MB)
055. Chapter 10. Data structures in this chapter.mp4 (26.33 MB)
056. Chapter 10. B-tree balancing.mp4 (20.34 MB)
057. Chapter 10. Delete.mp4 (29.05 MB)
058. Chapter 10. Math bit Why are B-tree lookups optimal in external memory.mp4 (22.46 MB)
059. Chapter 10. Bε-trees.mp4 (23.71 MB)
060. Chapter 10. Lookups.mp4 (31.33 MB)
061. Chapter 10. Log-structured merge-trees (LSM-trees).mp4 (30.6 MB)
062. Chapter 10. LSM-tree cost analysis.mp4 (19.25 MB)
063. Chapter 11. External memory sorting.mp4 (21.47 MB)
064. Chapter 11. Challenges of sorting in external memory An example.mp4 (17.03 MB)
065. Chapter 11. External memory merge-sort (MB-way merge-sort).mp4 (23.89 MB)
066. Chapter 11. What about external quick-sort.mp4 (22.11 MB)
067. Chapter 11. Finding good enough pivots.mp4 (29.2 MB)
https://rapidgator.net/file/9a9636160a85b5003f51bd3d7aa56bf1/
https://rapidgator.net/file/6d4b674eeaed335a180d0eaea56ab5f5/
Related News
System Comment
Information
Users of Visitor are not allowed to comment this publication.
Facebook Comment
Member Area
Top News