Efficient database search for unique indentifiers
View Patent ↗The invention is directed to providing an improved method of determining available identifiers (IDs) in a database, especially in the context of using available IDs for provisioning services in a telecommunications system. The method performs a database query for a range of IDs and stores candidate IDs in a local pre-fetch ID set.
1. A method of searching a database for a unique identifier (ID), the method comprising steps of:
performing a database query for a pre-fetch ID set for a predefined range of candidate IDs; and
determining an available ID within said pre-fetch ID set.
2. The method of claim 1 , wherein said pre-fetch ID set contains all the used IDs for said predefined range of candidate IDs.
3. The method of claim 1 , further comprising a step of repeating said step of determining an available ID.
4. The method of claim 3 , further comprising steps of:
incrementing said starting candidate ID by said predefined range; and
repeating said step of performing a database query.
5. The method of claim 4 , wherein said predefined range comprises an order of magnitude less than a total ID range space.
6. The method of claim 4 , wherein said predefined range comprises between 5% and 20% of a total ID range space.
7. The method of claim 1 wherein said database query comprises a Structured Query Language (SQL) query.
8. The method of claim 1 further comprising steps of:
provisioning services in a telecommunication system, using said available ID.
9. The method of claim 8 , wherein said database comprises a network management system database.
10. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform steps of the method of claim 1 .
11. A non-transitory machine-readable storage medium encoded with instructions that when executed by a processor perform a method of searching a database for a unique identifier (ID), the non-transitory machine-readable storage medium comprising:
instructions for performing a database query for a pre-fetch ID set for a predefined range of candidate IDs; and
instructions for determining an available ID within said pre-fetch ID set.
12. The non-transitory machine-readable storage medium of claim 11 , wherein said pre-fetch ID set contains all the used IDs for said predefined range of candidate IDs.
13. The non-transitory machine-readable storage medium of claim 11 , further comprising instructions for repeating said instructions for determining an available ID.
14. The non-transitory machine-readable storage medium of claim 13 , further comprising:
instructions for incrementing said starting candidate ID by said predefined range; and
instructions for repeating said instructions for performing a database query.
15. The non-transitory machine-readable storage medium of claim 14 , wherein said predefined range comprises an order of magnitude less than a total ID range space.
16. The non-transitory machine-readable storage medium of claim 14 , wherein said predefined range comprises between 5% and 20% of a total ID range space.
17. The non-transitory machine-readable storage medium of claim 11 wherein said database query comprises a Structured Query Language (SQL) query.
18. The non-transitory machine-readable storage medium of claim 11 further comprising:
instructions for provisioning services in a telecommunication system, using said available ID.
19. The non-transitory machine-readable storage medium of claim 18 , wherein said database comprises a network management system database.