6. A relational processor (RP) to create, maintain and query a relational database by assigning, storing and retrieving a unique associate for each instance of a relation for one or more relations and a plurality of instances of a relation, comprising (a) input means to receive data comprised of one or more relations, one or more relation instances, and one or more queries with additional means to (1) assign an integer i to a relation R making an Ri thereby allowing multiple relations each with its own number of domains k making relations of the form Ri (d 1 , d 2 , through dk) where a dk is the k th domain; (2) assign the integer j to the j th instance of said Ri making Rij; (3) make an associate aij comprising said i and said j; (4) output said Rij, said aij and said query; (b) an Associate Array Manager (AAM) with means to (1) receive said Rij, said aij and said query from the input means; (2) decompose said Rij into k single domain instances rij making rij (d 1 ), rij (d 2 ), through rij (dk); (3) make k single domain relation keys comprised of the relation index i and the domain value i|d 1 |, i|d 2 | through i|dk|; (4) make k single domain relation commands comprising retrieve (also called the search command) and store (also called the insert command); (5) output said domain keys i|d 1 |, i|d 2 | through i|dk| and said k commands to a specified Associate Processor for each of the k domains; (c) one or more Associate Processors (AP) each including memory means each with processing means to (1) receive the single domain keys i|d 1 |, i|d 2 | through i|dk|, the aij and the k single domain commands from the AAM; (2) store in said memory said associate aij using said single domain keys i|d 1 |, i|d 2 | through i|dk|, if said Rij does not exist in the database; (3) retrieve from said memory for each said single domain key the corresponding sets of associates denoted {aij} 1 , {aij} 2 , through {aij} k; (4) output said associate sets {aij} 1 , {aij} 2 , through {aij} k to one or more Set Processors (SP); (d) one or more Set Processors each comprising (1) input means to receive intra single domain commands comprising at least AND for each said single domain; (2) input means to receive said sets {aij} 1 , {aij} 2 , through {aij} k output by one or more said AP; (3) memory (also known as Set Memory) and processing means to store said associate sets implicitly using said indices i, j and k where implicitly comprises using the indices i and j to address a word in said Set Memory (also called the Set Memory Word) and the indices 1 , 2 , through k to set bit 0, bit 1, through bit k−1 in said Set Memory Word, for each aij that is in said associate sets {aij} 1 , {aij} 2 , through {aij} k; (4) logic processing means to perform the set intersection operation on said sets {aij} 1 , {aij} 2 , through {aij} k making the response set {aij} using said Set Memory words; (5) output means for outputting associates {aij} responsive to a query.
6. A relational processor (RP) to create, maintain and query a relational database by assigning, storing and retrieving a unique associate for each instance of a relation for one or more relations and a plurality of instances of a relation, comprising (a) input means to receive data comprised of one or more relations, one or more relation instances, and one or more queries with additional means to (1) assign an integer i to a relation R making an Ri thereby allowing multiple relations each with its own number of domains k making relations of the form Ri (d 1 , d 2 , through dk) where a dk is the k th domain; (2) assign the integer j to the j th instance of said Ri making Rij; (3) make an associate aij comprising said i and said j; (4) output said Rij, said aij and said query; (b) an Associate Array Manager (AAM) with means to (1) receive said Rij, said aij and said query from the input means; (2) decompose said Rij into k single domain instances rij making rij (d 1 ), rij (d 2 ), through rij (dk); (3) make k single domain relation keys comprised of the relation index i and the domain value i|d 1 |, i|d 2 | through i|dk|; (4) make k single domain relation commands comprising retrieve (also called the search command) and store (also called the insert command); (5) output said domain keys i|d 1 |, i|d 2 | through i|dk| and said k commands to a specified Associate Processor for each of the k domains; (c) one or more Associate Processors (AP) each including memory means each with processing means to (1) receive the single domain keys i|d 1 |, i|d 2 | through i|dk|, the aij and the k single domain commands from the AAM; (2) store in said memory said associate aij using said single domain keys i|d 1 |, i|d 2 | through i|dk|, if said Rij does not exist in the database; (3) retrieve from said memory for each said single domain key the corresponding sets of associates denoted {aij} 1 , {aij} 2 , through {aij} k; (4) output said associate sets {aij} 1 , {aij} 2 , through {aij} k to one or more Set Processors (SP); (d) one or more Set Processors each comprising (1) input means to receive intra single domain commands comprising at least AND for each said single domain; (2) input means to receive said sets {aij} 1 , {aij} 2 , through {aij} k output by one or more said AP; (3) memory (also known as Set Memory) and processing means to store said associate sets implicitly using said indices i, j and k where implicitly comprises using the indices i and j to address a word in said Set Memory (also called the Set Memory Word) and the indices 1 , 2 , through k to set bit 0, bit 1, through bit k−1 in said Set Memory Word, for each aij that is in said associate sets {aij} 1 , {aij} 2 , through {aij} k; (4) logic processing means to perform the set intersection operation on said sets {aij} 1 , {aij} 2 , through {aij} k making the response set {aij} using said Set Memory words; (5) output means for outputting associates {aij} responsive to a query. 19. The AP of claim 6 wherein each said AP signals every other AP, SP and the AAM upon detecting that the aij corresponding to an rij is not in the AP memory whereby the is terminated and the search accelerated and the insert and delete commands may be accelerated.