DYNAMIC NUMERIC SEQUENCE MATCH

• US 20120239695A1
• Filed: 02/23/2012
• Published: 09/20/2012
• Est. Priority Date: 02/24/2011
• Status: Abandoned Application

• Current Assignee: Shoo 533 Limited
• Original Assignee: Ghost Telecom Limited
• Inventors: Merino Gonzalez, Jose Luis, Myers, Jonathan
• Application Number:
  US13/403,234
• Publication Number:
  US 20120239695A1
• Time in Patent Office: Days
• US Class Current: 707/780
• CPC Class Codes: G06F 16/9014 hash tables

Abstract

A system for determining dynamically any given input numeric sequence potential match against all available numeric sequences from a database, whereby the dynamic method reports the match or matches with the highest matching digits. The input numeric sequence(s) and the numeric sequences from databases can be of any length and therefore the input numeric sequence may be different in length to those numeric sequences from databases, yet the method will detect and report those database numeric sequences that provided the highest number of digits matching against any given input numeric sequence.

Claims

1. A system for detecting or determining any given “

input numeric sequence”

potential match against all available “

numeric sequences”

accessible from any given database comprising;

(a) the system adapted to receive an input numeric sequence of any length;

(b) the system comprising access to information of one or more databases;

(c) the system capable of extracting and reporting dynamically all associated information from a database associated with a numeric sequence from that database of such database numeric sequence that has the highest match of identical digits with the input numeric sequence.

2. The system of claim 1 capable of in the event no match is found between a given input numeric sequence and any numeric sequence in the accessible databases to reverse the input number sequence (change from first to last towards last to first digit) and use the reverse numeric sequence as the next input numeric sequence.

3. The system according to claim 1, wherein the input numeric sequence and any consecutive input numeric sequence can be of any length and different in length between any consecutive input numeric sequence.

4. The system according to claim 1, wherein the system retrieves all database information associated with the numeric sequence from such database, related to those database numeric sequence which have the highest digits match with each corresponding input numeric sequence and provides that information to the corresponding input numeric sequence destination for further processing or storage.

5. The system according to claim 1, wherein the system has access to the database of the originating destination of the input numeric sequence and processes and stores part or whole of the information corresponding to the match numeric sequence form the database accessible to the system.

17. The method according to claim 1, wherein the “

input numeric sequence”

(s) can be identification numbers or tracking number of a material part or parcel of any length.

18. The system according to claim 1, wherein the “

input numeric sequence”

(s) can be telephone numbers in any local or international format of any length.

19. The system according to claim 1, wherein the “

input numeric sequence”

(s) can be IMSI (International Mobile Subscriber Identity) of any length.

20. The system according to claim 1, where the system output numeric matches are used to synchronize the database wherefrom the “

input numeric sequence”

(s) originated from with the data extracted from the corresponding matched numeric sequence data from the searched database.

6. A method for selecting dynamically the highest probability match between an “

input numeric sequence” and

any “

accessible database numeric sequence”

comprising the steps of;

(a) buffering all received “

input numeric sequence(s)” and

trigger a start of the “

check method”

on a first come first served basis upon receipt of any input numeric sequence or “

incoming check request”

;

(b) comparing an “

incoming numeric sequence”

to any and each numeric sequence in the accessible databases, starting comparing digit by digit from last to first with a minimum required “

starting threshold of number of digits that must match”

counted from last to first;

(c) if a match is found stop check method and report all information from database associated to the matched numeric sequence and re-start the check method with the next incoming numeric sequence or if no more input numeric sequence available stop check method till receipt of next incoming check request. However if no match is found then “

decrement the starting threshold of number of digits that must match” and

restart the check method only for the input numeric sequences that did not match using the new decremented parameter as starting threshold and repeat this decrement loop until a match is found or until the “

decremented starting threshold of number of digits that must match”

has reached the “

minimum preset value”

, whichever comes first and then re-start the check method with the next incoming numeric sequence or if no more input numeric sequence available stop check method till receipt of next incoming check request.

7. The method according to claim 6, wherein the “

starting threshold of number of digits that must match” and

“

minimum preset value”

is user programmable.

8. The method according to claim 6, wherein “

starting threshold of number of digits that must match” and

“

minimum preset value”

are dynamically obtained automatically by the system itself in the event the input numeric sequence(s) is a phone number (in an international format or a local format of any region) and the database(s) contains numeric sequences of phone numbers in the international format (country code followed by phone number) as follows;

“

starting threshold of number of digits that must match”

=(number of digits corresponding to numeric sequence from the database used); and

such parameter may be different when matching an input numeric sequence against each next different numeric sequence from the database, but for those input numeric sequences that have no match against any numeric sequence of the database than those non matched input sequences will be re-checked with decrementing previously calculated “

starting threshold of number of digits that must match”

by 1 or if still no match keep decrementing until a match is found or until “

last used starting threshold of number of digits that must match”

=“

minimum preset value”

then stop check method, whichever comes first.

“

minimum preset value”

when checking against each numeric sequence from the database=number of digits corresponding to each such numeric sequence from the database−

country code digits; and

if country code digits are unknown in the database then “

minimum preset value”

=number of digits corresponding to each such numeric sequence from the database−

4;

this “

minimum preset value”

may be different when matching an input numeric sequence against each next different numeric sequence from the database.

9. The method according to claim 6, wherein “

starting threshold of number of digits that must match” and

“

minimum preset value”

are dynamically obtained in the event the input numeric number is a phone number as follows;

“

starting threshold of number of digits that must match”

=(number of digits of input numeric sequence) - (number of digits of the international dialling code and country code), but if no international dialling code or country code is present in the input numeric number then subtract one.

“

minimum preset value”

”

=amount of digits of emergency numbering+one.

10. The method according to claim 6, further comprising the step of storing incoming check requests and the corresponding input numeric sequence(s) information to perform the check method immediately or at preselected intervals or re-start the check method at regular future intervals only for those input numeric sequences that did not match against any numeric sequences from the accessible databases to the system.

11. The method according to claim 6, further comprising the step of storing all the information from the database that relates or associated to any numeric sequence from the database which corresponds to a match with any incoming numeric sequence request, such output information to be provided to the destination of the incoming numeric request immediately or at preselected intervals.

12. The method according to claim 6, wherein the database maintains information associated with input numeric sequence requests.

13. The method according to claim 6, wherein the “

input numeric sequence”

(s) can be identification numbers or tracking number of a material part or parcel of any length.

14. The method according to claim 6, wherein the “

input numeric sequence”

(s) can be telephone numbers in any local or international format of any length.

15. The method according to claim 6, wherein the “

input numeric sequence”

(s) can be IMSI (International Mobile Subscriber Identity) of any length.

16. The method according to claim 6, where the method output numeric matches are used to synchronize the database wherefrom the “

input numeric sequence”

(s) originated from with the data extracted from the corresponding matched numeric sequence data from the searched database.