Systems and methods for indexing and searching data records based on distance metrics
AssigneeEncirq Corporation
InventorDavid Posner
Life of this patent
Estimating the term…
Abstract
A computer implemented method for searching a data structure is disclosed. A first node on the data structure is examined. A determination is made as to whether the first node is associated with one or more child nodes. When the first node not associated with one or more child nodes, elements within the first node that are located within a defined distance away from a defined location rendered on the first node are identified. The identified elements are stored in a data set. The nodal radius cut-off value is updated if the value is less than a difference of one half a radius of the first node and a distance from the defined location to the center point of the first node. The first node is labeled to indicate that the node has been examined.
Claims23
A computer implemented method for searching a data structure, comprising:
- examining a first node on the data structure;
- determining whether the first node is associated with one or more child nodes;
- when the first node is not associated with one or more child nodes, identifying elements within the first node that are located within a defined distance away from a defined location rendered on the first node;
- storing the identified elements in a data set;
- updating a nodal radius cut-off value if the nodal radius cut-off value is less than a difference of one half a radius of the first node and a distance from the defined location to the center point of the first node;
- and
- labeling the first node to indicate that the node has been examined.
A computer implemented method for inserting database records into a data structure, comprising:
- determining whether a first node in the data structure is associated with one or more child nodes;
- when the first node is not associated with one or more child nodes, inserting elements into the first node, wherein each element represents a geographic location;
- and
- determining whether the number of elements in the first node exceeds a set number, wherein, if the number of elements in the first node does exceed the set number, replacing the first node with a set of nodes, wherein radii of the set of nodes measures one half a first radius of the first node, and redistributing the elements between each node of the set of nodes.
A data tree structure for storing a dataset to be indexed and searched based on distance criteria, comprising:
- a root node defined by a root node center point and a root node radius, the root node configured to store elements that comprise the dataset;
- and
- a first sub-node associated with the root node, the first sub-node defined by a first sub-node center point and a first sub-node radius, wherein the first sub-node center point lies within one half the root node radius away from the root node center point and is configured to store a portion of the elements that comprise the dataset.
Dependencies are inferred from the claim text.