Stanley Ray Zanarotti

US Patent:

20140053070, Feb 20, 2014

Filed:

May 31, 2013

Appl. No.:

13/907274

Inventors:

Stanley R. Zanarotti - Cambridge MA, US
James Clark - Andover MA, US

International Classification:

G06F 3/0484

US Classification:

715708

Abstract:

Configuring a set of guided documents for operation of a business activity based on a workflow for the activity, industry expertise, and a plurality of models of source data that is relevant to the business activity, wherein points of entry to access the guided documents are organized around one or more industry-specific data dimensions.

US Patent:

20140068431, Mar 6, 2014

Filed:

Nov 7, 2013

Appl. No.:

14/074269

Inventors:

Stanley R. Zanarotti - Cambridge MA, US
James Clark - Andover MA, US

Assignee:

Dimensional Insight Incorporated - Burlington MA

International Classification:

G06F 3/048

US Classification:

715708

Abstract:

Configuring a set of guided documents for operation of a business activity based on a workflow for the activity, industry expertise, and a plurality of models of source data that is relevant to the business activity, wherein points of entry to access the guided documents are organized around one or more industry-specific data dimensions.

US Patent:

54427843, Aug 15, 1995

Filed:

Jun 17, 1993

Appl. No.:

8/078396

Inventors:

Frederick A. Powers - Sudbury MA
Stanley R. Zanarotti - Cambridge MA

Assignee:

Dimensional Insight, Inc. - Burlington MA

International Classification:

G06F 1730

US Classification:

395600

Abstract:

The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

US Patent:

54045126, Apr 4, 1995

Filed:

Jun 17, 1993

Appl. No.:

8/079248

Inventors:

Frederick A. Powers - Sudbury MA
Stanley R. Zanarotti - Cambridge MA

Assignee:

Dimensional Insight, Inc. - Burlington MA

International Classification:

G06F 1540

US Classification:

395600

Abstract:

The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

US Patent:

54045134, Apr 4, 1995

Filed:

Jun 17, 1993

Appl. No.:

8/079249

Inventors:

Frederick A. Powers - Sudbury MA
Stanley R. Zanarotti - Cambridge MA

Assignee:

Dimensional Insight, Inc. - Burlington MA

International Classification:

G06F 1540

US Classification:

395600

Abstract:

The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

US Patent:

52573656, Oct 26, 1993

Filed:

Mar 16, 1990

Appl. No.:

7/495360

Inventors:

Frederick A. Powers - Sudbury MA
Stanley R. Zanarotti - Cambridge MA

International Classification:

G06F 1540

US Classification:

395600

Abstract:

The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

US Patent:

20220366339, Nov 17, 2022

Filed:

Jul 20, 2022

Appl. No.:

17/869619

Inventors:

- Burlington MA, US
Stanley R. Zanarotti - Cambridge MA, US
James Clark - Andover MA, US

International Classification:

G06Q 10/06
G06F 16/955
G06F 16/26

Abstract:

A computer-implemented method includes accessing data from distinct data domains corresponding to different data sources, and determining a core dimension of the accessed data common to first and second distinct data domains. The method further includes generating a data set from the data sources using a columnar data generation engine, and deriving, from the data set via stateless processing, a first guided page including actionable elements depicting data derived from the first distinct data domain. The method further includes responsive to a user interaction with one of the actionable elements, providing, dependent on the common core dimension, direct navigation from the first to the second distinct data domain, and predicting, from the data set based on machine learning and prior to the user interaction, a second guided page that depicts data derived from the second distinct data domain and is presented responsive to the direct navigation.

US Patent:

20200402005, Dec 24, 2020

Filed:

Jul 2, 2020

Appl. No.:

16/919166

Inventors:

- Burlington MA, US
Stanley R. Zanarotti - Cambridge MA, US
James Clark - Andover MA, US

International Classification:

G06Q 10/10
G06F 3/0481

Abstract:

A computer-implemented method includes generating, via a multi-user business collaboration platform, at least one guided navigation page based at least in part on data used to measure a goal associated with a workflow of a business. The method further includes facilitating direct navigation among a plurality of data domains in response to a user selection of one of a plurality of displayable actionable elements each associated with at least one core dimension of information predetermined to be pertinent to the continuation of the workflow of the business. The method further includes applying goal attainment algorithms to at least a portion of the data and recommending a candidate collaboration project in a user interface of the multi-user business collaboration platform. The candidate collaboration project includes team members selected from a list of team members associated with the workflow for the business.