Abstract:
Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time.
Abstract:
A method and apparatus for creating and using cached blocks of bytecode are disclosed. An example apparatus includes a virtual machine execution engine configured to load an input variable value in conjunction with starting execution of bytecode associated with an application. The execution engine is also configured to read a cache table entry stored in a class file related to the application. The cache table entry includes a demarcation of a selected portion of the bytecode of the application that is stored within a cache block, a cache block input variable, and a cache block output variable. The execution engine is further configured to compare the loaded input variable value to the cache block input variable. Responsive to the input variable value matching the cache block input variable, the execution engine is configured to skip execution of the selected portion of the bytecode and read the cache block output variable.
Abstract:
Systems and methods are provided for data federation query suggestion. An example system includes a query constraint database including at least one query constraint and a query constraint resolving module that receives from a user a query to search a federated database using a federated database search engine and determines if the query satisfies at least one query constraints. The system further includes a query suggestion module that determines a query suggestion if the query does not satisfy at least one query constraints.
Abstract:
Various examples are directed to systems and methods for managing a database comprising data items from a constituent source. A federation engine may receive from a first client a first client query. The first client query may reference a data item stored at a constituent data source. The federation engine may determine that the first client query is a complex client query and send the first client query to an administrator system.
Abstract:
Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time.
Abstract:
An example method of loading classes from a content repository includes storing a set of files in a content repository. The set of files includes a representation of a set of classes. The method also includes extracting first metadata that describes the set of classes and storing the first metadata in a content repository. The method further includes receiving a request including second metadata corresponding to one or more classes of the set of classes. The request is from a repository-class loader executable in a node. The method also includes selecting, based on the second metadata, a class of the set of classes. The method further includes sending the selected class to the repository-class loader for loading into the node.
Abstract:
A method includes consulting a database that includes a first entry indicating amounts of time that a first service provider machine takes to perform individual actions of the plurality of actions and a second entry indicating amounts of time that a second service provider machine takes to perform individual actions of the plurality of actions; generating a first estimate for the amount of time the first service provider machine is expected to take in processing the requested service, wherein generating the first estimate includes summing times associated with the plurality of actions from the first entry; and generating a second estimate for the amount of time the second service provider machine is expected to take in processing the requested service, wherein generating the second estimate includes summing times associated with the plurality of actions from the second entry.
Abstract:
Providing messages for Java message service (JMS) is disclosed. A described method includes determining timestamp information associated with a first Java™ message service (JMS) message. The timestamp information represents a time when the JMS message is either generated or received by a processing device. The method also includes determining destination information associated with the JMS message. The method further includes converting the JMS message into a first key-value data pair having a key data and a value data. The key data includes the timestamp information and the value data includes the destination information of the first JMS message.
Abstract:
Systems and methods for testing and deploying an update are provided. A first server can execute a current version of an application in a production environment. A client communication from a client to the first server can be identified. The client communication can be transmitted to a second server in the production environment. The second server can be executing an updated version of the application. A first response to the client communication from the first server and a second response to the client communication from the second server can be received. The first response from the first server can be compared with the second response from the second server to determine whether the updated version of the application is compatible with the production environment.
Abstract:
Systems and methods for modifying bytecode at runtime are provided. A virtual machine can execute bytecode of an application. The virtual machine can receive a modification for the application that includes modified bytecode for the application. The virtual machine can identify a portion of the bytecode of the application that corresponds to the modified bytecode. The virtual machine can update the portion of the bytecode of the application at runtime using the modification.