There are several techniques to implement a URL shortening. Keys can
be generated in base 36, assuming 26 letters and 10 numbers. In this
case, each character in the sequence will be 0, 1, 2, ..., 9, a, b,
c, ..., y, z. Alternatively, if uppercase and lowercase letters are
differentiated, then each character can represent a single digit
within a number of base 62 (26 + 26 + 10). In order to form the key, a
hash function can be made, or a random number generated so that key
sequence is not predictable. Or users may propose their own keys.
On Jun 4, 6:24 pm, rahul rai <raikra...@gmail.com> wrote:
> I heard somewhere in some online video lecture that sites liketinyurl
> change the address using more than base three {base 6 } and then apply
> hash
>
> On 6/4/11, bittu <shashank7andr...@gmail.com> wrote:
>
>
>
> > well i can speak much on these question.as these algorithms are part
> > of web crawler ..but do u mean we have to detect the duplicate files,
> > by file having same size are duplicates..??
>
> > also same question raised by me few days back "Detecting Duplicate
> > Documents" but no one seems to interested u can search previous
> > threads..
>
> > Thanks
> > Shashank
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> Rahul
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
