찾다
백엔드 개발PHP 튜토리얼php创造短ID Create short IDs with PHP - Like Youtube or TinyURL

php创建短ID Create short IDs with PHP - Like Youtube or TinyURL

?

?

More is Less - the 'math'

The alphabet has 26 characters. That's a lot more than 10 digits. If we also distinguish upper- and lowercase, and add digits to the bunch or the heck of it, we already have (26 x 2 + 10)?62 options?we can use?per position?in the ID.

Now of course we can also add additional funny characters to 'the bunch' like - / * & # but those may cause problems in URLs and that's our target audience for now.

OK so because there are roughly?6x more characters?we will use per position, IDs will get much?shorter. We can just fit a lot?more data in each position.

This is basically what url shortening services do like tinyurl, is.gd, or bit.ly. But similar IDs can also be found at youtube:?http://www.youtube.com/watch?v=yzNjIBEdyww

Convert your IDs

Now unlike Database servers: webservers are easy to scale so you can let them do a bit of converting to ease the life of your users, while keeping your database fast with numbers (MySQL really likes them plain numbers ; ).

To do the conversion I've written a PHP function that can translate big numbers to short strings and vice versa. I call it: alphaID.

The resulting string is not hard to decipher, but it can be a very nice feature to make URLs or directorie structures more compact and significant.

So basically:

  • when someone requests rLHWfKd
  • alphaID() converts it to 999999999999
  • you lookup the record for id 999999999999 in your database

?

?

Source

