Abstract: Systems and methods for managing change requests are disclosed. A system for managing change requests may include a memory storing instructions and at least one processor configured to execute instructions to perform operations including: receiving, from a client device, a change request; routing the change request to a first similarity determination pipeline, based on the first classification, identifying an implementation device; and transmitting the change request to the implementation device. The first similarity determination pipeline may be configured to: extract at least one first request element from the change request; determine a first group of change requests based on the at least one first extracted request element; determine a first similarity metric between the change request and the first group of change requests; and determine a first classification of the change request based on the first similarity metric.

Abstract: A computer-implemented method that includes generating a graphical user interface including a coding interface and a document viewer interface. The coding interface displays a grid that includes a plurality of cells representing a plurality of documents and a plurality of fields. A selection of one of the cells is received. The cell represents a selected one of the documents, and a selected one of the fields. A rendering of the selected document is automatically displayed in the document viewer interface. A value entered into the selected cell is received and the value is transmitted to a database for storage thereby.

Abstract: Methods for snapshot isolation query transactions in distributed systems are performed by systems and devices. Distributed executions of queries are performed in a processing system according to an isolation level protocol for data management and data versioning across one or more data sets, one or more compute pools, etc., within a logical server via a single transaction manager that oversees the isolation semantics and data versioning. Read transactions of queries are performed lock-free via the isolation semantics, and instant rollbacks, point-in-time queries, single-phase commits in the distributed systems are also provided. Abort and cleanup operations are performed based on a distributed abort protocol and a determined oldest active transaction for the system in which the single transaction manager does not track read-only transactions, and client nodes do not maintain commit tables for transactions.

Abstract: An apparatus, method, and system for updating a file index in a search engine in a data backup system to reflect file changes introduced in a new backup is disclosed. The operations comprise: generating a first external file, the first external file comprising file hashes for files already indexed in a file index in a search engine of a data backup storage system that are not associated with a deleted status; generating a second external file, the second external file comprising file hashes for files in a new backup; determining one or more file changes introduced in the new backup based on a comparison between the first external file and the second external file; and updating the file index in the search engine to reflect the one or more file changes introduced in the new backup.

Abstract: Systems and methods are described for processing ingested data in an asynchronous manner as the data is being ingested to detect potential anomalies. For example, one or more streaming data processors can convert data as the data is ingested into a comparable data structure, determine whether the comparable data structure should be assigned to an existing data pattern or a new data pattern, and optionally update a characteristic of the data pattern to which the comparable data structure is assigned. The streaming data processor(s) can perform these operations automatically in real-time or in periodic batches. Once one or more comparable data structures have been assigned to one or more data patterns, the streaming data processor(s) can analyze the comparable data structures assigned to a particular data pattern to determine whether any of the comparable data structures appear to be anomalous.

Abstract: A method and system (102) for grouping same persons are provided. The system (102) includes: a database (104) for storing person specific data of a plurality of reference persons in a hierarchical structure; an input module (206) for receiving person specific data of a target person; and a similarity search module (212) for searching the database (104) for data similar to the person specific data of the target person.

Abstract: An apparatus, method, and system for indexing backed up files is disclosed. The operations comprise: maintaining a File index and a Backup index, the File index comprising entries each associated with an individual file backed up, the Backup index comprising entries each associated with a particular backup; receiving a request to determine whether or not a first file is included in a first backup; determining whether or not the first file is included in the first backup based on the File index entry corresponding to the first file and the Backup index entry corresponding to the first backup; and returning a result of the determination of whether or not the first file is included in the first backup.

Abstract: An improved content indexing system is disclosed herein that content indexing system combines the functionality of the backup metadata database and the content index database into a single backup and content index database to avoid the need to perform synchronization operations. By using a single backup and content index database, the content indexing system also reduces the computing performance costs that would be associated with the synchronization operations as the amount of indexed content increases, thereby solving scalability issues.

Abstract: A method includes receiving, from a client and by a node, a commit request associated with a first datum, sending, in response to the commit request, a second commit request to a second node, wherein the second node comprises the first datum, after sending the second commit request, receiving a first cookie from the second node, making a first determination that the first cookie does not match a second cookie stored in a node cookie hash table, wherein the second cookie is associated with the second node, in response to the first determination, updating a master verifier cookie on the node to obtain an updated master verifier cookie, and sending the updated master verifier cookie to the client.

Abstract: In one general embodiment, a computer-implemented method includes selecting a portion of a hash table, identifying a plurality of uniform resource locators (URLs) stored within the selected portion of the hash table, and for each of the plurality of identified URLs, individually determining whether to process the identified URL, based on data associated with the identified URL.

