| 摘要 |
A relational processor (RP) is described for storing relational instances and processing queries using a unique mapping to an associate. The associate may contain one or more semantic tokens. The RP comprises an input means for receiving and processing input query packets, at least one associate processor (AP) for retrieving associate sets by domain and at least one set processor (SP) for performing set operations on associate sets. An output means collects, formats and transmits the associates or associated information responsive to a query to at least one user or a machine. The RP further includes an associate array manager (AAM) for managing APs, an associate switch (AS) and a response collector (RC). The AS routs specific associates to specific SPs. The SP is adaptable to perform set operations on the associates. An alternate unique SP Sieve architecture is described which does not require the AS. The RP is able to perform longest prefix match using a new algorithm.
|
