Method and apparatus for rapid data access and distribution using structured identifiers
View Patent ↗A method and apparatus for accessing data using an N-leg search tree including determining a tree identifier using a computer, traversing an N-leg search tree associated with the tree identifier, and accessing a data structure. The N-leg search tree is stored on a computer and traversed to a given node within the tree. The accessed data structure is associated with a deepest valid traversed node. The given node corresponds to a given element of a structured identifier.
1. A method for accessing data stored on a computer system including one or more computers on a network, the method comprising:
determining a tree identifier using the computer system;
traversing, using the computer system, an N-leg search tree associated with the tree identifier stored on a computer, to a given node within the N-leg search tree, wherein the given node corresponds to a given element of a structured identifier; and
accessing a data structure associated with a deepest valid traversed node, wherein the deepest valid traversed node is determined by:
(a) determining whether data stored at the given node is valid;
(b) when the data stored at the given node is determined to be valid, determining that the given node is the deepest valid traversed node; and
(c) when the data stored at the given node is determined to be not valid, traversing back up the N-leg search tree to a first parent node that stores valid data, and determining that the first parent node that stores valid data is the deepest valid traversed node.
2. The method of claim 1 , wherein the tree identifier is determined by a method comprising:
determining a minimum number of members of the given element;
performing a modulo operation using a value corresponding to the minimum number of members of the given element of the structured identifier and a number of N-leg search trees used to store the data; and
using a result of the modulo operation as the tree identifier.
3. The method of claim 1 , further comprising accessing a child node of the given node, wherein the child node is associated with a next element of a structured identifier.
4. The method of claim 1 , wherein the traversing step is performed for each element of the structured identifier until at least one condition occurs, wherein the condition is one of a group consisting of: where the child node is a dead-end node, where the next element is a last element of the structured identifier, and where no node corresponds to the given element.
5. The method of claim 1 , wherein the structured identifier comprises one or more substrings of variable length.
6. The method of claim 1 , wherein the N-leg search tree comprises telephony routing data.
7. The method of claim 6 , wherein the structured identifier is a phone number comprising one or more substrings of variable length.
8. The method of claim 7 , wherein one of the one or more substrings is a telephone country code.
9. The method of claim 6 , wherein the data structure comprises an element of a telephone routing table comprised of one or more prefix substrings and one or more routing elements associated with the one or more prefix substrings.
10. The method of claim 1 , wherein the structured identifier is a first set of ASCII characters, each ASCII character in the set having an ASCII decimal value, the method further comprising converting the structured identifier from the first set of ASCII characters to a second set of numeric values by subtracting 48 from the ASCII decimal value of each ASCII character.
11. A method for implementing a scalable data access architecture for data stored on a computer, executed on a computer processor, the method comprising:
determining a minimum number of members for an element of a structured identifier using a computer;
performing a modulo operation on the structured identifier, wherein the modulo operation uses a value corresponding to the minimum number of members of the element of the structured identifier and a number of N-leg search trees used to store the data; and
inserting the structured identifier into an N-leg search tree corresponding to a result of the modulo operation.
12. The method of claim 11 , wherein a last member of the element of the structured identifier corresponds to a child node containing a data structure.
13. The method of claim 12 , wherein the data structure comprises an element of a telephone routing table comprised of one or more prefix substrings and one or more routing elements associated with the one or more prefix substrings.
14. The method of claim 11 , wherein the N-leg search tree comprises telephony routing data.
15. The method of claim 14 , wherein the structured identifier is a telephone number.
16. The method of claim 15 , wherein the element of the structured identifier is a country code.
17. The method of claim 11 , wherein the structured identifier is a first set of ASCII characters, each ASCII character in the first set having an ASCII decimal value, the method further comprising converting the structured identifier from the first set of ASCII characters to a second set of numeric values by subtracting 48 from the ASCII decimal value of each ASCII character.
18. An apparatus for data access and distribution comprising:
a) at least one processor; and
b) at least one storage device storing processor-executable instructions which, when executed by the at least one processor, perform a method including:
storing data in one or more N-leg search trees;
determining a tree identifier from a given structured identifier;
traversing an N-leg search tree associated with the tree identifier to a given node within the N-leg search tree; and
accessing a data structure associated with a deepest valid traversed node, wherein the deepest valid traversed node is determined by:
(1) determining whether data stored at the given node is valid;
(2) when the data stored at the given node is determined to be valid, determining that the given node is the deepest valid traversed node; and
(3) when the data stored at the given node is determined to be not valid, traversing back up the N-leg search tree to a first parent node that stores valid data, and determining that the first parent node that stores valid data is the deepest valid traversed node.
19. The apparatus of claim 18 , wherein the act of traversing the N-leg search tree includes:
traversing the N-leg search tree associated with the tree identifier to the given node within the N-leg search tree, wherein the given node corresponds to a given element of a structured identifier;
accessing a child node of the given node, wherein the child node is associated with a next element of the structured identifier; and
repeating the traversing and accessing steps for each element of the structured identifier until at least one condition occurs, wherein the at least one condition is at least one of the child node is a dead-end node, the next element is the last element of the structured identifier, or no node corresponds to the given element.
20. The apparatus of claim 19 , wherein the act of determining the tree identifier includes:
determining a minimum number of members of the given element;
performing a modulo operation using a value corresponding to the minimum number of members of the given element of the structured identifier and a number of N-leg search trees used to store the data; and
using the result of the modulo operation as the tree identifier.
21. The apparatus of claim 18 , wherein the N-leg search tree stores telephone routing information and the method further includes:
performing telephone routing operations.
22. The apparatus of claim 21 , further comprising:
a telephone routing table comprised of one or more prefix substrings and one or more routing elements associated with the one or more prefix substrings.