Abstract: The method includes receiving data characterizing a first segregator code, a first aggregator code and a plurality of configuration parameters associated with a data transmission system. The data transmission system is configured to receive operation data characterizing an operation of an industrial system and transmit a portion of the operation data to a first analytical model. The method also includes modifying the first segregator code and the first aggregator code based on one or more configuration parameters of the plurality of configuration parameters. The method further includes deploying the first segregator code and the first aggregator code in the data transmission system. The first segregator code is configured to provide a first portion of the operation data to the first analytical model via a first data transmission route that includes the first segregator code and the first aggregator code.

Abstract: In a computer embodiment, in a polyglot database management system (DBMS) that contains a guest language runtime environment, a database buffer is configured that the guest language runtime environment does not manage. In the polyglot DBMS, logic that is defined in a guest language is invoked to retrieve, into the database buffer, a value stored in a database in the polyglot DBMS. Compiling the logic causes semantic analyzing the logic to detect that usage of the retrieved value cannot occur after the retrieved value is overwritten in the database buffer. When detecting that such usage of the retrieved value cannot occur, the logic is executed without, after the retrieved value is overwritten in the database buffer, retaining a copy of the retrieved value in a memory region that the guest language runtime environment manages.

Abstract: In some aspects, an apparatus includes a memory and one or more processors coupled to the memory. The one or more processors are configured to receive, from a client device, a payload template request and to transmit, to the client device based on the payload template request, a payload template response including a plurality of payload templates. The one or more processors are further configured to receive, from the client device, a management request including a payload corresponding to a payload template of the plurality of payload templates and to transmit, to the client device based on the management request, a management response indicating a result associated with the management request.

Abstract: A key value (KV) store, a method thereof, and a storage system are provided herein. The KV store may include a key logger; and a processor configured to receive a first command for storing a first KV in the KV store, write a first value of the first KV to a first NAND page, generate an extent map for identifying the first memory page including the first value, write the extent map to a second memory page, append an entry for storing the first KV to the key logger, and update a device hashmap of the KV store to include a first key of the first KV, upon a threshold being met within the key logger.

Abstract: Systems and methods that make use of cluster-level redundancy within a distributed storage management system to address various node-level error scenarios are provided. According to one embodiment, a KV store of a node of a cluster of a distributed storage management system manages storage of data blocks as values and corresponding block IDs as keys. Data integrity errors are reported to the first node in the form of a list of missing block IDs that are in use but missing from the KV store. A metadata resynchronization process may then be caused to be performed, including for each block ID in the list of missing block IDs: (i) reading a data block corresponding to the block ID from another node of the cluster that maintains redundant information relating to the block ID; and (ii) restoring the block ID within the KV store by writing the data block to the node.

Abstract: A key-value engine may perform garbage collection for a tree or hierarchical data structure on an append-only storage device with page mappings. The key-value engine may separate hot and cold data to reduce write amplification, track extent usage using a restricted or limited amount of memory, efficiently answer queries of valid extent usage, and adaptively or selectively defragment pages in snapshots in rounds of garbage collection.

Abstract: According to various embodiments, with respect to a target set of files being managed (e.g., protected by data snapshots), each file in the target set of files is classified into one of two or more filesets (discontiguous filesets), where each of these filesets comprises one or more files that are related to each other by one or more factors, such as frequency of file change or purpose of existence (e.g., used by a software application). Once classified, files within the target set of files can be uniquely processed by a data management operation (e.g., incremental data snapshot process) according to their association to a discontiguous fileset.

Abstract: In various examples there is an information retrieval system which has a memory storing an index of items, each item having one or more features of a plurality of features. The index includes, for each item, an indication of the features of that item; and is configured at least according to the features. The memory stores a plurality of questions about the features of the items. The information retrieval system has a question selector that selects at least one of the questions on the basis of at least an expected information gain of the question with respect to the items. A search component searches the index using answers to the selected questions received from a user.

Abstract: A method may include selecting a cohort of entities for migration from a source storage repository to a target storage repository, obtaining a mapping between a source storage schema of the source storage repository to a target storage schema of the target storage repository, and migrating data for the entities in the cohort. Migrating the data of an entity may include copying, without locking the data in the source storage repository and in the target storage repository, the data from the source storage repository to the target storage repository, verifying, while the data is locked, that the data in the source storage repository is the same as the data in the target storage repository, changing, while the data in the source storage repository and the target storage repository is locked, an entity pointer for the entity to the target storage repository based on the verifying, and unlocking the data.

