IP Library Granted Patent US 11,947,613
Granted Patent B2
US 11,947,613 · App. 17/661,502 · Granted Apr 2, 2024

System and method for efficiently querying data using temporal granularities

Inventors: Guy Boyangu (Tel Aviv, IL); Leon Gendler (Herzliya, IL)
Assignee: SISENSE LTD.
G06F16/9537G06F16/144G06F16/156G06F16/168
View Patent ↗
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 11,947,613
App. No.
17/661,502
Granted
Apr 2, 2024
Kind
B2
Abstract

A system and method for displaying data using temporal granularities. The method includes determining at least one first dataset of a plurality of datasets based on at least one temporal data requirement, wherein the plurality of datasets is generated based on a data model, wherein each of the plurality of datasets is generated based further on a distinct temporal granularity of a plurality of temporal granularities, wherein the distinct temporal granularity of each of the at least one first dataset meets at least one of the at least one temporal data requirement; and querying the determined at least one first dataset in order to obtain at least one query result.

Claims (36)

1. A method for querying a data source based on temporal granularity, comprising:

determining a target dataset from among a plurality of preexisting datasets based on a request including a query for execution and a temporal granularity;

querying the target dataset based on the request; and

generating an output based on a query result received in response to querying the target dataset,

wherein each of the plurality of preexisting datasets is based on at least one temporal data requirement,

wherein the plurality of datasets is generated based on a data model, the data model including a data structure and representing a set of data larger in size than at least one of the plurality of datasets,

wherein at least one dataset of the plurality of datasets has a size that is different from respective sizes of other datasets of the plurality of datasets.

2. The method of claim 1 , wherein the target dataset is a first target dataset, further comprising:

determining a plurality of target datasets including the first target dataset, wherein each target dataset is determined based on the request and a respective temporal data requirement.

3. The method of claim 2 , further comprising:

generating the output based on a plurality of query results, each query result corresponding to a target dataset of the plurality of target datasets.

4. The method of claim 2 , further comprising:

generating an aggregated dataset based on a subset of the plurality of target datasets; and

querying the aggregated dataset based on the request.

5. The method of claim 4 , wherein the aggregated dataset is generated further based on a weight assigned to each target dataset of the subset of the plurality of target datasets.

6. The method of claim 5 , wherein the weight assigned to each target dataset is based on a temporal requirement of an associated target dataset.

7. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute a process, the process comprising:

determining a target dataset from among a plurality of preexisting datasets based on a request including a query for execution and a temporal granularity;

querying the target dataset based on the request; and

generating an output based on a query result received in response to querying the target dataset, wherein each of the plurality of preexisting datasets is based on at least one temporal data requirement, wherein the plurality of datasets is generated based on a data model, the data model including a data structure and representing a set of data larger in size than at least one of the plurality of datasets, wherein at least one dataset of the plurality of datasets has a size that is different from respective sizes of other datasets.

8. A system for querying a data source based on temporal granularity, comprising:

a processing circuitry; and

a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:

determine a target dataset from among a plurality of preexisting datasets based on a request including a query for execution and a temporal granularity;

query the target dataset based on the request; and

generate an output based on a query result received in response to querying the target dataset, wherein each of the plurality of preexisting datasets is based on at least one temporal data requirement, wherein the plurality of datasets is generated based on a data model, the data model including a data structure and representing a set of data larger in size than at least one of the plurality of datasets, wherein at least one dataset of the plurality of datasets has a size that is different from respective sizes of other datasets.

9. The system of claim 8 , wherein the target dataset is a first target dataset and wherein the memory contains further instructions that, when executed by the processing circuitry further configure the system to:

determine a plurality of target datasets including the first target dataset, wherein each target dataset is determined based on the request and a respective temporal data requirement.

10. The system of claim 9 , wherein the memory contains further instructions that, when executed by the processing circuitry further configure the system to:

generate the output based on a plurality of query results, each query result corresponding to a target dataset of the plurality of target datasets.

11. The system of claim 9 , wherein the memory contains further instructions that, when executed by the processing circuitry further configure the system to:

generate an aggregated dataset based on a subset of the plurality of target datasets; and

query the aggregated dataset based on the request.

12. The system of claim 11 , wherein the memory contains further instructions that, when executed by the processing circuitry further configure the system to:

further generate the aggregate dataset based on a weight assigned to each target dataset of the subset of the plurality of target datasets.

13. The system of claim 12 , wherein each weight is based on a temporal requirement of an associated target dataset.

Assignments (3)
SECURITY INTEREST Recorded Jun 14, 2023
From: SISENSE LTD; SISENSE SF INC.
To: HERCULES CAPITAL, INC.
Reel/Frame 063948/0662 →
RELEASE OF SECURITY INTEREST Recorded Jun 9, 2023
From: COMERICA BANK
To: SISENSE LTD.
Reel/Frame 063915/0257 →
SECURITY INTEREST Recorded Jan 17, 2023
From: SISENSE LTD.
To: COMERICA BANK
Reel/Frame 062392/0593 →
Continuity (3)
Continuation 16707324 · Dec 9, 2019
Provisional Application 62779871 · Dec 14, 2018
Related Publication 20220261452A1 · Aug 18, 2022