Home Page Icon
Home Page
Table of Contents for
Algorithms and Data Structures for Massive Datasets
Close
Algorithms and Data Structures for Massive Datasets
by Emin Tahirovic, Dzejla Medjedovic, Ines Dedovic
Algorithms and Data Structures for Massive Datasets
title
Copyright
contents
front matter
1 Introduction
Part 1 Hash-based sketches
2 Review of hash tables and modern hashing
3 Approximate membership: Bloom and quotient filters
4 Frequency estimation and count-min sketch
5 Cardinality estimation and HyperLogLog
Part 2 Real-time analytics
6 Streaming data: Bringing everything together
7 Sampling from data streams
8 Approximate quantiles on data streams
Part 3 Data structures for databases and external memory algorithms
9 Introducing the external memory model
10 Data structures for databases: B-trees, Bε-trees, and LSM-trees
11 External memory sorting
references
index
inside back cover
Search in book...
Toggle Font Controls
Playlists
Add To
Create new playlist
Name your new playlist
Playlist description (optional)
Cancel
Create playlist
Sign In
Email address
Password
Forgot Password?
Create account
Login
or
Continue with Facebook
Continue with Google
Sign Up
Full Name
Email address
Confirm Email Address
Password
Login
Create account
or
Continue with Facebook
Continue with Google
Prev
Previous Chapter
Algorithms and Data Structures for Massive Datasets
Next
Next Chapter
title
inside front cover
Add Highlight
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click
here
login for view all page.
Day Mode
Cloud Mode
Night Mode
Reset