Abstract: Systems and methods to securely store data in a remote storage (e.g., cloud storage or server). In one approach, a method includes: receiving, from a local device, data blocks to be stored; generating a hash from a hash of each data block; storing each respective hash (e.g., in a local or remote memory for later use); and writing the data blocks to remote storage. Data integrity is verified when each data block is read from the remote storage by generating a hash of the respective read data block, and comparing the generated hash to the respective stored hash.

Abstract: Management of a storage system is enabled. In an example, a partition index associated with the partition is obtained, the partition index comprising a group of nodes, a node in the group of nodes indicating metadata of an object in the group of objects. A valid node in the partition index is identified, the valid node indicating valid metadata of an object associated with the valid node in the storage system. A local index for the partition index is generated based on the valid node. In response to receiving an access request for a target object in the group of objects, the target object in the storage system is accessed based on the local index. With the foregoing example implementations, metadata in the storage system may be accessed more efficiently, and the overall response speed of the storage system may be increased.

Abstract: A method to determine an extreme value of a plurality of data candidates includes storing each data candidate of a plurality of data candidates in a separate column of an associative memory, initializing a row of marker bits by setting each marker bit to a value of 1, computing a subsequent row of marker bits by performing in parallel a Boolean AND operation between a previous row of marker bits and a row of bits of the data candidates, starting with the row of most significant bits of the data candidates, performing a Boolean OR operation between the marker bits in the subsequent row of marker bits to generate a subsequent RSP value, identifying the extreme value from among the plurality of data candidates when there is only one marker bit having a value of 1 in the subsequent row of marker bits coinciding with when said subsequent RSP value is a 1, and if the identifying is false, repeating the computing on a row of next most significant bits, performing and identifying until the identifying is true.

Abstract: Examples may include storage of a small object representation in a deduplication system. Examples may store the small object representation of an object in the deduplication system based on a determination that the object is smaller than a threshold size. In examples, the small object representation may include a direct reference from a top-level data structure to small object metadata in a bottom-level data structure of the small object representation.

Abstract: This disclosure is directed to calibrating sensors for an autonomous vehicle. First sensor data and second sensor data can be captured by one or more sensors representing an environment. The first sensor data and the second sensor data can be associated with a grid in a plurality of combinations to generate a plurality of projected data. A number of data points of the projected data occupying a cell of the grid can be summed to determine a spatial histogram. An amount of error (such as an entropy value) can be determined for each of the projected data, and the projected data corresponding to the lowest entropy value can be selected as representing a calibrated configuration of the one or more sensors. Calibration data associated with the lowest entropy value can be determined and used to calibrate the one or more sensors, respectively.

Abstract: In one embodiment, a system includes at least one processor and logic configured to receive a request to process data stored in one or more index records in a keyed index of a database, determine an active key range for the one or more index records, and group the one or more index records into a number of groups for parallel processing thereof. In another embodiment, a method for utilizing a keyed index includes receiving a request to process data stored in index records in a keyed index of a database, determining an active key range for the index records, grouping the index records into a number of groups without prior knowledge of a key distribution for dividing the one or more index records into key ranges for parallel processing thereof; and processing the groups of index records in parallel.

Abstract: A computer system receives a first set of information that describes a set of transactions between pairs of user accounts of a service and a second set of information that specifies attribute values for user accounts of the service that are recipient user accounts within the set of transactions. Using the first set of information and the second set of information, the computer system generates an augmented graph model of the transactions and attribute values. By applying modularity maximization to the augmented graph model, the computer system determines a plurality of subsets of recipient user accounts.

Abstract: An industrial integrated development environment (IDE) supports collaborative tools that allow multiple designers and programmers to remotely submit design input to the same automation system project in parallel while maintaining project consistency. The industrial IDE also permits localized development of system projects, and provides an infrastructure for sharing and selectively synchronizing project edits among multiple locally stored versions of the system project.

Abstract: Systems and methods for automatic error rejection are provided. Systems and methods described herein bypass the creation of a staging table at the outset and, instead, attempt a direct merge from a source data location to a target data location. In the event that the merge fails, then a temporary/staging table can be loaded where errors can be logged, validations can be performed, and erroneous data can be corrected.

