Abstract: Associating comments with tags in a managed historian system in accordance with a flexible, platform-independent data structure. A worker role instance automatically associates received comments with a process tag at a particular time in response to receiving the comments. The worker role instance stores the comments in the flexible, platform-independent data structure such that the comment is provided in association with the tag at the particular time in response to a display or search request for the tag.

Abstract: An automation device for process automation, with a server containing one or more process automation variables, wherein the server is configured to receive read and/or write requests from a client in communication with the automation device for at least one variable. The automation device adapted to: specify the time period between two read requests for the same read request variable and/or between two write requests for the same write request variable; specify a sampling time for the read or write request variable as a function of the specified time period; and enable read access to the read request variable in the address space of the server at the respective sampling time, independently of future read requests and/or to prepare write access to the write request variable in the address space of the server at the respective sampling time, independent of the previous write request.

Abstract: A computing device includes a processor and a machine-readable storage storing instructions. The instructions are executable by the processor to: receive a bit vector representing input data to be tokenized; divide the bit vector into two vector portions; and perform a plurality of rounds of a Feistel network on the two vector portions, each round including converting one vector portion using a table-based hash function that combines multiple tokens retrieved from at least one token table.

Abstract: A hashing apparatus includes a memory and circuitry. The memory stores (i) multiple hash tables storing associative entries, each including at least one entry key and a respective value, the hash tables are associated with respective different hash functions, and an associative entry is accessible by applying the relevant hash function to a key matching an entry key in the associative entry, and (ii) an affinity table that stores table-selectors for selecting hash tables with which to start a key lookup. The circuitry receives a key, reads from the affinity table, by applying an affinity function to the key, a table-selector that selects a hash table, accesses in the selected hash table an associative entry by applying the hash function associated with the selected hash table to the key, and in response to detecting that the key matches an entry key in the associative entry, outputs the respective value.

Abstract: An approach is provided for optimizing a database buffer pool. Based on statistics about read and write operations in a range of pages, the range of pages is determined to be a candidate for a hot read range for which locks and latches are avoided in processing operations in the hot read range. Using an on-time trigger or pre-trigger process, the hot read range is created from the range of pages by marking start and end points in the range of pages. Write operation(s) are determined to be included in the hot read range by marking an object control block. The write operation(s) are added to a write pending list. The read operations in the hot read range are performed without a latch or lock. The write operation(s) are merged from the write pending list to the range of pages and the write operation(s) are performed.

Abstract: Provides a method for hashing structural data. According to this method, structural data that includes a plurality of keys and a plurality of values corresponding to respective keys is received. A plurality of key-value pairs can be parsed from the structural data, with each of the plurality of key-value pairs including a key and a value respectively corresponding to the key. A hash value of the plurality of key-value pairs is computed according to a predefined policy as a hash value of the structural data, wherein the predefined policy includes sorting the plurality of key-value pairs or processed key-value pairs.

Abstract: Systems and methods for efficient association of related entities. The method may comprise accessing a database of records, using a processor, to identify a set of unoptimized entities represented by one or more nodes in a graph model, a connection between a first node and a second node in the one or more nodes representing an association between a first entity represented by the first node and a second entity represented by the second node; determining the first entity is unoptimized; and determining a set of related entities for the unoptimized first entity in the graph model, the graph model having at least one common entity with a corresponding label model.

Abstract: A computer-implemented method and a related system for record linkage of an incoming record to a reference data set may be provided. The method comprises providing a reference data set comprising a plurality of records, each record comprising a plurality of attributes. The method comprises further assigning each of the plurality of records an initial surrogate identifier value, assigning a plurality of block identifiers to each of the records by applying a locality sensitive hashing function to a predefined attribute of the records, resulting in the plurality of the block identifiers, and determining a final surrogate identifier value to each of the records assigned to one of the blocks such that the final surrogate identifier values in each block are uniformly distributed.

Abstract: A method for updating a stable cuckoo filter used for membership testing of data streams, executed by a processor, is described. The method includes the steps of: performing a first hash on a first element to be inserted into the stable cuckoo filter to determine a first candidate bucket; performing a second hash on a fingerprint of the first element to determine a second candidate bucket; selecting a target candidate bucket from a group consisting of the first candidate bucket and the second candidate bucket; inserting the first element into the target candidate bucket; updating the stable cuckoo filter according to one or more of a random update strategy, an insertion failure update strategy, a scanning strategy, a skip scanning update strategy, a blocked design strategy and a local time-sensitive update strategy; and obtaining an updated stable cuckoo filter.

Abstract: Systems, methods, and non-transitory computer readable media may be configured to access first database and a second database. The first database may be structured for a first data type, and may include a first data of the first data type. The second database may be structured for a second data type different from the first datatype, and may include a second data of the second data type. The second data may be associated with the first data. A first information request relating to the first data and a second information request relating to the second data may be received. A first response to the first information request may be determined based on the second data. A second response to the second information request may be determined based on the first data. An interface, through which the first response or the second response is accessible, may be provided.

