Rapid Search Algorithms of Local Registering Based on Decimal Tree

Article Preview

Abstract:

In order to overcome the low efficiency of the database-based algorithm and the string-matching based algorithm in searching phone number, the two-level search algorithm by combining a decimal tree with a local registering table is proposed in this paper. The algorithm implementation is introduced in detail, and the experiments show that the decimal tree based algorithm is faster than the database-based algorithm and the string-matching based algorithm, especially much faster in the case of huge traffic.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1535-1538

Citation:

Online since:

June 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] The Art and Science of C [M] Eric S.Roberts China Machine Press 2004, p.211

Google Scholar

[2] Data Structures, Algorithms, and Applications in C++[M], Sartaj Sahni, McGraw-Hill Silicon Press 2004, p.132

Google Scholar

[3] The Construction of Address Map Table in VOIP System [J] Zou Xue-Yu Li Ke-Qing Computer Development & Applications 2001(10) , p.221

Google Scholar

[4] One kind of address translation scheme Applied in VoIP voice communication [J] Xiang Ya-Lin Yu Hou-Quan DATA COMMUNICATIONS 2004(2), p.89

Google Scholar

[5] An Algorithm of Searching the Address Map Table in VOIP System and Its Realization [J], Zou Xue-Yu, Du Hong, Microc0mputer Application 2001 17(9), p.37

Google Scholar

[6] The Construction and Searching of Address Map Table in VOIP System[J], Zou Xue-Yu Du Hong, TELECOMMUNICATION ENGINEERING 2001 41(3), p.131

Google Scholar

[7] SQL Server:The Complete Reference [M] Jeffrey R.Shapiro Tsinghua University Press 2002, p.78

Google Scholar