Abstract: Systems, methods, and computer-readable media for receiving one or more models of network intents, comprising a plurality of contracts between providers and consumers, each contract containing entries with priority values. Each contract is flattened into a listing of rules and a new priority value is calculated. The listing of rules encodes the implementation of the contract between the providers and the consumers. Each entry is iterated over and added to a listing of entries if it is not already present. For each rule, the one or more entries associated with the contract from which the rule was flattened are identified, and for each given entry a flat rule comprising the combination of the rule and the entry is generated, wherein a flattened priority is calculated based at least in part on the priority value of the given one of given entry and the priority value of the rule.

Abstract: Embodiments of the present disclosure are directed to systems and methods for managing a database. In one or more examples, the system obtains input data comprising one or more data entries, where each data entry comprises one or more data items, and each data item comprises a field name and a field value. The system can generate a key-value set for each data item to obtain a plurality of key-value sets. Each key-value set includes at least a first key element comprising the field name of the respective data item and a second key element comprising the field value of the respective data item. The system can sort and store the plurality of key-value sets in the database. The system can further receive a query indicative of a field name or a field value, and generate, for display, an output based on retrieved key elements sets based on the query.

Abstract: A data retrieval device that includes a memory operable to store a data table and an indexing engine implemented by a processor. The indexing engine is configured to receive an index key for data and to determine a set of index table references based on the index key. Each index table reference identifies an index table that links index keys with data location information. The indexing engine is further configured to identify a set of index tables corresponding with the set of index table references and to identify an index table from the set of index tables that contains the index key. The indexing engine is further configured to retrieve a data location information linked with the index key from the index table, to retrieve the data from the data table based on the data location information, and to output the retrieved data.

Abstract: A computer displays, in a user interface, a data field region and an object model visualization region that includes object model icons. The computer detects user input to join a first object class and a second object class and detects user selection of a first linking field and user selection of a second linking field. In response to receiving the user selection of the first linking field and the second linking field, the computer generates a relationship that connects the first object class and second object class according to shared data values of the first linking field and the second linking field. The computer also displays, in the data field region, information regarding cardinality of the relationship and information regarding referential integrity of the relationship. The computer also updates the object model visualization region to display a visual connection between the object icons representing the first and second object classes.

Abstract: A scheduler manages execution of a plurality of data-collection jobs, assigns individual jobs to specific forwarders in a set of forwarders, and generates and transmits tokens (e.g., pairs of data—collection tasks and target sources) to assigned forwarders. The forwarder uses the tokens, along with stored information applicable across jobs, to collect data from the target source and forward it onto an indexer for processing. For example, the indexer can then break a data stream into discrete events, extract a timestamp from each event and index (e.g., store) the event based on the timestamp. The scheduler can monitor forwarders' job performance, such that it can use the performance to influence subsequent job assignments. Thus, data-collection jobs can be efficiently assigned to and executed by a group of forwarders, where the group can potentially be diverse and dynamic in size.

Abstract: Systems and methods for multi-layered key-value storage are described. For example, methods may include receiving two or more put requests that each include a respective primary key and a corresponding respective value; storing the two or more put requests in a buffer in a first datastore; determining whether the buffer is storing put requests that collectively exceed a threshold; responsive to the determination that the threshold has been exceeded, transmitting a write request to a second datastore, including a subsidiary key and a corresponding data file that includes the respective values of the two or more put requests at respective offsets in the data file; for the two or more put requests, storing respective entries in an index in the first datastore that associate the respective primary keys with the subsidiary key and the respective offsets; and deleting the two or more put requests from the buffer.

Abstract: In an embodiment, a method for controlling a database in a streaming application includes receiving, by a compute node, data for transmission as streaming data on a network connected to the compute node and a database. The compute node then assembles a body portion of a tuple to include the data and assembles a header portion of the tuple to include a database statement that identifies a change to be made by the database to an aspect of the database in a format that is identifiable by the database. The compute node then transmits the tuple having the header portion thereof and the body portion thereof on the network as streaming data with the header and body portions of the tuple being directed to the database.

Abstract: A method, computer program product, and computing system for receiving, at a node of a multi-node storage system, one or more updates to a reference count associated with a metadata block. One or more reference count deltas associated with the metadata block may be stored in a cache memory system of the node. An existing copy of the metadata block in a cache memory system of each other node of the multi-node storage system may be retained.