Abstract: Techniques described and suggested herein include distributed deletion request processing and verification. For example, incident to migration of original data from a first data store to a second data store, verifications and confirmations related to removing the original data from the first data store may be performed so as to ensure the integrity of the original data represented on the second data store prior to removing the actual original data on the first data store. In some embodiments, the verifications and confirmations performed in connection with a deletion request may be apportioned to multiple entities, each of which may not fully trust the others. As a result, in some embodiments, a given deletion request may only be fulfilled if all of the entities involved in the verification process individually provide authorization to execute the deletion request.

Abstract: A method of improving computing efficiency of a computing device for language-independent problem solving and reasoning includes receiving a query from a user, which is decomposed into one or more sub-queries arranged according to a tree structure. The one or more sub-queries are executed in a knowledge base. The results of the executed one or more sub-queries are received and composed into a query response. The query response is transmitted to the user.

Abstract: A computing device includes a touch-sensitive area that is arranged and configured to receive one or more gestures, and a memory that is arranged and configured to store one or more device gestures, where the stored device gestures correspond to a selection of one or more remote devices and a processor that is operably coupled to the touch sensitive area and the memory. The processor is arranged and configured to compare the gestures received in the touch sensitive area to the stored device gestures, determine a selected remote device based on the comparison, and initiate contact with the selected remote device.

Abstract: A fast-copyable database apparatus includes a processor and a memory in electronic communication with the processor. The memory stores a database table with multiple records each having a compound key including a version identifier. The memory also stores instructions executable to cause the processor to generate a first virtual clone of the database table and a second virtual clone of the database table, receive a query at the first virtual clone, and modify the query so that it includes a version identifier of the first virtual clone. The processor can query the database table using the modified query to generate a response based in part on each record from the set of records having a version identifier associated with an ancestral path of the version identifier of the first virtual clone, and send the response. Each compound key includes a version identifier and a data portion.

Abstract: A method for instantiating a first specific model, as one record, based on a model scoring template, clustering a plurality of models into a plurality of groups to obtain a plurality of clusters, computing a model contribution weight value for the given cluster, choosing a set of top model(s) from the plurality of models, and updating the model(s) of the set of top model(s) dynamically.

Abstract: Provided is a data access method including generating an index corresponding to a key in a first key-value pair in response to receiving the first key-value pair, writing the key-index pair corresponding to the key and the index into a block storage device, the key-index pair being stored in the block storage device in a log-structured merge-tree (LSM-Tree) structure, writing an index-value pair corresponding to the index and the value in the first key-value pair into a key-value solid state drive (KV SSD).

Abstract: A method may comprise comparing a first data set with a second data set, the first data set associating a first plurality of names with a first plurality of roles, and the second data set associating a second plurality of names with a second plurality of roles. The method may further comprise generating a third data set based on an outcome of the comparing, such that the third data set associates a subset of the first plurality of names with a subset of the second plurality of roles. Apparatuses, methods, and software for performing these and other functions are also described.

Abstract: Embodiments of the present invention include a method of processing time series metrics (TSM) data. The method includes receiving a TSM data point for a metric, the TSM data point indicating an identifier (ID) of the metric, getting a persistence policy associated with the metric, selecting a first resolution database according to the persistence policy, storing the TSM data point in the first resolution database, selecting a second resolution database according to the persistence policy; and when the second resolution database is defined, storing the TSM data point in a staging file for the second resolution database.

Abstract: A method, computer program product, and computer system for triggering, by a computing device, a synchronization activity on a storage object. A request may be executed for a copy operation resulting from the synchronization activity to copy the storage object from a source to a destination when a current number of concurrent copy operations is below a maximum number of copy operations. The request for the copy operation resulting from the synchronization activity to copy the storage object from the source to the destination may be placed in a queue when the current number of concurrent copy operations is at least at the maximum number of copy operations. One or more attributes of the request in the queue may be identified. The request for the copy operation may be executed according to a replication policy based upon, at least in part, the one or more attributes of the request in the queue.

Abstract: Systems and methods for automatically associating content characteristics to a third-party content are provided. A uniform resource locator identifying a resource is received from a content provider. The content is rendered to produce an object tree. A first node of the object tree is determined, where the first node represents a content slot. A second node of the object tree proximate to the first node is identified. The second node has a content characteristic, which is extracted. The extracted content characteristic is associated with the first node and stored.