IP Library Patent Application 15276022
Patent Application
App. No. 15/276,022

HETEROGENOUS STRING SEARCH STRUCTURES WITH EMBEDDED RANGE SEARCH STRUCTURES

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
15/276,022
Abstract

A method in a data processing system and apparatus for organizing electronic data, structured or unstructured, of one or more users stored across one or more server computers into structures on a recordable medium of a data processing system. The data is structured in a heterogeneous string structure, and one or more embedded n-dimensional range structure within the heterogeneous string structure. Searching the plurality of string structures can then be done with a query including at least one term and a range threshold.

Claims (28)

1 . A computer-implemented method for organizing data, the method comprising:

automatically structuring the data in a heterogeneous string structure; and

automatically embedding an n-dimensional range structure within the heterogeneous string structure.

2 . The method of claim 1 , wherein the n-dimensional range structure comprises at least one of coordinates or dimensions.

3 . The method of claim 1 , wherein the geometric range comprises a minimum or maximum value.

4 . The method of claim 1 , wherein the n-dimensional range structure comprises a three-dimensional range structure.

5 . The method of claim 1 , wherein the range structure is stored in a K-D tree or a Range Tree data structure.

6 . The method of claim 1 , wherein the heterogeneous string structure comprises a tree structure and the n-dimensional range structure is embedded at a node of the tree structure.

7 . The method of claim 6 , further comprising a plurality of n-dimensional range structures each at one of a plurality of nodes of the heterogeneous string structure.

8 . The method of claim 6 , further comprising further heterogeneous string structure nodes at leaves of the n-dimensional range structure.

9 . The method of claim 1 , wherein the heterogeneous string structure is stored in a Trie data structure.

10 . The method of claim 1 , wherein the heterogeneous string structure organizes metalabels of the data.

11 . The method of claim 10 , wherein the heterogeneous string structure comprises a plurality of hierarchical structures for the data, each data item identified by a user-defined metalabel in the hierarchical structures, each of the data items organized in both a first data structure and the additional hierarchical structures without replicating the data.

12 . The method of claim 10 , further comprising:

receiving a search query with metalabel terms and dimensional values; and

searching for user-defined metalabels matching the search query and the dimensional values.

13 . The method of claim 12 , wherein the dimensional values comprise a geometric range.

14 . The method of claim 13 , wherein the geometric range comprises a minimum or maximum value.

15 . A computer-implemented data structure comprising a heterogeneous string structure with embedded n-dimensional range structure within the heterogeneous string structure.

16 . The method of claim 15 , wherein the n-dimensional range structure comprises at least one of coordinates or dimensions.

17 . The data-structure according to claim 16 , wherein the heterogeneous string structure comprises a tree structure.

18 . A computer-readable storage medium encoded with instructions for organizing data via a data processor, the encoded instructions comprising:

instructions for structuring the data in a string structure; and

instructions for automatically embedding an n-dimensional range structure within the string structure.

19 . The method of claim 18 , wherein the n-dimensional range structure comprises at least one of coordinates or dimensions.

20 . The computer-readable storage medium according to claim 18 , further comprising instructions for establishing a plurality of hierarchical structures for the data, each data item identified by a user-defined metalabel in the hierarchical structures, each of the data items organized in both a first data structure and the additional hierarchical structures without replicating the data; and

instructions for assigning a corresponding user-defined metalabel to each of the data items, and automatically organizing the data items as a function of the metalabels into the additional hierarchical structures by linking the metalabel of a first data item to a matching metalabel assigned to a second data item, wherein the first structure and the additional hierarchical structures exist simultaneously for the data;

wherein each of the additional hierarchical structures comprises a plurality of nodes, each of the nodes corresponding to one of the user-defined metalabels or the n-dimensional range structure.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 14, 2020
From: ILLINOIS INSTITUTE OF TECHNOLOGY
To: FRIEDER, OPHIR; KAPOOR, SANJIV
Reel/Frame 053765/0166 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 3, 2019
From: BLACKBIRD TECH LLC
To: ILLINOIS INSTITUTE OF TECHNOLOGY
Reel/Frame 049070/0737 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 20, 2018
From: ILLINOIS INSTITUTE OF TECHNOLOGY
To: BLACKBIRD TECH LLC
Reel/Frame 046417/0882 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 29, 2016
From: KAPOOR, SANJIV; FRIEDER, OPHIR
To: ILLINOIS INSTITUTE OF TECHNOLOGY
Reel/Frame 040191/0685 →