US2008059496A1PendingUtilityA1

Thin-client and distributed development using data programming

Assignee: BELL BLAINE APriority: Apr 7, 2006Filed: Apr 6, 2007Published: Mar 6, 2008
Est. expiryApr 7, 2026(expired)· nominal 20-yr term from priority
G06F 8/31H04L 67/34G06F 16/2282G06F 9/542
47
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

According to an embodiment of the disclosed subject matter, 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

exact text as granted — not AI-modified
1 . A system for generating a distributed program over a network of computers, comprising: 
 (a) at least one first computer, each including memory storing at least one tabular data storage structure corresponding to said distributed program;    (b) at least one second computer, each coupled to said at least one first computers to form said network of computers, and each including memory storing at least one tabular data storage structure corresponding to said distributed program;    (c) wherein said tabular data storage structure of each of said first computers and said tabular data storage structure of each of said second computers define said distributed program and store data for said distributed program.    
     
     
         2 . The system of  claim 1 , wherein said at least one first computer comprises a server computer.  
     
     
         3 . The system of  claim 2 , wherein said at least one second computer comprises a plurality of client computers.  
     
     
         4 . The system of  claim 3 , wherein each of said plurality of client computers are directly coupled either to said server computer or to a different one of said client computers.  
     
     
         5 . The system of  claim 1 , wherein said tabular data storage structure of each of said first computers and said data storage structure of each of said second computers comprises one or more two-dimensional tables, each including two or more columns defining said distributed program and two or more rows storing information for said distributed program.  
     
     
         6 . The system of  claim 5 , wherein each of said columns of said one or more tables are defined identically.  
     
     
         7 . The system of  claim 6 , wherein each of said one or more tables are defined identically.  
     
     
         8 . The system of  claim 6 , wherein said at least one first computers stores a master record of all data stored in each of said rows of each of said tables of each of said second computers.  
     
     
         9 . The system of  claim 6 , wherein each of said at least one first computers and said second computers stores a master record of all data stored in each of said rows of each of said tables of each of said first computers and each of said second computers.  
     
     
         10 . A method for generating a distributed program over a network of computers, comprising: 
 (a) forming said network of computers by coupling at least one first computer to at least one second computer;    (b) creating at least one tabular data storage structure corresponding to said distributed program on each of said first computers and on each of said second computers ; and    (c) populating said tabular data storage structures of each of said first computers and said data storage structures of each of said second computers with data to generate said distributed program.    
     
     
         11 . The method of  claim 10 , wherein (b) comprises creating one or more two-dimensional tables, each including two or more columns defining said distributed program and two or more rows storing information for said distributed program.  
     
     
         12 . The method of  claim 11 , wherein each of said columns of said one or more tables are defined identically.  
     
     
         13 . The method of  claim 12 , wherein each of said one or more tables are defined identically.  
     
     
         14 . The method of  claim 12 , wherein (c) comprises populating said at least one first computer with a master record of all data stored in each of said rows of each of said tables of each of said second computers.  
     
     
         15 . The method of  claim 12 , wherein (c) comprises populating each of said at least one first computers and said second computers with a master record of all data stored in each of said rows of each of said tables of each of said first computers and each of said second computers.  
     
     
         16 . The method of  claim 12 , wherein (c) comprises populating only one of said first or second computers with a master record of data for a particular row for a particular table.  
     
     
         17 . The method of  claim 12 , further comprising changing one or more of said two or more columns at said at least one first computer to form a revised one or more columns, and transmitting said revised one or more columns to said at least one second computers.  
     
     
         18 . The method of  claim 12 , further comprising changing one or more of said two or more rows of said at least one first computer to form a revised one or more rows, and transmitting said revised one or more rows to at least one of said at least one second computers.  
     
     
         19 . The method of  claim 11 , wherein said columns of said one or more tables include data columns and function columns.  
     
     
         20 . The method of  claim 11 , wherein said rows of said one or more tables include data and functions.

Join the waitlist — get patent alerts

Track US2008059496A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.