Systems and methods for managing concurrent access to a shared resource in a distributed computing environment are provided. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache.

With respect to an information processing method to be performed by a computer, the information processing method includes performing aggregation in a plurality of dimensions included in a virtual table for each value of a predetermined key, two tables in a natural number index format being combined by join using the predetermined key in the virtual table, and calculating a sum of results of the aggregation.

A communications system implements instructions including maintaining a message object that includes an array of entries. Each entry of the array includes a field identifier, a data type, and a next entry pointer. The next entry pointers and a head pointer establish a linked list of entries. The instructions include, in response to a request to add a new entry to the message object, calculating an index based on a field identifier of the new entry and determining whether the entry at the calculated index within the array of entries is active. The instructions include, if the entry is inactive, writing a data type, field identifier, and data value of the new entry to the calculated index, and inserting the new entry into the linked list. The instructions include, if the entry is already active, selectively expanding the size of the array and repeating the calculating and determining.

A computationally-efficient object conversion system maintains multiple objects. Each object includes an array of characters and a hash value. Instructions include maintaining strings in a one-to-one relationship with the objects. The instructions include, for each object, calculating the hash value in response to values being written to the array of the object. The instructions include defining an equals method that, for first and second objects, returns a true value in response to values of the array of the first object matching values of the array of the second object. The instructions include defining a hash method that, for a selected object, returns the hash value. The instructions include, in response to a request including a request string, determining whether one of the strings is equal to the request string and, if so, returning the object related to the one of the strings.

A computationally-efficient system for encoding a message object implements instructions including determining a token of the message object. The token identifies a structure of the message object. The instructions include obtaining a dictionary definition based on the token. The dictionary definition describes the structure of the message. The message includes multiple entries. Each of the entries is characterized by a data type and a field identifier. The dictionary definition defines an order of the entries. The instructions include, according to an order specified by the dictionary definition, selecting each entry of a set of entries in the message in sequence and writing the entry to a byte queue exclusive of the data type and the field identifier. The instructions include initiating transmission of the byte queue over a communications network.

A memory management system implements instructions including maintaining multiple pool data structures, each associated with a linked list of objects and including a head pointer pointing to the first element in the linked list. The instructions include, in response to a first object no longer being needed, recycling the first object by identifying a first pool data structure that corresponds to the first object and inserting the first object into the linked list without deallocating the memory for the first object. The instructions include, in response to a new object request, identifying a second pool data structure according to a feature of the new object. If the corresponding linked list is empty, memory is allocated for the new object and the new object is assigned to the second pool data structure. If the linked list is not empty, the first object is removed from the linked list and returned.

Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

Time randomizing information protocol language encryption, provides systems, methods, computer programs and algorithms for encrypting communications. Provided by software in devices or firmware in networking hardware cooperates between at least two systems. Ciphers are randomly timed and replaced after a random period rendering eavesdropper decryption efforts ineffective and/or uneconomic. Ciphers may be based on common seed data sets, or on pointers to an array containing seed data. These seed data values, or pointers to them may be used in communications in shared transient languages. Languages may include number bases from binary on upwards, and characters used in human or machine languages. One implementation may convert human speech to text, then encrypt and transmit it, for decryption and conversion to synthetic speech in secure battlefield communications, or secure identity protected communications as may suit intelligence agencies. Applications, including non-human machine communications may run beneath conventional encryption to enhance security.

Disclosed herein is a computing device and data store for use in the storage and retrieval of communication objects. The computing device can receive a first communication sent using a first communication modality and a second communication sent using a second communication modality. The computing device can determine that the first communication and the second communication correspond to a single interaction. The computing device can generate a communication object with a communications in a particular structure consistent across communication modalities using the first communication and the second communication. The computing device can determine contexts from the communication object and store the communication object in a database with the contexts. The computing device can retrieve the communication object in response to a search request based on the contexts.

A query processing method including decomposing an SQL into logical plans based on data source feature information, to obtain a logical plan set, where the data source feature information is stored in an internal storage space of the query engine; generating physical plans for the logical plan set based on the data source feature information, to obtain a physical plan set; determining query costs of the physical plan set based on the data source feature information, to obtain a physical plan with a highest priority; and executing the physical plan with the highest priority, to obtain a query result queried by a user. The embodiments of this application further disclose a data source registration method and a query engine.