Abstract: A first table has more than one key column, and a hash array is built for the table, which includes computing hash indices for respective rows of the first table based on more than one key column. Building the hash array also includes writing in the hash array for each row at a respective location in the hash array, wherein each location is indicated by each row's respective hash index computed from the more than one key column. The hash array is probed responsive to the second table. In the building of the hash array for the first table, the writing in the hash array for each row at a respective location in the hash array writes only one of the key columns as a single key field in the hash array for each row.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device and a computer program product for creating metadata index. The method disclosed herein comprises: generating a first-level index to index a metadata item; inserting a first indication into the first-level index to indicate a position of the metadata item in a set of metadata; generating a second-level index to index a set of first-level indexes; and inserting a second indication into the second-level index to indicate a set of positions of the set of metadata. In this way, embodiments of the present disclosure can create an index structure which can indicate the position of the metadata item, so as to rapidly determine the position of the metadata item.

Abstract: An information processing system includes an operator terminal to transmit a captured image, and an image searching system connected with the operator terminal. The image searching system includes a first memory to store a registration image of a registration object and associated attachment information, and first circuitry configured to receive the captured image from the operator terminal, search the attachment information based the captured image, and transmit the attachment information.

Abstract: Technologies are provided for dynamically adaptive Bloom filters. After processing a lookup operation using a Bloom filter, a feedback message is received which can be used to determine whether the Bloom filter produced a false-positive lookup result. A Bloom filter accuracy score can be updated based on the feedback message. If the accuracy score for the Bloom filter falls below a specified threshold then the Bloom filter can be changed, or replaced with a different Bloom filter. In at least some embodiments, a plurality of Bloom filters can be created. One of the Bloom filters, designated as an active Bloom filter, can be used to process lookup operations. When a feedback message is received, accuracy scores can be updated for each of the Bloom filters. Based on the accuracy scores, the active Bloom filter can be deactivated and another Bloom filter, with a better accuracy score, can be activated.

Abstract: Techniques are provided for replay of metadata and data operations. During initial execution of operations, identifiers of objects modified by the execution of each operation are identified and stored in association with the operations. When the operations are to be replayed (e.g., executed again, such as part of a replication operation or as part of flushing content from a cache to persistent storage), the identifiers are evaluated to determine which operations are independent with respect to one another and which operations are dependent with respect to one another. In this way, independent operations are executed in parallel and dependent operations are executed serially with respect to the operations from the dependent operations depend.

Abstract: Associating comments with tags in a managed historian system in accordance with a flexible, platform-independent data structure. A worker role instance automatically associates received comments with a process tag at a particular time in response to receiving the comments. The worker role instance stores the comments in the flexible, platform-independent data structure such that the comment is provided in association with the tag at the particular time in response to a display or search request for the tag.

Abstract: Systems and methods for universal data modeling are disclosed. Exemplary embodiments include an information processing apparatus that can acquire a plurality of different data types form different sources that contains both anonymous and nonanonymous customer data. This data is ingested into a data repository and a quality control check is applied to the data The data is enriched and data analytics are applied to the data in order to associate at least some of the data with a customer.

Abstract: In implementations, a schema generation utility is configured to allow a user to abstract and generate a schema, such as a JSON schema, from a base schema instance according to schema configuration data, other data inputs, and schema configuration models. In an implementation, a user provides parameters, configuration objects, etc. for a desired final output schema. The schema generation utility may be configured to receive and parse the base schema instance into a plurality of configurable data objects, also referred to as “schema chunks,” that are extracted from the base schema instance. A set of schema chunks may be assembled into a desired output schema based on, at least in part, configuration data and assembly data contained in the schema chunks. In other implementations, input parameters may include error tolerance thresholds processed by the schema generator to discern between errors that lead to schema failure and benign errors.

Abstract: Described herein are systems and methods for an entity ranking system. In one embodiment, a computing system is configured to interface with one or more domains to identify a set of entities. The computing system can ascertain a first set of data components for each entity, normalize each of the first set of data components for each entity, and detect a failure to ascertain a second set of data components. The computing system can compute a statistical probability for a possible set of values for each data component of the second set based on the ascertained first set of data components. The computing system can rank each entity based on a derived quantile. The computing system can generate a graphical user interface including a visualization of the ranking of each entity, which can be rendered on a display of the at least one user computing devices.

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently filters and joins data for processing. The calculation engine enhances the performance of the join operations by allowing join inputs to be pre-filtered more effectively. Such join operations can allow for faster processing times, and a reduction in the amount of data to be joined, resulting in more efficient processing.