<?php /** * Translates a number to a short alhanumeric version * * Translated any number up to 9007199254740992 * to a shorter version in letters e.g.: * 9007199254740989 --> PpQXn7COf * * specifiying the second argument true, it will * translate back e.g.: * PpQXn7COf --> 9007199254740989 * * this function is based on any2dec && dec2any by * fragmer[at]mail[dot]ru * see: http://nl3.php.net/manual/en/function.base-convert.php#52450 * * If you want the alphaID to be at least 3 letter long, use the * $pad_up = 3 argument * * In most cases this is better than totally random ID generators * because this can easily avoid duplicate ID's. * For example if you correlate the alpha ID to an auto incrementing ID * in your database, you're done. * * The reverse is done because it makes it slightly more cryptic, * but it also makes it easier to spread lots of IDs in different * directories on your filesystem. Example: * $part1 = substr($alpha_id,0,1); * $part2 = substr($alpha_id,1,1); * $part3 = substr($alpha_id,2,strlen($alpha_id)); * $destindir = "/".$part1."/".$part2."/".$part3; * // by reversing, directories are more evenly spread out. The * // first 26 directories already occupy 26 main levels * * more info on limitation: * - http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/165372 * * if you really need this for bigger numbers you probably have to look * at things like: http://theserverpages.com/php/manual/en/ref.bc.php * or: http://theserverpages.com/php/manual/en/ref.gmp.php * but I haven't really dugg into this. If you have more info on those * matters feel free to leave a comment. * * The following code block can be utilized by PEAR's Testing_DocTest * <code> * // Input // * $number_in = 2188847690240; * $alpha_in  = "SpQXn7Cb"; * * // Execute // * $alpha_out  = alphaID($number_in, false, 8); * $number_out = alphaID($alpha_in, true, 8); * * if ($number_in != $number_out) { *	 echo "Conversion failure, ".$alpha_in." returns ".$number_out." instead of the "; *	 echo "desired: ".$number_in."\n"; * } * if ($alpha_in != $alpha_out) { *	 echo "Conversion failure, ".$number_in." returns ".$alpha_out." instead of the "; *	 echo "desired: ".$alpha_in."\n"; * } * * // Show // * echo $number_out." => ".$alpha_out."\n"; * echo $alpha_in." => ".$number_out."\n"; * echo alphaID(238328, false)." => ".alphaID(alphaID(238328, false), true)."\n"; * * // expects: * // 2188847690240 => SpQXn7Cb * // SpQXn7Cb => 2188847690240 * // aaab => 238328 * * </code> * * @author	Kevin van Zonneveld  * @author	Simon Franz * @author	Deadfish * @copyright 2008 Kevin van Zonneveld (http://kevin.vanzonneveld.net) * @license   http://www.opensource.org/licenses/bsd-license.php New BSD Licence * @version   SVN: Release: $Id: alphaID.inc.php 344 2009-06-10 17:43:59Z kevin $ * @link	  http://kevin.vanzonneveld.net/ * * @param mixed   $in	  String or long input to translate * @param boolean $to_num  Reverses translation when true * @param mixed   $pad_up  Number or boolean padds the result up to a specified length * @param string  $passKey Supplying a password makes it harder to calculate the original ID * * @return mixed string or long */function alphaID($in, $to_num = false, $pad_up = false, $passKey = null){	$index = "abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";	if ($passKey !== null) {		// Although this function's purpose is to just make the		// ID short - and not so much secure,		// with this patch by Simon Franz (http://blog.snaky.org/)		// you can optionally supply a password to make it harder		// to calculate the corresponding numeric ID		for ($n = 0; $n<strlen substr hash strlen : for array_multisort sort_desc implode if digital number alphabet letter code strrev bcpow strpos> 0) $out -= pow($base, $pad_up);		}		$out = sprintf('%F', $out);		$out = substr($out, 0, strpos($out, '.'));	} 	else 	{		// Digital number  -->>  alphabet letter code		if (is_numeric($pad_up)) {			$pad_up--;			if ($pad_up > 0) $in += pow($base, $pad_up);		}		$out = "";		for ($t = floor(log($in, $base)); $t >= 0; $t--) {			$bcp = bcpow($base, $t);			$a   = floor($in / $bcp) % $base;			$out = $out . substr($index, $a, 1);			$in  = $in - ($a * $bcp);		}		$out = strrev($out); // reverse	}	return $out;}</strlen>

?

Example

Running:

alphaID<span style="color: #66cc66; padding: 0px; margin: 0px;">(</span><span style="color: #cc66cc; padding: 0px; margin: 0px;">9007199254740989</span><span style="color: #66cc66; padding: 0px; margin: 0px;">)</span>;

will return 'PpQXn7COf' and:

alphaID<span style="color: #66cc66; padding: 0px; margin: 0px;">(</span><span style="color: #ff0000; padding: 0px; margin: 0px;">'PpQXn7COf'</span>, <span style="font-weight: 700; color: #000000; padding: 0px; margin: 0px;">true</span><span style="color: #66cc66; padding: 0px; margin: 0px;">)</span>;

will return '9007199254740989'

Easy right?

More features

  • There also is an optional third argument:?$pad_up. This enables you to make the resulting alphaId at least?X?characters long.
  • You can support even more characters (making the resulting alphaID even smaller) by adding characters to the?$index?var at the top of the function body.

?

?

?

JavaScript Implementation

Thanks to Even Simon, there's a JavaScript implementation. You will also find PHP version there, that implements the encode & decode functions as separate methods in a class.

<script>/** *  Javascript AlphabeticID class *  (based on a script by Kevin van Zonneveld <[email&#160;protected]>) * *  Author: Even Simon <[email&#160;protected]> * *  Description: Translates a numeric identifier into a short string and backwords. * *  Usage: *    var str = AlphabeticID.encode(9007199254740989); // str = 'fE2XnNGpF' *    var id = AlphabeticID.decode('fE2XnNGpF'); // id = 9007199254740989; **/ var AlphabeticID = {  index:'abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ',   /**   *  <a href="http://twitter.com/function">@function AlphabeticID.encode   *  <a href="http://twitter.com/description">@description Encode a number into short string   *  <a href="http://twitter.com/param">@param integer   *  <a href="http://twitter.com/return">@return string   **/  encode:function(_number){    if('undefined' == typeof _number){      return null;    }    else if('number' != typeof(_number)){      throw new Error('Wrong parameter type');    }     var ret = '';     for(var i=Math.floor(Math.log(parseInt(_number))/Math.log(AlphabeticID.index.length));i>=0;i--){      ret = ret + AlphabeticID.index.substr((Math.floor(parseInt(_number) / AlphabeticID.bcpow(AlphabeticID.index.length, i)) % AlphabeticID.index.length),1);    }     return ret.reverse();  },   /**   *  <a href="http://twitter.com/function">@function AlphabeticID.decode   *  <a href="http://twitter.com/description">@description Decode a short string and return number   *  <a href="http://twitter.com/param">@param string   *  <a href="http://twitter.com/return">@return integer   **/  decode:function(_string){    if('undefined' == typeof _string){      return null;    }    else if('string' != typeof _string){      throw new Error('Wrong parameter type');    }     var str = _string.reverse();    var ret = 0;     for(var i=0;i<=(str.length - 1);i++){      ret = ret + AlphabeticID.index.indexOf(str.substr(i,1)) * (AlphabeticID.bcpow(AlphabeticID.index.length, (str.length - 1) - i));    }     return ret;  },   /**   *  <a href="http://twitter.com/function">@function AlphabeticID.bcpow   *  <a href="http://twitter.com/description">@description Raise _a to the power _b   *  <a href="http://twitter.com/param">@param float _a   *  <a href="http://twitter.com/param">@param integer _b   *  <a href="http://twitter.com/return">@return string   **/  bcpow:function(_a, _b){    return Math.floor(Math.pow(parseFloat(_a), parseInt(_b)));  }}; /** *  <a href="http://twitter.com/function">@function String.reverse *  <a href="http://twitter.com/description">@description Reverse a string *  <a href="http://twitter.com/return">@return string **/String.prototype.reverse = function(){  return this.split('').reverse().join('');};</script>

?

?

Python Implementation

Thanks to?wessite, there's a Python implementation.

?

ALPHABET = "bcdfghjklmnpqrstvwxyz0123456789BCDFGHJKLMNPQRSTVWXYZ"BASE = len(ALPHABET)MAXLEN = 6 def encode_id(self, n):     pad = self.MAXLEN - 1    n = int(n + pow(self.BASE, pad))     s = []    t = int(math.log(n, self.BASE))    while True:        bcp = int(pow(self.BASE, t))        a = int(n / bcp) % self.BASE        s.append(self.ALPHABET[a:a+1])        n = n - (a * bcp)        t -= 1        if t  l: break     pad = self.MAXLEN - 1    s = int(s - pow(self.BASE, pad))     return int(s)

?

Python Implementation

Thanks to?Andy Li, there's a HaXe implementation.

?
/** *  HaXe version of AlphabeticID *  Author: Andy Li  *  ported from... * *  Javascript AlphabeticID class *  Author: Even Simon  *  which is based on a script by Kevin van Zonneveld ) * *  Description: Translates a numeric identifier into a short string and backwords. *  http://kevin.vanzonneveld.net/techblog/article/create_short_ids_with_php_like_youtube_or_tinyurl/ **/ class AlphaID {    static public var index:String = 'abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ';     static public function encode(_number:Int):String {                var strBuf = new StringBuf();         var i = 0;        var end = Math.floor(Math.log(_number)/Math.log(index.length));        while(i <p>?</p><p>?来源:http://kevin.vanzonneveld.net/techblog/article/create_short_ids_with_php_like_youtube_or_tinyurl/</p><p>?</p><p>?</p><div class="clear">
                 
              
              
        
            </div>
성명
본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.
PHP 응용 프로그램을 더 빨리 만드는 방법PHP 응용 프로그램을 더 빨리 만드는 방법May 12, 2025 am 12:12 AM

TomakePhPapplicationSfaster, followthesesteps : 1) useopCodeCaching likeOpcachetOrpectipiledScriptBecode.2) MinimizedAtabaseQueriesByUsingQueryCachingandEfficientIndexing.3) leveragephp7 assistorBetterCodeeficiession.4) 구현 전략적 지시

PHP 성능 최적화 점검표 : 지금 속도를 향상시킵니다PHP 성능 최적화 점검표 : 지금 속도를 향상시킵니다May 12, 2025 am 12:07 AM

toImprovePhPapplicationSpeed, followthesesteps : 1) enableOpCodeCachingWithApcuTeCeScripteXecutionTime.2) 구현 구현