Abstract: A method and system for migrating data and metadata from a first backup system to a second backup system via a content staging system is disclosed. The system accesses the backup data from the first backup system and restores it, along with the associated metadata, to a staging system. A metadata file is created at the staging system which comprises of the metadata that is to be migrated to the second backup system. The system then migrates the data from the staging system to the second backup system. The metadata is also migrated to the second backup system in a format such that it can be indexed. As a result, the migrated data can be browsed and searched based on one or more search criteria based on the associated metadata. Other details are provided herein.

Abstract: A system creates graph of nodes connected by edges. Each node represents corresponding value of corresponding attribute and is associated with count of corresponding value. Each edge is associated with count of instances that values represented by corresponding connected nodes are associated with each other. The system identifies each node associated with first count as first set of keys, and deletes each node associated with first count. The system identifies each edge associated with second count as second set of keys, and deletes each edge associated with second count. The system identifies each node associated with third count as third set of keys, and deletes each node associated with third count. The system identifies each edge associated with fourth count as fourth set of keys, and deletes each edge associated with fourth count. The system uses each set of keys to search and match records.

Abstract: A method and/or system for managing a database that stores space-time context objects is provided. The system receives a query range in a multi-dimensional space. The system maps the query range into a set of fragments of a space-filling curve that fills the multi-dimensional space in all dimensions of the multi-dimensional space. The system uses each mapped fragment in the set of mapped fragments as a key to query the database for space-time context objects that are mapped to the space-filling curve. The system queries the database by identifying one or more context objects that intersect the mapped fragment at the space-filling curve.

Abstract: Data structures can provide for a column store of a database table. Methods can use the data structures for efficiently responding to a query. Unique field values of a column of a database table can be identified. The unique values can be stored in a dictionary table along with reference keys that point to a row of the database table. A reference store column can replace the original column, where the reference store column stores index values of the dictionary table. A hash table can be used in accessing the database. A hash function can provide a hash value of a query term, and the hash value can be used to access a hash table to obtain a stored value of an index value of the dictionary table. The index value can be used to access the dictionary table to obtain reference keys corresponding to rows of the database table.

Abstract: A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed.

Abstract: Disclosed in some examples, are methods, systems, devices, and machine readable mediums that store instructions for programmable atomic transactions in a memory of the programmable atomic unit prior to execution of the programmable atomic transaction. The memory in some examples may be an instruction RAM. The memory in some examples may be partitioned into partitions of a fixed size that stores a same number of instructions. Each programmable atomic transaction may use one or more contiguously located instruction partitions. By loading the instructions ahead of time, the instructions are ready for execution when the transaction is requested.

Abstract: Techniques to process a query and perform a join of tables that are distributed across nodes of a network. The join can be performed by analyzing a Where clause. An active flag structure can have flag values that identify table entries satisfying criteria of the Where clause. Keys of surviving entries of a first table can be used to generate a request for a second table to be joined. The request can be for second flags for the second table when the Where clause has criteria for the second table. A response can be used to update the first flags to change a first flag to False. After updating, data can be retrieved for first flags that are True. Requests can use identifiers associated with the first table that identify a location for sending the request, e.g., using RDMA or MPI.

Abstract: A method, apparatus, system, and computer program product for searching for documents. A query comprising search terms is received. A search is performed on a collection of documents for each search term in the search terms. Search results are received for the search terms. Each search result includes documents from the collection of documents containing a search term in the search terms and scores associated with the documents. Aggregate scores for the search terms in the search results are associated with each document in the documents returned to form combined results in which a combined result in the combined results comprises the document and an aggregate score associated with the document. The documents in the combined results are ranked based on the aggregate scores to form a ranked order for the documents. The combined results with the aggregate scores in the ranked order are displayed on a display system.

Abstract: A neural network device may generate an input feature list based on an input feature map, where the input feature list includes an input feature index and an input feature value, generating an output feature index based on the input feature index corresponding to an input feature included in the input feature list and a weight index corresponding to a weight included in a weight list, and generating an output feature value corresponding to the output feature index based on the input feature value corresponding to the input feature and a weight value corresponding to the weight.

