Abstract: Described are platforms, systems, and methods to automatically discover, extract, map, merge, and enrich data found in on-premises in automated industrial and commercial environments and cloud systems for purposes of providing developers access to normalized, merged, and enriched data through an API. The platforms, systems, and methods identify a plurality of data sources associated with an automation environment; retrieve data from at least one of the identified data sources; apply a first algorithm to map the retrieved data to a predetermined ontology; merge the mapped data into a data store comprising timeseries of the mapped data; apply a second algorithm to identify patterns in the merged data and enriching the data based on one or more identified patterns; and provide one or more APIs or one or more real-time streams to provide access to the enriched data.

Abstract: Systems, methods, and storage media for generating an online analytical processing cube (MAP) are disclosed. Exemplary implementations may: receive a cube definition file; access a data-source; generate a data-source property configuration for the data-source using the cube definition file to; determine each of respective parsed data from the data-source is a key, attribute, or measure; and generate the OLAP cube by combining the cube definition file and the data-source property configuration for the determined parsed data from the data-source.

Abstract: Methods and systems for restoring data are described. According to some embodiments, the method, in response to receiving a first restore request, initiates a second restore request to a hybrid data buffer to route blocks of backup data to the hybrid data buffer. The method further invokes an interrupt service routine (ISR) that is initialized with reserved addresses. When the blocks of backup data are transmitted to the hybrid data buffer, the method further tags, by the ISR, the blocks of backup data to a specified location, where the specified location is one of the reserved addresses.

Abstract: Embodiments of the present disclosure provide a data migration method and apparatus. The method includes: receiving a migration task of migrating data in a first system to a second system; and calling upper-layer interfaces corresponding to the migration task, and calling underlying operation interfaces of the first system and the second system by the upper-layer interfaces through an abstract interface class to migrate the data of the first system to the second system. Bidirectional data transmission and migration can be implemented between any two data ends. Bidirectional data transmission and migration between any data terminals.

Abstract: The present disclosure is directed towards systems and methods for finding documents that are similar to a reference text. The inventive systems and methods examine a set of collected documents to determine the facts present in those documents by, for example, extracting triplets and expanding them. A user's input reference text is similarly examined to extract and expand triplets therein and the facts identified with respect to the reference text are used as a basis to find documents having similar facts. The present disclosure is also related to systems and methods for mining facts from documents relating to a primary source such as a piece of legislation and using the mined facts to improve the results of subsequent searches.

Abstract: Techniques are disclosed relating to database query optimizers. In some embodiments, a query parser of a database system receives a query requesting data from a multi-tenant database. The query includes a first constraint that restricts a query optimizer's selection of a set of execution plans available to implement the query. The database system determines whether an override has been specified for a particular tenant associated with the received query, the override indicating that the first constraint is to be replaced with a second constraint for the particular tenant. In response to determining that the override has been specified for the particular tenant, the database system replaces the first constraint in the query with the second constraint and provides the query with the second constraint to the query optimizer for selection of an execution plan in accordance with the second constraint.

Abstract: A system that implements a data storage service may store data for a database table in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may back up individual partitions of the table to a remote storage system independently and (in some cases) in parallel, and may update (or create) and store metadata about the table and its partitions on storage nodes of the data storage service and/or in the remote storage system. Backing up each partition may include exporting it from the database in which the table is stored, packaging and compressing the exported partition for upload, and uploading the exported, packaged, and compressed partition to the remote storage system. The remote storage system may be a key-value durable storage system in which each backed-up partition is accessible using its partition identifier as the key.

Abstract: Disclosed are various embodiments for using a distributed ledger to track the evolution or deployment of feature sets for machine-learning. A registration request is received from a first node of a distributed ledger, the registration request comprising a code hash representing a feature set generator and a data hash representing a data set. The registration request is then relayed to a second node of the distributed ledger for approval by the second node. Next, an approval for the registration request is received from the second node. Subsequently, an entry in the distributed ledger comprising the code hash and the data hash is created.

Abstract: A system, method and computer product for managing distributed transactions of a database. A transaction manager is provided for each of a plurality of transactions of the database. Each transaction manager is configured to perform functions that include generating a transaction token that specifies data to be visible for a transaction on the database. The database contains both row and column storage engines, and the transaction token includes a transaction identifier (TID) for identifying committed transactions and uncommitted transactions. A last computed transaction is designated with a computed identifier (CID), record-level locking of records of the database is performed using the TID and CID to execute the transaction, and the plurality of transactions of the database are executed with each transaction manager.