PHP 의존성 주입 : 코드 테스트 가능성을 향상시킵니다PHP 의존성 주입 : 코드 테스트 가능성을 향상시킵니다May 12, 2025 am 12:03 AM

의존성 주입 (DI)은 명시 적으로 전이적 종속성에 의해 PHP 코드의 테스트 가능성을 크게 향상시킵니다. 1) DI 디퍼 커플 링 클래스 및 특정 구현은 테스트 및 유지 보수를보다 유연하게 만듭니다. 2) 세 가지 유형 중에서, 생성자는 상태를 일관성있게 유지하기 위해 명시 적 표현 의존성을 주입합니다. 3) DI 컨테이너를 사용하여 복잡한 종속성을 관리하여 코드 품질 및 개발 효율성을 향상시킵니다.

PHP 성능 최적화 : 데이터베이스 쿼리 최적화PHP 성능 최적화 : 데이터베이스 쿼리 최적화May 12, 2025 am 12:02 AM

DatabaseQuesyOptimizationInphPinVolvesVesstoigiestoInsperferferferferformance.1) SelectOnlyNecessaryColumnstoredAtatatransfer.2) useinDexingTeSpeedUpdatarretieval.3) ubstractOrerEresultSoffRequeries.4) UtilizePreDstatements Offeffi

