Abstract: A method for managing static data structures of a legacy data modeling software product in a dynamic class loader environment comprises constructing a bundle-specific registry for each software bundle in the dynamic class loader environment and instructing the legacy data modeling software product to use the bundle-specific registry rather than its default registry when creating in-memory representations of data model classes associated with a particular software bundle. Constructing a bundle-specific registry may include using the bundle's configuration metadata to calculate a dependency graph identifying the other bundles on which the software bundle depends. An initializer may construct the initial set of bundle-specific registries, and a listener may construct bundle-specific registries for new software bundles entering the system.

Abstract: A stream processing platform that provides fast execution of stream processing applications within a safe runtime environment. The platform includes a stream compiler that converts a representation of a stream processing application into executable program modules for a safe environment. The platform allows users to specify aspects of the program that contribute to generation of modules that execute as intended. A user may specify aspects to control a type of implementation for loops, order of execution for parallel paths, whether multiple instances of an operation can be performed in parallel or whether certain operations should be executed in separate threads. In addition, the stream compiler may generate executable modules in a way that cause a safe runtime environment to allocate memory or otherwise operate efficiently.

Abstract: Employees of the sales and service industry have to deal with a lot of information regarding their customers and clients. Keeping all the information available and accessible is difficult, especially when only certain information is relevant to the sales and service employees while trying to assist customers and clients. The augmented reality system disclosed herein allows employees in the sales and service industry to have contextually relevant information about their customers and clients presented quickly and accurately to them using an augmented reality display device.

Abstract: Disclosed are systems and methods for communicating with a sender machine and a receiver machine, and analyzing a bitmask associated with a message to be sent from the sender machine to the receiver machine, such that the bitmask comprises one or more presence bits and one or more absence bits, such that the presence bits indicate that an associated field of the message are included in the message and the absence bits indicate that an associated field of the message are omitted in the message. The systems and methods also dynamically determine compression instructions to compress the bitmask, and provide the compression instructions to the sender machine, wherein the compression instructions reduce size of the bitmask associated with the message to be sent to the receiver machine.

Abstract: A method and system for identifying a candidate subset of a data set comprises comparing suffixes of query field values to data field values of records in the data set. Sufficiently similar records are included in the candidate subset. Query field value suffixes may range in length from the query field value itself down to a minimum suffix length. The longest suffix may be processed first, and then successively shorter suffixes may be processed until a satisfactory number of candidates are identified. Entries in an index data structure derived from the data set may associate various suffixes found in the data set with individual records. The data structure entries may include record keys identifying records with data field values identical to the suffix and may also include suffix pointers identifying related data structure entries with suffixes similar to the entry's suffix.

Abstract: Steady state data distribution is provided between a client application, a leader machine, and a plurality of replica machines. The distribution comprises the leader machine receiving an operation request from the client application, the leader machine sending the prepare message to each of the plurality of replica machines, the replica machines recording in their logs information on the operation, the replica machines sending acknowledgement messages to the leader machine, and the leader machine sending commit command messages to the replica machines. A new quorum of the replica machines is created by using log information. Replica machines that become part of the new quorum are updated in an efficient manner.

Abstract: Systems and methods for fast, efficient content-based routing that allow a router to perform true content-based routing without having to de-serialize the data and apply a full content-based filter by determining the exact set of consumers to forward the data onto based on packet headers. A system for fast content-based routing may receive a subscription from a receiver machine and may assign a unique ID associated with the subscription in a router table. The system may then place a ID associated with a particular subscription in a message header if the message corresponds to the subscription. The system may then analyze the router table to determine one or more receiver machines associated with the ID in the header of the message. The system may then send, from a sender machine to one or more receiver machines, one or more messages containing the ID in the header of the message.

Abstract: Steady state data distribution is provided between a client application, a leader machine, and a plurality of replica machines. The distribution comprises the leader machine receiving an operation request from the client application, the leader machine sending the prepare message to each of the plurality of replica machines, the replica machines recording in their logs information on the operation, the replica machines sending acknowledgement messages to the leader machine, and the leader machine sending commit command messages to the replica machines. A new quorum of the replica machines is created by using log information. Replica machines that become part of the new quorum are updated in an efficient manner.

Abstract: Disclosed are systems and methods for efficient matching for content-based addressing wherein the systems and methods may: accept, at a receiver machine, a query; generate, at the receiver machine, a tree structure ordered by one or more fields of the query; analyze, at the receiver machine, a message from the sender machine; search, by the receiver machine, the tree structure using content from one or more fields of the message; determine, by the receiver machine, if the content values of the message match a content value of the query stored in the tree structure; and accept, by the receiver machine, the message if the content value of the message matches one or more content values of the query.

Abstract: A method includes communicating in a computer network a first message in a publish-subscribe arrangement or a queuing arrangement, and communicating a second message in a publish-subscribe arrangement or a queuing arrangement. The second message may be derived from the first message. The publish-subscribe arrangement may include a topic to which at least one of the first and second messages is sent, and the queuing arrangement may include a queue to which at least one of the first and second messages is sent. The second message may be derived from the first message by bridging a source and a target destination. The invention extends to a machine-readable medium embodying a sequence of instructions that, when executed by a machine, cause the machine to execute the method.