Abstract: 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.

Abstract: A computer system for processing unstructured data, the computing system comprising a computer processor, a computer memory operatively coupled to the computer processor and the computer memory having disposed within it computer program instructions that, when executed by the processor, cause the computing system to carry out the steps of receiving unstructured data input from a client device, analyzing the unstructured data for features that satisfy logical segment criteria by using natural language processing (NLP), partitioning the unstructured data into logical segments based on satisfaction of the logical segment criteria, and linking data from a repository to the unstructured data based on the logical segments.

Abstract: An association metric for record attributes associated with cardinalities that are not necessarily the same is used for training and/or applying an entity resolution (ER) model. A pair of records includes (a) a first record indicating a first set of values for a first attribute and (b) a second record indicating a second set of values for a second attribute. Each of the first set of values and each of the second set of values are compared to determine individual association metrics. A first-level reduction operation is applied to subsets of the individual association metrics to determine reduced association metrics. A second-level reduction operation is applied to the reduced association metrics to determine an association metric, for the pair of records, for training and/or applying an ER model.

Abstract: Upon receiving a query at a local database server from a client directed to a LOB stored at a remote database server, a remote LOB locator is created comprising a local LOB locator indicating the LOB's location and a database link associated with the remote database server. The remote LOB locator is communicated to the client, which submits a request to the local database server to perform an operation directed to the LOB. The request is forwarded to the remote database server using the remote LOB locator, where the operation is performed. This mechanism is extended to work with sharded databases. Character set conversions are minimized when returning data to the client from the remote database server. Remote LOB locators may serve as bind variables for DML statements directed to local or remote tables. Local LOB locators may serve as bind variables for DML statements directed to remote tables.

Abstract: Implementations include querying metadata of data objects to define a sub-set of data objects, each data object in the sub-set of data objects including a generic text field and/or an attachment field, and, for each data object in the sub-set of data objects, processing historical data of a data object to identify a set of data types, the historical data stored within a field of a table of a database system, providing a recommendation for a first extension corresponding to a first data type, and receiving user input indicating acceptance of the recommendation for the first extension and, in response, automatically providing extension code that is executable to add a field extension to the table and to modify a UI of an application for input of values corresponding to the first data type, and executing the extension code to deploy the extension and to modify the UI.

Abstract: 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.

Abstract: 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.

Abstract: A system and method builds functions into a web page sourced by a primary server and that would otherwise report to a set of one or more other servers actions performed by users of the web page when they interact with its elements so that the interactions instead report to the user of the web page. The system and method then causes the browser to simulate such interactions with all such web page elements, thereby causing the functions to report the information that would have been sent to the other server, and an identifier of the other server.

Abstract: A query engine or compute engine receiving a query request identifies a plurality of data sources for satisfying a query request, and determines, from among multiple data sources, one or more fields likely to incur substantial computational demands in processing the query request. Pre-positioning aggregation logic moves the determined fields one data source to another data source for positioning the moved fields to a single data source from which the query result will be computed.

Abstract: Method, system and computer readable storage medium for transmitting content from an SCM version of a repository maintained by an SCM system to a corresponding search engine (SE) version of the repository maintained by a search engine system. The method includes generating a content request, the content request comprising information defining a start state of the SCM version of the repository and a filter field; identifying one or more files in the SCM version of the repository that have changed between the start state and an end state; filtering the identified files based on the filter field in the content request to form a filtered set of files and a removed set of files; extracting content and metadata for one or more files from the filtered set of files; and transmitting the extracted content to the search system for storage as part of the search system version of the repository.

Abstract: Decentralized deduplication operations in a computer system employ a hash index that is a variant of a B+ tree to support both efficient sequential updates as well as efficient random updates. Sequential update is selected when deduplication is infrequently performed, such as on the order of days, and random update is selected when deduplication is performed more frequently, such as on the order of seconds. More frequent deduplication may be beneficial during periods when large amounts of temporary duplicate data are created, and the system may not have enough storage space to accommodate the temporary spike in demand.