간단한 가이드 : PHP 스크립트와 함께 이메일 보내기간단한 가이드 : PHP 스크립트와 함께 이메일 보내기May 12, 2025 am 12:02 AM

phpisusedforendingemailsduetoitsbuitsbuitsbuit-inmail () functionandsupportivelibraries lifephpmailerandswiftmailer.1) usethemail () functionforbasicemails, butithaslimitations.2) EmployPhpmailerforAdvancedFeatirehtMailsAndAtachments.3))

PHP 성능 : 병목 현상 식별 및 수정PHP 성능 : 병목 현상 식별 및 수정May 11, 2025 am 12:13 AM

PHP 성능 병목 현상은 다음 단계를 통해 해결할 수 있습니다. 1) 성능 분석을 위해 Xdebug 또는 Blackfire를 사용하여 문제를 찾으십시오. 2) 데이터베이스 쿼리 최적화 및 APCU와 같은 캐시 사용; 3) Array_Filter와 같은 효율적인 기능을 사용하여 배열 작업을 최적화합니다. 4) 바이트 코드 캐시에 대한 OpCache 구성; 5) HTTP 요청을 줄이고 사진 최적화와 같은 프론트 엔드 최적화; 6) 지속적으로 모니터링하고 성능을 최적화합니다. 이러한 방법을 통해 PHP 응용 프로그램의 성능을 크게 향상시킬 수 있습니다.

PHP의 종속성 주입 : 빠른 요약PHP의 종속성 주입 : 빠른 요약May 11, 2025 am 12:09 AM

종속성 주사 (di) inphpisadesignpattern thatmanages 및 enpleducesclassdelencies, 향상 codemodularity, trestability 및 maintainability .itallowspassingDepporsingDikedAbaseConnectionStoclassesAssparameters, 촉진 이용성.

PHP 성능 향상 : 캐싱 전략 및 기술PHP 성능 향상 : 캐싱 전략 및 기술May 11, 2025 am 12:08 AM

cachingimprovesphpperferferfermanceStoringResultsOfcomputationSorqueriesforquickRetrieval, retingServerloadandenhancancing responsetimestimes : 1) opcodecaching, opcodecaching, whitescompiledphps scriptsinmorytoskipcompileation; 2) dataCachingUsingmemmc

See all articles

핫 AI 도구

Undresser.AI Undress

Undresser.AI Undress

사실적인 누드 사진을 만들기 위한 AI 기반 앱

AI Clothes Remover

AI Clothes Remover

사진에서 옷을 제거하는 온라인 AI 도구입니다.

Undress AI Tool

Undress AI Tool

무료로 이미지를 벗다

Clothoff.io

Clothoff.io

AI 옷 제거제

Video Face Swap

Video Face Swap

완전히 무료인 AI 얼굴 교환 도구를 사용하여 모든 비디오의 얼굴을 쉽게 바꾸세요!

뜨거운 도구

SublimeText3 Linux 새 버전

SublimeText3 Linux 새 버전

SublimeText3 Linux 최신 버전

ZendStudio 13.5.1 맥

ZendStudio 13.5.1 맥

강력한 PHP 통합 개발 환경

SecList

SecList

SecLists는 최고의 보안 테스터의 동반자입니다. 보안 평가 시 자주 사용되는 다양한 유형의 목록을 한 곳에 모아 놓은 것입니다. SecLists는 보안 테스터에게 필요할 수 있는 모든 목록을 편리하게 제공하여 보안 테스트를 더욱 효율적이고 생산적으로 만드는 데 도움이 됩니다. 목록 유형에는 사용자 이름, 비밀번호, URL, 퍼징 페이로드, 민감한 데이터 패턴, 웹 셸 등이 포함됩니다. 테스터는 이 저장소를 새로운 테스트 시스템으로 간단히 가져올 수 있으며 필요한 모든 유형의 목록에 액세스할 수 있습니다.

WebStorm Mac 버전

WebStorm Mac 버전

유용한 JavaScript 개발 도구

PhpStorm 맥 버전

PhpStorm 맥 버전

최신(2018.2.1) 전문 PHP 통합 개발 도구