Managing and querying moving point data
AssigneeTelcontar
InventorGeoffrey R. Hendrey
Life of this patent
Estimating the term…
Abstract
An improved client locating and user discovery system is disclosed. Methods and systems are described that provide the ability for a telecommunications network to frequently update the location data for telecommunications units within the network, while preventing the performance degradation that is inherent in the prior art. In the patented invention, the most frequently updated data is stored outside the main database in active memory in a tree structure, and is accessed through an API that converts the tree data into a database query language readable format.
Claims16
A method of indexing a database containing dynamic locations of mobile units (MU) in an N-level tree data structure including a root node, branch nodes, and leaf nodes, wherein the root node corresponds to a coverage area, and each subsequent branch or leaf node corresponds to a sub-area of the previous node's coverage area, comprising the steps of:
- adding an MU to a leaf node corresponding to a coverage area in which the MU is located;
- and
- recursively recomputing the center of each ancestor node, wherein the center corresponds to a center of all the MUs contained within the coverage area corresponding to that node.
A system for indexing a database of dynamic locations of mobile units (MU) comprising:
- a mobile positioning center adapted to receive location information from one or more MUs;
- a database wherein locations of the MUs are stored;
- a computer comprising a memory adapted with computer readable instructions for maintaining a database index in an N-level tree data structure including a root node, branch nodes, and leaf nodes, wherein the root node corresponds to a coverage area, and each subsequent branch or leaf node corresponds to a sub-area of the previous node's coverage area;
- wherein said index is maintained by:
- adding an MU to a leaf node corresponding to a coverage area in which the MU is located;
- and
- recursively recomputing the center of each ancestor node, wherein the center corresponds to a center of all the MUs contained within the coverage area corresponding to that node.
Dependencies are inferred from the claim text.