Abstract: A computing system comprises a plurality of computing nodes and is configured such that each computing node includes a processor configured to execute JAVA computer program instructions. The computing nodes cooperate to form a cluster, wherein the JAVA computer program instructions being executed by the plurality of computing nodes collectively accomplish a fully transactional application. Each application data object partition is associated with one of the computing nodes as a primary node for application data objects of that partition and further associated with at least one of the computing nodes as at least one secondary node for application data objects of that partition. Messages relative to an application data object are provided to the primary node for the application data object as well as to the at least one secondary node for that application data object, for updates.

Abstract: Disclosed are systems and methods for distributing a plurality of transactions for parallel processing, which includes receiving a message, such that each transaction comprises information associated with a target object, wherein the target object is stored in a memory. The systems and methods further include parsing the messages into the plurality of transactions, transmitting the parsed transactions to a transaction queue, receiving a transaction from the transaction queue, determining the target object associated with the transaction, assigning the transaction to a particular processing queue based on the target object, and guaranteeing that subsequent transactions associated with the target object are assigned to the same processing queue and the same processor, which guarantees that the target object will be modified in correct sequence.

Abstract: Disclosed are systems and methods for creating data objects, which includes querying a database to locate a first table associated with a first data type to be created, loading a plurality of rows from the first table during the query associated with the first table, creating a first set of data objects associated with the first data type, wherein each data object of the first set is created from data stored in each of the rows loaded from the first table. The systems and methods also include querying the database to locate a second data type to be created, wherein the second data type depends from the first data type, wherein the data objects of the second set depend from the data objects of the first set, and associating each data object of the second set to an associated parent object of the first set.

Abstract: Disclosed is a method for archiving provisioning errors that may occur during provisioning of a computing environment having configurable components. The method may comprise distilling a provisioning request, wherein the distilling the provisioning request includes recording, in a provisioning archive, a provisioning request component, and filtering the provisioning request component. The provisioning request component may comprise a component requested to be added to, removed from, and/or updated in the computing environment. The method may further comprise distilling a provisioning target, wherein the distilling the provisioning target includes recording, in the provisioning archive, a target environment, and filtering an existing component of the target environment. Additionally, the method may comprise applying the provisioning request to the provisioning target, including provisioning the target environment, resulting in an updated provisioning target.

Abstract: Described is an enterprise-based, contextual network system and method to keep employees connected with one another, as well as to external resources. Current media offers a great way to stay in touch with others but is not cohesive and contextual for businesses or generally productive for businesses. The enterprise media disclosed in this application presents a way for businesses to keep all of their employees and outside resources connected, but in a professional and efficient manner for the workplace. This enterprise media adapts to its users to create an interface that will help the user complete work, connect with others, and use various applications all in one place.

Abstract: Methods, program products, and systems implementing dynamic parsing rules are disclosed. Log data from a variety of log producers can be parsed using parsing rules to generate information about an information system. The parsing rules can include system parsing rules and custom parsing rules. A state machine can be used to detect conflicts between various parsing rules. A central server can distribute the system parsing rules and custom parsing rules to one or more remote servers for distributed processing. In a hierarchical parsing system, a first tier parser can be used to identify types of sources generating the log data. Log data from each type of log source can be sent to a second tier parser that corresponds to the type of log source.

Abstract: Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

Abstract: A computing system is configured to deploy a JAVA application for execution in a distributed manner. The computing system includes a plurality of computing nodes including a domain manager node, the plurality of computing nodes forming a computing domain configured as an administrative grouping of the nodes administered by the domain manager node. The domain manager node is configured to provide, to each of the computing nodes, a main portion of the JAVA application. The main portion defines, for each computing node, a portion of the behavior of the JAVA application to be accomplished by that computing node. Furthermore, each computing node is configured to receive at least one class file having classes appropriate for the portion of the behavior of the JAVA application defined, by the main portion, to be accomplished by that computing node.

Abstract: Methods, program products, and systems implementing random access data compression are disclosed. Data can be stored in a data structure in compressed or non-compressed form. The data structure can include a header block, one or more data blocks, and one or more index blocks. Each data block can include data compressed using different compression technology. The header block can include searchable references to the data blocks, which can be located in the data structure after the header block. The searchable references permit non-sequential access to the data blocks. The data blocks can be organized independent of a file system structure. The header block can additionally include references to the one or more index blocks, which can expand the references in the header block.

Abstract: A computing system and method is a specification of user-defined business logic is provided as JAVA program instructions (or another programming language) which does not natively provide for specification of full transactionality, to accomplish a fully transactional application, including executed managed objects. The managed objects are persisted in a shared memory of the computing system, such that a scope of the objects is global to the fully transactional application. Furthermore, a catalog of the managed object is maintained. A query interface is provided for querying the managed objects, in order to receive a query from an application, to process the catalog, and to provide a result indication of at least one of the managed objects back to the querying application. Thus, for example, the application may process the managed objects that are indicated in the query result.