Computer network

• US 6,421,670 B1
• Filed: 04/15/1996
• Issued: 07/16/2002
• Est. Priority Date: 04/15/1996
• Status: Expired due to Term

• Current Assignee: Clive M. Fourman
• Original Assignee: Clive M. Fourman
• Inventors: Fourman, Clive M
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US08/632,240
• Time in Patent Office: 2,283 Days
• Field of Search: 707/10
• US Class Current: 1/1
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/278 Data partitioning, e.g. horizontal or vertical partitioning

Abstract

A multidimensional database is read, written to and replicated over a computer network by accessing an ordered list of N-M component keys (where N is the dimensionality of the database and M is an integer greater than one and less than N, each key being associated with an M-dimensional data slice represented by a text string with control characters to define the rows and columns. Each such data slice is individually replicated to update remote replica copies of the database.

Claims

1. A network of computers having:

i) individual data entry means;

ii) at least one communications link for transferring data entered from a said data entry means to other computers in the network;

iii) a distributed N-dimensional database accessible and updateable by said computers, N being an integer greater than two, said N-dimensional database comprising;

a) a plurality of M-dimensional arrays where M is an integer greater that one and less than N, and

b) an ordered list of keys, each key being associated with a particular M-dimensional array and having a string of N minus M (N−

M) components which identify the associated M-dimensional array, said string defining the order of the key in said list;

iv) searching means for finding a desired M-dimensional array in response to entry of said key from a said data entry means;

v) updating means for modifying a found M-dimensional array, and

vi) replicating means for replicating modifications to said modified M-dimensional array over the network.

2. A network as in claim 1 wherein each said M-dimensional array comprises data separated by control characters for defining its M-dimensional structure.

3. A network as in claim 1 wherein M is 2.

4. A network as in claim 1 wherein

at least one of said M-dimensional arrays has a hierarchical structure,

rows and/or columns at one level in the hierarchy being divided into groups at an adjacent lower level in the hierarchy, and

the levels in the hierarchy being selectable by individual users.

5. A network as in claim 4 wherein levels in said hierarchical structure below the top level are associated with extra components in the string of the key corresponding to the top level of the hierarchy.

6. A network as in claim 1 wherein said replicating means comprises program means for transmitting modifications to the distributed database over the network at predetermined intervals.

7. A network as in claim 6 wherein said program means further comprises override means for forcing a replication of modifications to the distributed database in response to entry of a command from a data entry means.

8. A network as in claim 1 comprising spreadsheet means for performing calculations on the data in said distributed database.

9. A network as in claim 1 wherein N is at least two greater than M, each string comprising at least two components.

10. A network as in claim 1 which is connected to the World Wide Web and wherein the data is stored and retrieved as HTML data.

11. A network of computer having:

i) individual data entry means;

ii) at least one communications link for transferring data entered from a said data entry means to other computers in the network;

iii) a distributed N-dimensional database accessible and updateable by said computers, N being, an integer greater than two, said N-dimensional database comprising;

a) a plurality of M-dimensional arrays where M is an integer greater than one and less than N, and

b) an ordered list of keys, each key being associated with a particular M-dimensional array and having a string of N minus M (N−

M) components which identify the associated M-dimensional array, said string defining the order of the key in said list;

iv) searching means for finding a desired M-dimensional array in response to entry of said key from a said data entry means;

v) updating means for modifying a found M-dimensional array, and

vi) replicating means for replicating modifications to said modified M-dimensional array over the network;

at least one of said M-dimensional arrays being associated with textual comments, and a further class of COMMENT keys being provided for sorting such textual comments.

12. A network as in claim 11 wherein the keys of said further class are identified by a prefix or suffix to said textual comments.

13. A method for updating a distributed N-dimensional database in a network of computers having at least one communications link for transferring data entered at one computer to other computers in the network, said method comprising:

(i) organizing a distributed N-dimensional database, N being an integer greater than two, to include;

a) a plurality of M-dimensional arrays where in is an integer greater than one and less than N, and

b an ordered list of keys, each key being associated with a particular in M-dimensional array and having a string of N minus M (N−

M) components which identify the associated M-dimensional array, said string defining the order of the key in said list;

(ii) searching for and finding a desired M-dimensional array in response to entry of a key at one of said computers; and

(iii) modifying a found M-dimensional array and replicating such modification to said distributed array over the network.

14. A method as in claim 13 wherein each said M-dimensional array comprises data separated by control characters for defining its M-dimensional structure.

15. A method as in claim 13 wherein in is 2.

16. A method as in claim 13 wherein:

at least one of said M-dimensional arrays has a hierarchical structure,

rows and/or columns at one level in the hierarchy being divided into groups at an adjacent lower level in the hierarchy, and

the levels in the hierarchy being selectable by individual users.

17. A method as in claim 16 wherein levels in said hierarchical structure below the top level are associated with extra components in the string of the key corresponding to the top level of the hierarchy.

18. A method as in claim 13 wherein said replicating step comprises transmitting modifications to the distributed database over the network at predetermined intervals.

19. A method as in claim 18 further comprising forcing a replication of modifications to the distributed database in response to entry of a command from a computer.

20. A method as in claim 13 comprising performing calculations on the data in said distributed database.

21. A method as in claim 13 wherein N is at least two greater than M, each string comprising at least two components.

22. A method as in claim 13 which includes data communication over the World Wide Web and wherein the data is stored and retrieved as HTML data.

23. A method for updating a distributed N-dimensional database in a network of computers having at least one communications link for transferring data entered at one computer to other computers in the network, said method comprising:

(i) organizing a distributed N-dimensional database, N being an integer greater than two, to include;

a) a plurality of M-dimensional arrays where M is an integer greater than one and less than N, and

b) an ordered list of keys, each key being associated with a particular M-dimensional array and having a string of N minus M (N−

M) components which identify the associated M-dimensional array, said string defining the order of the key in said list;

(ii) searching for and finding a desired M-dimensional array in response to entry of a key at one of said computers; and

(iii) modifying a found M-dimensional array and replicating such modification to said distributed in over the network;

at least one of said M-dimensional arrays being associated with textual comments, and

a further class of COMMENT entries being provided for sorting such textual comments.

24. A method as in claim 23 wherein the entries of said further class are identified by a prefix or suffix to said textual comments.