Abstract: A method for supporting concurrent updates to a database page may include providing shared access to the database page. A first update may be performed with respect to a first record in the database page. A second update may be performed with respect to a second record in the database page. The first update and the second update may be performed concurrently while the shared access to the database page is being provided. The method may also include synchronizing the first update and the second update.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Abstract: A database system uses byte ordering for keys and a trie index to reference stored data. The keys of a database are converted into byte-comparable sequences of byte values. The trie index is generated including nodes connected by edges defining paths from a root node to leaf nodes. Each edge is associated with at least one byte value such that each path from the root node to a leaf node through one or more edges defines a unique byte prefix for a byte-comparable sequence of byte values. The leaf node of each path is associated with a database location value. A record is accessed in the database using a database location value determined from referencing the trie index using a byte-comparable sequence of byte values of the record generated from a key of the record. A trie structure and byte ordered keys may be used for partition or row indices.

Abstract: An embodiment of the present invention is directed to creating and implementing an innovative table-level stored procedure that builds and executes the necessary query dynamically based on the parameter values passed from the calling program.

Abstract: This application discloses a server for handling data reporting requests in a system that also comprises storage managers, primary storage devices, and secondary storage devices connected over one or more networks. The server receives, from each storage manager, a copy of data associated with the storage manager, and stores the received copies in one or more local databases. The server builds offline one or more indices for part or all of the received copies to improve query processing against the one or more local databases. Next, the server receives a request over a network from one of the storage managers or a standalone console, which received the request from a user for a report of data associated with the storage managers. The server produces a data report in response to the request, using the one or more indices and without impacting performance of the storage managers.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed.

Abstract: The described features generally relate to improved methods, systems, and devices for techniques for lead scoring. A provider may identify leads (for example, potential customers) who are likely to purchase the products or services. By identifying which people are more or less likely to purchase the products or services, the provider may be able to more efficiently deploy resources and representatives to increase sales revenue for the products or services. The lead may be assigned a lead score, where the lead score may indicate a probability that the lead will purchase the good, product, or service.

Abstract: A data duplication device (200) determines a duplication range using a data processing graph. The data processing graph indicates information of input/output data to and from a duplicate source program involved in a duplicate source system (110). The duplication range is a range of data to duplicate from the duplicate source system to a duplicate destination system (120). The data duplication device acquires duplicate data corresponding to the duplication range from the duplicate source system. The data duplication device registers the duplicate data with the duplicate destination system.

Abstract: Provided is a data storage system for a computer network adapted to store a message. The data storage system includes a data storage unit and a processing unit. The processing unit stores message data of the message across one or more data elements of a data list entry of an auxiliary list in the data storage unit. The processing unit further stores an indexing pointer of the message across one or more indexing elements of an indexing list entry of an indexing list in the data storage unit. The indexing pointer is adapted to point to the data list entry. The indexing list entry further includes an indexing control element containing control information associated with the indexing list entry. The data list entry further includes control information associated with the data list entry.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for latent summarization of a graph. Structural features can be captured from feature vectors associated with each node of the graph by applying base functions on the feature vectors and iteratively applying relational operators to successive feature matrices to derive deeper inductive relational functions that capture higher-order structural information in different subgraphs of increasing size (node separations). Heterogeneity can be summarized by performing capturing features in appropriate subgraphs (e.g., node-centric neighborhoods associated with each node type, edge direction, and/or edge type). Binning and/or dimensionality reduction can be applied to the resulting feature matrices.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed.

Abstract: A computational instance of a remote network management platform may include persistent storage and one or more processors. The persistent storage may contain a recursively-defined complex data object, and one or more processors may be configured to: (i) transmit a depiction of a graphical user interface including a visual representation of the recursively-defined complex data object, where the complex data object as well as each array and object therein is represented as a collapsible menu item that can either display or hide its elements; (ii) receive a modification to an element of the complex data object, wherein the modification is either removal of the element, addition of the element, or a change to the associated type of the element; (iii) update the persistent storage to represent the complex data object as modified; and (iv) transmit an update to the visual representation that reflects the complex data object as modified.

Abstract: Methods and systems for joining two tables are provided. At least two tables to be joined are received. A joinable row pair between the at least two tables is determined. The determined joinable row pair includes a first row from a first table having a common string value with a second row from a second table of the at least two tables. A transformation model is generated from the determined joinable row pair. A column of the first table is transformed based on the generated transformation model. The transformed first table is joined with the second table.

Abstract: A B?-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the B?-tree are therefore characterized by having a maximum allowed size that can vary over time.