YouTube URL algorithm?

by

YouTube uses Base64 encoding to generate IDs for each video.Characters involved in generating Ids consists of

(A-Z) + (a-z) + (0-9) + (-) + (_). (64 Characters).

Using Base64 encoding and only up to 11 characters they can generate 73+ Quintilian unique IDs.How much large pool of ID is that?

Well, it’s enough for everyone on earth to produce video every single minute for 18000 years.

And they have achieved such huge number by only using 11 characters (64*64*64*64*64*64*64*64*64*64*64) if they need more IDs they will just have to add 1 more character to their IDs.

So when video is uploaded on YouTube they basically randomly select from 73+ Quintilian possibility and see if its already taken or not.if not use it otherwise look for another one.

Refer to this video for detailed explanation.

More Related Contents:

  1. What is tail call optimization?
  2. Algorithm for Determining Tic Tac Toe Game Over
  3. Algorithm to find Largest prime factor of a number
  4. How to make rounded percentages add up to 100%
  5. Write a function that returns the longest palindrome in a given string
  6. How do I efficiently determine if a polygon is convex, non-convex or complex?
  7. Cycles in an Undirected Graph
  8. Efficiently find binary strings with low Hamming distance in large set
  9. Roulette wheel selection algorithm [duplicate]
  10. “On-line” (iterator) algorithms for estimating statistical median, mode, skewness, kurtosis?
  11. Calculating mid in binary search
  12. Geo Fencing – point inside/outside polygon
  13. Find the missing and duplicate elements in an array in linear time and constant space
  14. Best Compression algorithm for a sequence of integers
  15. Smoothing data from a sensor
  16. A simple explanation of Naive Bayes Classification [closed]
  17. Basic Recursion, Check Balanced Parenthesis
  18. Euler project #18 approach
  19. Fastest available algorithm for distance transform
  20. Count the number of set bits in a 32-bit integer
  21. What algorithm for a tic-tac-toe game can I use to determine the “best move” for the AI?
  22. Generating integers in ascending order using a set of prime numbers
  23. Big O when adding together different routines
  24. Finding height in Binary Search Tree
  25. How to understand the dynamic programming solution in linear partitioning?
  26. Clustering Algorithm for Mapping Application
  27. What are the pitfalls in implementing binary search? [closed]
  28. Optimized low-accuracy approximation to `rootn(x, n)`
  29. What are probabilistic data structures?
  30. Connected Component Labeling – Implementation

Leave a Comment