Abstract: In an example, a machine learning algorithm is used to train an entity risk evaluation model to output an entity risk score based on transaction data in a computer network. Entity risk scores for various entities may be stored in a database, and retrieved and displayed upon user interaction with one or more reports involving corresponding entities.

Abstract: In an example, a machine learning algorithm is used to train an entity risk evaluation model to output an entity risk score based on transaction data in a computer network. Entity risk scores for various entities may be stored in a database, and retrieved and displayed upon user interaction with one or more reports involving corresponding entities.

Abstract: Indexing and routing to event data is described. Event data is assigned an identifier that identifies the data type and the contents of event data within an enterprise system. The event data may be real-time event data. With the identifier, a source of the event data is determined, and the source can be queried for the event data in real-time. The identifier is indexed along with other event data identifiers. Based on the location of the event data, the system sends out a query toward the data source to obtain the information, but also to route the query to the data source, rather than attempting to pull data towards the query source and process it at the query source.

Abstract: Merging of query elements in an enterprise system is described. The enterprise system receives queries, which may each be broken down into query components. The enterprise system identifies query components that are related to identical event information from a data source of the enterprise. The enterprise system sends a single query to the data source for the event information, receives the response, and sends the response to the query sources.

Abstract: Indexing and routing to event data is described. Event data is assigned an identifier that identifies the data type and the contents of event data within an enterprise system. The event data may be real-time event data. With the identifier, a source of the event data is determined, and the source can be queried for the event data in real-time. The identifier is indexed along with other event data identifiers. Based on the location of the event data, the system sends out a query toward the data source to obtain the information, but also to route the query to the data source, rather than attempting to pull data towards the query source and process it at the query source.

Abstract: Indexing and routing to event data is described. Event data is assigned an identifier that identifies the data type and the contents of event data within an enterprise system. The event data may be real-time event data. With the identifier, a source of the event data is determined, and the source can be queried for the event data in real-time. The identifier is indexed along with other event data identifiers. Based on the location of the event data, the system sends out a query toward the data source to obtain the information, but also to route the query to the data source, rather than attempting to pull data towards the query source and process it at the query source.

Abstract: Parsing of event queries in an enterprise system is described. The enterprise system receives queries, which are broken down into query components. The query components each represent segments of the query. The enterprise system identifies sources of event data and sends queries towards the sources of the event data. The query components are processed close to the data source. The responses are combined to generate an event query response that indicates the event data of each of the query components.

Abstract: A hierarchical shortest path first (HSPF) protocol, routers of a network are grouped in areas, and routing and client subscription information are distributed through all levels of the network hierarchy in the same way. Each level of the hierarchy identifies its connections with its peers that have the same level of hierarchy, and represents areas outside its own as individual nodes. The number of levels of hierarchy is not limited to any particular number, and each level performs the same operations to share routing information and generate routes for data. Distribution of link-state and client subscription information begins at the router level, and continues up the levels of the hierarchy until distributed through the network.

Abstract: Indexing and routing to event data is described. Event data is assigned an identifier that identifies the data type and the contents of event data within an enterprise system. The event data may be real-time event data. With the identifier, a source of the event data is determined, and the source can be queried for the event data in real-time. The identifier is indexed along with other event data identifiers. Based on the location of the event data, the system sends out a query toward the data source to obtain the information, but also to route the query to the data source, rather than attempting to pull data towards the query source and process it at the query source.

Abstract: Merging of query elements in an enterprise system is described. The enterprise system receives queries, which may each be broken down into query components. The enterprise system identifies query components that are related to identical event information from a data source of the enterprise. The enterprise system sends a single query to the data source for the event information, receives the response, and sends the response to the query sources.

Abstract: Parsing of event queries in an enterprise system is described. The enterprise system receives queries, which are broken down into query components. The query components each represent segments of the query. The enterprise system identifies sources of event data and sends queries towards the sources of the event data. The query components are processed close to the data source. The responses are combined to generate an event query response that indicates the event data of each of the query components.

Abstract: The invention comprises a method and apparatus for information management of a network database having distributed data sources. One embodiment of the invention comprises the steps of decomposing a query into at least one network message for transmission using characteristic routing over a network only to data sources relevant to the query, the query specifying at least one data source; receiving a reply message in response to the network message over the network; and generating a result for the query from the reply message. The query is received in a database language and the generated result is in the database language. The query further specifies a period of time during which the query is valid.

Abstract: The invention comprises a method in a content routing network for reducing memory and control information transmission overhead, comprising the step of compressing a summary bit vector of a Bloom Filter used in the content routing network. The summary bit vector is compressed using a technique which allows for direct and in-place manipulation to individual bits in the vector and does not allow for direct and in-place manipulation to individual bits in the vector.

Abstract: A system and method for facilitating asynchronous disconnected operations for data access over a network are described. In one preferred embodiment, a query in a database language is received from a user in a network. The query is converted into a plurality of network messages, each network message containing a fragment of the query. The network messages are transmitted through a network of a plurality of dynamic query routing nodes toward a plurality of data sources that are relevant to the query. When the network message reaches a leaf router with a corresponding relevant data source, a determination is made whether each data source of a plurality of disparate data sources is either in a connected or disconnected state, each data source storing data related to the query fragment within each network message.