# US 11,308,162 B2 · Datumtronic knowledge server > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,308,162 B2 - Document ID: US11308162B2 - Status: Granted - Kind: B2 - Application number: 16/742,983 - Filed: 2020-01-15 - Published: 2020-05-14 - Granted: 2022-04-19 - Earliest claimed: 2017-04-17 - Assignees: Datumtron Corporation - Applicants: Datumtron Corporation - Inventors: Ashraf Azmi - Web page: https://patentgrep.com/patent/US11308162B2 ## CPC - G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)} - G06F 16/22: Indexing; Data structures therefor; Storage structures - G06N 5/022: Knowledge engineering; Knowledge acquisition - H04L 67/1001: for accessing one among a plurality of replicated servers - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract Systems and methods are provided for assigning client requests to one or more computer-implemented knowledge/database servers. Each server stores data as a directed acyclic graph of datums connected with a single type of relationship. The system includes a plurality of clients coupled to at least one router, wherein each client includes a graphical user interface and a processor configured to analyze inputted data, a plurality of routers configured to assign requests input though the plurality of clients to a plurality servers, at least one logger configured that includes a storage medium and is configured to store the requests, and a plurality of servers configured to perform tasks indicated by the requests. ## Claims ### Claim 1 A system for assigning client requests to one or more computer-implemented servers, comprising: at least one client coupled to at least one router, wherein each of the at least one client includes a processor configured to analyze inputted data; a plurality of routers configured to assign requests input though the at least one client to the one or more computer-implemented servers, wherein each of the one or more computer-implemented servers comprise a datumtronic knowledge server configured to store the inputted data as a graph comprising nodes interconnected via one type of linkage, wherein the nodes represent datums, wherein each knowledge element is a pair of the datums connected by an is connection or each knowledge element is a katum, and wherein the katum is a datum having an attached primitive data type object; at least one processor having a memory, the memory having computer readable instructions stored thereon that, when executed by the at least one processor, enables the storing of the requests; and the one or more computer-implemented servers being configured to perform tasks indicated by the requests by deducing inferences from the graph in near-real time to identify new datums. ### Claim 2 (depends on 1) The system as recited in claim 1, wherein the processor further includes at least one logger, wherein the at least one logger includes a storage medium and is configured to store the requests. ### Claim 3 (depends on 1) The system as recited in claim 1, wherein each of the plurality of routers includes a unique identification code. ### Claim 4 (depends on 3) The system as recited in claim 3, wherein one of the plurality of routers is designated as a primary router. ### Claim 5 (depends on 4) The system as recited in claim 4, wherein each of the one or more computer-implemented servers is programmed to receive requests only from the primary router. ### Claim 6 (depends on 5) The system as recited in claim 5, wherein, if an error is found with the primary router, all of the at least one clients are configured to select a new primary router and the one or more computer-implemented servers become programmed to receive requests only from the new primary router. ### Claim 7 (depends on 6) The system as recited in claim 6, wherein the plurality of routers are defined as a set list of routers and each of the at least one clients is in possession of the set list of routers. ### Claim 8 (depends on 7) The system as recited in claim 7, wherein each of the at least one clients is configured to send requests to the primary router. ### Claim 9 (depends on 8) The system as recited in claim 8, wherein a first computer-implemented server in the list of servers is designated as a primary server. ### Claim 10 (depends on 9) The system as recited in claim 9, wherein the primary server is configured to validate the tell request, and wherein the primary router, once the tell request is validated, is configured to route the tell request to the one or more computer-implemented servers. ### Claim 11 (depends on 5) The system as recited in claim 5, wherein the one or more computer-implemented servers are set as a list of servers in a particular order. ### Claim 12 (depends on 11) The system as recited in claim 11, wherein the primary router is configured to route a tell request to the primary server first. ### Claim 13 A method for assigning client requests to one or more computer-implemented servers, comprising: receiving, from at least one client coupled to at least one router, at least one request, wherein each of the at least one client includes a processor configured to analyze inputted data; assigning, using a plurality of routers, requests to a one or more computer-implemented servers, wherein each of the one or more computer-implemented servers comprise a datumtronic knowledge server configured to store the inputted data as a graph comprising nodes interconnected via one type of linkage, wherein the nodes represent datums, wherein each knowledge element is a pair of the datums connected by an is connection or each knowledge element is a katum, and wherein the katum is a datum having an attached primitive data type object; storing, in memory, one or more requests; and performing, using the one or more computer-implemented servers, tasks indicated by the requests assigned to each of the one or more computer-implemented servers by deducing inferences from the graph in near-real time to identify new datums. ### Claim 14 (depends on 13) The method as recited in claim 13, wherein each of the plurality of routers includes a unique identification code. ### Claim 15 (depends on 14) The method as recited in claim 14, further comprising designating one of the plurality of routers as a primary router. ### Claim 16 (depends on 15) The method as recited in claim 15, further comprising programming each of the one or more computer-implemented servers is to receive requests only from the primary router. ### Claim 17 (depends on 16) The method as recited in claim 16, further comprising, if an error is found with the primary router, selecting, using the at least one client, a new primary router, and wherein the one or more computer-implemented servers become programmed to receive requests only from the new primary router. ### Claim 18 (depends on 17) The method as recited in claim 17, wherein the plurality of routers are defined as a set list of routers and each of the at least one clients is in possession of the set list of routers. ### Claim 19 (depends on 18) The method as recited in claim 18, wherein each of the at least one clients is configured to send requests to the primary router. ### Claim 20 (depends on 13) The method as recited in claim 13, wherein the one or more computer-implemented servers are set as a list of servers in a particular order. ### Claim 21 (depends on 13) The method as recited in claim 13, further comprising designating a first computer-implemented server in the list of servers as a primary server. ### Claim 22 (depends on 13) The method as recited in claim 13, further comprising routing, using the primary router, a tell request to the primary server first. ### Claim 23 (depends on 13) The method as recited in claim 13, further comprising: validating, using the primary server, the tell request; and once the tell request is validated, routing, using the primary router, the tell request to the one or more computer-implemented servers. ### Claim 24 A system for assigning client requests to one or more computer-implemented servers, comprising: at least one client coupled to the one or more computer-implemented servers, wherein each of the at least one client includes a processor configured to analyze inputted data, wherein each of the at least one client is configured to assign requests to the one or more computer-implemented servers, wherein each of the one or more computer-implemented servers comprise a datumtronic knowledge server configured to store the inputted data as a graph comprising nodes interconnected via one type of linkage, wherein the nodes represent datums, wherein each knowledge element is a pair of the datums connected by an is connection or each knowledge element is a katum, and wherein the katum is a datum having an attached primitive data type object; at least one processor having a memory, the memory having computer readable instructions stored thereon that, when executed by the processor, enables the storing of the requests; and the one or more computer-implemented servers configured to perform tasks indicated by the requests by deducing inferences from the graph in near-real time to identify new datums. ### Claim 25 (depends on 24) The system as recited in claim 24, wherein the processor further includes at least one logger, wherein the at least one logger includes a storage medium and is configured to store the requests.