Location-based databases are extensively used by apps like Google Maps, Uber, and Swiggy. We explore the data structures and algorithms that allow spatial or location-based queries, like the quadtree and the Hilbert Curve.
For now, we haven't dived deep into polygon intersections or R-trees.
00:00 Who should watch this?
00:27 Pincodes
01:27 Measurable Distance
02:04 Proximity
02:39 Suitable Data Structures
03:48 2D Representation
05:13 Bits for X,Y axes
06:20 Searching in 2D
07:45 Potential Drawback
08:16 Quad Trees
10:07 Range Queries
10:52 Fractals from 2D to 1D
16:06 Hilbert Curve Examples
21:50 Course Questions
22:15 Thank you!
Looking to ace your following interview? Try this System Design video course! 🔥
interviewready.io
Course chapters:
1) Design an email service like Gmail
2) Design a rate limiter
3) Design an audio search engine
4) Design a calling app like WhatsApp
5) Design and code a payment tracking app like Splitwise
6) Machine coding a cache
7) Low-level design of an event bus
The chapters have architectural diagrams and capacity estimates, along with subtitled videos. Use the 'HELLOWORLD' code to get an exclusive discount.
References:
Google S2: blog.christianperone.com/2015...
Hilbert Curve: • Hilbert's Curve: Is in...
Fractals: • Fractals are typically...
System Design Playlist: • System Design for Begi...
Segment Trees: • Segment Trees explaine...
Z-order curve: en.wikipedia.org/wiki/Z-order...
You can follow me on:
LinkedIn: / gaurav-sen-56b6a941
Twitter: / gkcs_
Негізгі бет Designing a location database: QuadTrees and Hilbert Curves
Пікірлер: 309