Thin-Client and Distributed Development Using Data Programming

• US 20120317559A1
• Filed: 08/06/2012
• Published: 12/13/2012
• Est. Priority Date: 04/07/2006
• Status: Active Grant

• Current Assignee: Blaine A. Bell, Steven K. Feiner
• Original Assignee: Blaine A. Bell, Steven K. Feiner
• Inventors: Bell, Blaine A., Feiner, Steven K.
• Granted Patent: US 9,253,286 B2
• Time in Patent Office: Days
• US Class Current: 717/151
• CPC Class Codes: G06F 16/2282 Tablespace storage structures; Management thereof
• CPC Class Codes: G06F 8/31 Programming languages or programming paradigms
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications
• CPC Class Codes: H04L 67/34 involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416

Abstract

A system and method of data programming includes declarative rule-based programming in which a distributed program for computers on a network is defined through tabular structures. The tabular structures can store logic, including data (e.g., primitive variables and dynamic data structures) and code (e.g., arguments and functions) that govern operation of the distributed program.

Claims

1. A method, comprising:

generating, by a first computer, a first tabular storage structure that includes data and code, wherein the code is defined by a column of the first tabular storage structure; and

executing, by the first computer, a program using the first tabular storage structure, wherein the code of the first tabular storage structure governs an operation of the program.

2. The method of claim 1, further comprising:

generating, by the first computer, a second tabular storage structure that includes data, wherein the execution of the program by the first computer also uses the data of the second tabular storage structure.

3. The method of claim 1, wherein a second computer includes a third tabular storage structure that includes the same data that is included in the first tabular storage structure of the first computer.

4. The method of claim 3, wherein the program is a distributed program.

5. The method of claim 3, further comprising:

generating, by the first computer, a set of system tabular storage structures that define a manner of replicating at least part of the first tabular storage structure to the second computer.

6. The method of claim 3, further comprising:

using, by the first computer, a function that changes the third tabular storage structure of the second computer, a column of the third tabular storage structure of the second computer, or a row of the third tabular storage structure of the second computer.

7. The method of claim 3, wherein the first computer maintains a master record for a first row in the first and third tabular storage structures and the second computer maintains a master record for a second row in the first and third tabular storage structures.

8. The method of claim 1, further comprising:

using, by the first computer, a function that changes the first tabular storage structure, a column of the first tabular storage structure, or a row of the first tabular storage structure.

9. The method of claim 1, wherein the code of the first tabular storage structure includes a graphical function that is executed every time a frame is rendered by the first computer or a function that is executed when data in the first tabular storage structure is changed.

10. The method of claim 1, wherein the code of the first tabular storage structure includes a function that modifies a control flow statement, wherein the control flow statement is a loop or a conditional block of code.

11. The method of claim 1, further comprising:

generating, by the first computer, a unified function that provides access and controls system functions,

user-defined functions, and

memory allocation/de-allocation functions.

12. The method of claim 11, wherein the system functions account for fundamental functions, the user-defined functions temporarily allocate memory to recursively call the unified function as a sequence of commands that share arguments, and the memory allocation/de-allocation functions create or remove a row in a table.

13. A first computer, comprising:

a processor; and

a memory,

wherein the processor is configured to

generate a first tabular storage structure that includes data and code, wherein the code is defined by a column of the first tabular storage structure; and

execute a program using the first tabular storage structure, wherein the code of the first tabular storage structure governs an operation of the program.

14. The first computer of claim 13, wherein the processor is further configured to:

generate a second tabular storage structure that includes data, wherein the execution of the program by the first computer also uses the data of the second tabular storage structure.

15. The first computer of claim 13, wherein the first computer is connected to a second computer via a network, and the second computer includes a third tabular storage structure that includes the same data that is included in the first tabular storage structure of the first computer.

16. The first computer of claim 15, wherein the program is a distributed program.

17. The first computer of claim 15, wherein the processor is further configured to:

generate a set of system tabular storage structures that define a manner of replicating at least part of the first tabular storage structure to the second computer.

18. The first computer of claim 15, wherein the processor is further configured to:

use a function that changes the third tabular storage structure of the second computer, a column of the third tabular storage structure of the second computer, or a row of the third tabular storage structure of the second computer.

19. The first computer of claim 15, wherein the first computer maintains a master record for a first row in the first and third tabular storage structures and the second computer maintains a master record for a second row in the first and third tabular storage structures.

20. The first computer of claim 13, wherein the processor is further configured to:

use a function that changes the first tabular storage structure, a column of the first tabular storage structure, or a row of the first tabular storage structure.

21. The first computer of claim 13, wherein the code of the first tabular storage structure includes a graphical function that is executed every time a frame is rendered by the first computer or a function that is executed when data in the first tabular storage structure is changed.

22. The first computer of claim 13, wherein the code of the first tabular storage structure includes a function that modifies a control flow statement, wherein the control flow statement is a loop or a conditional block of code.

23. The first computer of claim 13, wherein the processor is further configured to:

generate a unified function that provides access and controls

system functions,

user-defined functions, and

memory allocation/de-allocation functions.

24. The first computer of claim 23, wherein the system functions account for fundamental functions, the user-defined functions temporarily allocate memory to recursively call the unified function as a sequence of commands that share arguments, and the memory allocation/de-allocation functions create or remove a row in a table.