Abstract: A metadata validation tool includes a retrieval engine, an extraction engine, a preparation engine a validation engine, and an export engine. The retrieval engine receives a sequential data file comprising a data table, the data table comprising a plurality of rows and a plurality of columns and the data table further comprising a plurality of data entries, wherein each data entry is placed in the data table at the intersection of one of the plurality of rows and one of the plurality of columns. The extraction engine extracts metadata from the sequential data file for at least one of the plurality of columns of data, wherein the metadata identifies the data table and a plurality of metadata identifiers. The extraction engine determines a metadata identifier for the extracted metadata, wherein the metadata identifier identifies a data field indicating a data type.

Abstract: A data collection system that provides the means to collect, store and make data available for a location analytics inference pipeline. The system incorporates a feedback mechanism enabling algorithms produced from the inference pipeline to drive the collection strategy to yield higher data quality and to produce reference data for model validation.

Abstract: A computer-implemented method for proactive change verification is provided. Aspects include analyzing runtime execution characteristics from a plurality of base activity metrics and a plurality of experimental activity metrics and creating a plurality of activity pairs wherein each activity pair comprises a base activity metric and its corresponding experimental activity metric. Aspects also include identifying significant activity pairs from the plurality of activity pairs wherein the experimental activity significantly deviates from its corresponding base activity and classifying significant activity pairs by deviation type. Aspects further include sorting activity pairs by their impact and removing activity pairs that have an impact of less than a threshold amount, wherein the threshold amount is based on the deviation type.

Abstract: Disclosed are methods and systems for of determining snapshot storage space consumption in a data storage system, a snapshot being a representation of a given state of a data object comprising of direct references to data blocks for data that has been changed from a prior state and indirect references to existing direct references in the prior state for unchanged data, the method comprising the steps: for each write of data to a given snapshot of the data object, storing unique address information relating to the unique direct references for said writes, said unique address information comprising at least a count of unique direct references; upon generating a further snapshot of a prior snapshot, retaining said prior snapshot and unique address information in storage as read-only access; and determining a count of unique direct references for all snapshots relating to the data object based on the stored unique address information.

Abstract: A system for providing a multi-tenant data protection application includes a server shared by all tenants for access to the provided multi-tenant data protection application. The system further includes business logic for managing tenants of the multi-tenant data protection application, tenant resource allocation and isolation of tenant operating environments. The system additionally includes a database server for creating, managing and maintaining databases, including a master database used to store configuration and monitoring data which is used for tenant management and monitoring, and a plurality of private tenant databases, each used to store tenant-specific configuration, tenant-specific data and associated tenant resources. The system includes one or more data protection engines configured to store a copy of protected data at tenant redundant data stores.

Abstract: A method and system for comparing at least two structured data files. A computer polls at least one network device for data files. The computer determines a structural difference between a first data file and a second data file and creates at least one patch file based on the structural difference. The computer extracts at least one span from the at least one patch file, wherein the at least one span is defined by a starting point byte and a length measured in bytes and creates an ordered listing. The computer performs a lexer operation using the at least one span as a limiting criterion to limit an output of the lexer to statements that include the at least one span. The computer outputs the statements indicating changes in a configuration between said first and second data files.

Abstract: The systems and methods disclosed herein relate to using the clusters of a file to store versioning of a dataset. When the dataset is initially stored, a file is created that is twice the size of the dataset. The file may include one cluster (or a first set of clusters) that is marked as active and a second cluster (or a second set of clusters) that are marked inactive. The dataset is initially saved to the active cluster(s), and a version number is stored with the dataset. When the dataset is next saved, an application scans the file to determine whether there is (or are) an inactive cluster(s). If there is an inactive cluster(s) the second version of the dataset is saved to the inactive clusters. Both clusters are then marked active.

Abstract: Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol.

Abstract: A distributed file system (DFS) is provided that is configured to store data in a General Parallel File system (GPFS) and interface with a client configured to interface with a HADOOP Distributed File System (HDFS). The DFS includes a first Node; and a plurality of second Nodes including the GPFS. The first Node is configured to convert an HDFS command from the client into a GPFS command, apply the GPFS command to the GPFS to access a GPFS file, format an HDFS data structure to include identifiers of a set of the second nodes storing the GPFS file, a filename of the GPFS file, and an offset into the GFPS file, and send the HDFS data structure to the client. Each of the second Nodes is configured to access the GPFS using a part of the HDFS data structure received from the client.

Abstract: Systems and methods for developing user interfaces. User interfaces are previewed by including plugins in a preview user interface. A preview user interface includes a preview of a plugin in the context of a live user interface. The preview user interface is generated from preview web assets that are a copy of the web assets used for the live user interface except for the plugin. The plugin is written to the preview web assets and the preview user interface can then be previewed as if the plugin were part of the live user interface. Once the plugin is approved, the plugin can be incorporated into the live user interface.

Abstract: Methods, systems, and techniques for validating road intersections are presented. The method includes receiving annotated intersection data that, for each lane of a particular candidate intersection, indicates one or more attributes of the lane; processing the annotated intersection data to generate an intersection fingerprint for the particular candidate intersection that is sensitive to a topological structure of the lanes of the particular candidate intersection and is invariant to a geometry of the lanes of the particular candidate intersection; designating the particular candidate intersection as validated without performing the one or more quality control processes based at least on the intersection fingerprint; and storing a representation of the particular candidate intersection in the roadgraph.

Abstract: Disclosed is a system, method, and computer program product for analyzing sets of data in an efficient manner, such that analytics can be effectively performed over that data. Classification operations can be performed to generate groups of similar log records. This permits classification of the log records in a cohesive and informative manner.

Abstract: A distributed system is provided that includes member nodes and a leader node. Each member node stores a database and updates the database by performing common ones of a plurality of transactions. The leader node generates a batch, to be executed by each member node, which includes two or more transactions lacking an access conflict from among the plurality of transactions. The leader node includes: a section that generates an access set as a set of database entries to be accessed by each transaction to be executed; a section that generates the batch, based on the access set of each transaction to be executed; and a leader-side section that performs a consensus process for the batch among the leader and member nodes. Each member node includes the database; a member-side section that performs a consensus process for the batch; and a section that performs parallel execution of batch transactions.

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing a database migration with reduced downtime. Embodiments provide for migrating a source database table at a source database system to a target database table at a target database system. The embodiments provide for configuring the source database system to log changes to the source database table to a log, wherein the log is configured to replay the changes to the target database table and creating a replacement view table at the target database system, wherein the replacement view table provides access to current data from the source database table and the target database table. This approach allows access to the current data as replication continues without the need to take down access to the database.

Abstract: A personality-type training gamification system that includes a communications link configured to receive one or more communications, an analysis processor in bi-directional communication with the communications link with a plurality of non-transitory computer readable instructions stored in association therewith that are accessible to, and executable by, the processor, wherein the plurality of instructions, when executed receive the one or more communications from the communications link, analyze the one or more communications to identify personality types associated with the one or more communications, provide an overview of each identified personality type to a user; and provide one or more games or quizzes to the user and instructions to take the one or more games or quizzes to test the user's knowledge of the plurality of personality types provided; and a display device configured to display to the user at least a performance analysis for the user.

Abstract: Techniques and solutions are described for detecting malicious database activity, such as SQL injection attempts. A first machine learning classifier can be trained by comparing processed and unprocessed user input, where a difference between the two can indicate suspicious or malicious activity. The trained classifier can be used to analyze user input before query execution. A second machine learning classifier is trained with a data set that includes call stack information for an application requesting execution of a dynamic query and query statistics associated with processing of the query at the database. The query of the application can be correlated with a corresponding database query by hashing the application query and the database query and comparing the hash values, where matching hash value indicate a common query. The trained classifier can monitor execution of future queries to identify queries having anomalous patterns, which may indicate malicious or suspicious activity.

Abstract: Disclosed is a technique that can be performed in a distributed computer network. The technique can include a data index and query system that receives a search query and defines a search scheme for applying the search query on distributed data storage systems including an internal data storage system of the data intake and query system and an external data storage system communicatively coupled to the data intake and query system over a network. The data index and query system communicates at least a portion of the search scheme to a search service for application on behalf of the data intake and query system, receives from the search service a search result of the search query obtained by application of the search scheme to the distributed data storage systems, and causes the search result or data indicative thereof to be displayed on a display device.

Abstract: Disclosed is a technique that can be performed in a distributed network. The technique can include a search service system that receives an indication of at least a portion of a search scheme to cause worker nodes to obtain search results from distributed data storage systems. The search scheme is defined by a data intake and query system. The search service system defines a search process based on the at least a portion of the search scheme and executes the search process to cause the worker nodes to obtain search results from the distributed data storage systems. The search service system receives a combination of search results based on the search results obtained by the worker nodes from the distributed data storage systems, and causes an output based on the combination of search results obtained by the data intake and query system in accordance with the search scheme.

Abstract: Techniques involve managing a storage system. Along these lines, for each of a plurality of snapshots, a plurality of blocks referenced by the snapshot is determined. An evaluation score indicating an impact that deletion of the snapshot has on space release and data retention is determined based on at least one of: a reference count for the plurality of blocks, a size of a storage resource associated with the snapshot, and the number of blocks of the plurality of blocks that are referenced only once. At least one snapshot to be deleted is selected from the plurality of snapshots based on respective evaluation scores of the plurality of snapshots.

Abstract: Presented herein are methodologies for implementing erasure coding in a distributed log structured storage system. A method includes receiving a write request for first data from a file system, selecting a physical sector on a selected storage device in an array of storage devices on which to store the first data, assigning a key to the physical sector, storing the key and an indication of the physical sector in a key-to-physical medium map, erasure coding the data, including generating parity data associated with the first data, writing the first data and the parity data as a data stripe to each storage device in the array of storage devices and, in response to receiving the write request, sending the key to the file system. Read, update, and delete procedures in the context of a log structured framework are also described.

Abstract: This disclosure describes techniques for storing large files to file system volumes. In some examples, this disclosure describes techniques for storing files larger than a maximum file size allowed for File Allocation Table (FAT) file systems to a volume formatted according to a FAT file system. In this manner, the techniques described here may support larger file sizes while being backwards compatible.

Abstract: A distributed system is provided that includes member nodes and a leader node. Each member node stores a database and updates the database by performing common ones of a plurality of transactions. The leader node generates a batch, to be executed by each member node, which includes two or more transactions lacking an access conflict from among the plurality of transactions. The leader node includes: a section that generates an access set as a set of database entries to be accessed by each transaction to be executed; a section that generates the batch, based on the access set of each transaction to be executed; and a leader-side section that performs a consensus process for the batch among the leader and member nodes. Each member node includes the database; a member-side section that performs a consensus process for the batch; and a section that performs parallel execution of batch transactions.

Abstract: Systems and methods are disclosed for comparing selections of text to show differences between the two selections. The text may be selected from the same source or from two different sources. In one implementation, a system receives a first selection of text for comparison and places the selection in a first buffer. The system receives a second selection of text for comparison and places the second selection in a second buffer. The system compares the first buffer and the second buffer to determine differences and displays the differences. In some embodiments, the system may allow a user to choose two buffers from among a plurality of buffers for comparison.

Abstract: In one embodiment, a method of searching for patent-related documents stored in a document corpus include receiving, by a computing device, a search query comprising a first term and a second term, wherein the search query indicates that the first term is an equivalent of the second term, searching the document corpus for patent-related documents wherein the first term is used interchangeably with the second term, and preparing for display a list of one or more patent-related documents. In yet another embodiment, a method of searching a parts thesaurus, includes receiving, by a computing device, a search query including a search term, and searching the parts thesaurus for term variants of the search term. The method further includes preparing for display term variants of the search term found in the parts thesaurus.

Abstract: A migration plan is created that is based at least in part on an operator input. The resources of a destination file system are provisioned based on the migration plan. One or more processes to migrate the source file system for the provisioned resources of the destination file system are then configured based on the migration plan.

Abstract: As disclosed herein, a method includes receiving a plurality of datasets from a database, wherein each dataset comprises one or more data fields represented in a single data format, and wherein the data fields from at least two of the datasets are represented in different data formats, combining the plurality of datasets to provide a created data column corresponding to all of the data fields from the plurality of datasets, organizing the data column into data clusters, wherein each data cluster includes data fields represented in a single data format, and wherein each data field belongs to a data cluster, providing a key-value map referencing data fields with respect to their corresponding data formats, and verifying the database with respect to the created column. A corresponding computer program product and computer system are also disclosed.

Abstract: A computer system implements a file system migration by determining a destination namespace of a destination file system based at least in part on a namespace of a source file system. At least a portion of the destination namespace includes an organization that is altered as compared to a corresponding portion of the source namespace.

Abstract: Embodiments include a code loader method for loading attributes corresponding to an isolated method by a container-based language runtime. The attributes are received by the container-based language runtime without any specified container for storage of the isolated method attributes. The attributes received as parameters of code loader method and include instructions, live objects, and parameter types corresponding to the isolated method. The container-based language runtime selects a first-order container for storing the attributes of the isolated method.

Abstract: An information handling system (IHS) and a method for a host application to access and verify contents within all non-volatile storage of the IHS. The method utilizes an access controller that has access to non-volatile storage which cannot be directly accessed from a host operating system. The access controller, upon receiving a request from the host application to view contents in a non-volatile storage that is not accessible to the host application, copies the contents of the un-accessible non-volatile storage to a storage medium communicatively coupled to the access controller. The access controller then presents the storage medium as a virtual storage device to the host application, enabling the host application to access the copied contents of the un-accessible non-volatile storage.

Abstract: A computer-based method for creating enforced, context-specific sharing of ontologically mapped, aggregated medical data includes storing at least one data field in a database as an entity type ontology, receiving context-specific rule configurations corresponding to the entity type ontology, and identifying any conflict between the received context-specific rule and any applicable rule. The context-specific rule configurations include at least one context, one data source, and one entity type ontology data field. If a conflict is identified, the method receives resolution of the conflict and stores the context-specific rule configurations in the database.

Abstract: Techniques are disclosed for determining ownership of a data segment. The techniques include providing a data segment in a data storage appliance that facilitates multiple references of the data segment by one or more storage entities. The techniques also include maintaining a plurality of counts in connection with the data segment, the plurality of counts comprising (i) a first count representing a sum of first values that identify the respective storage entities associated with each reference of the data segment, (ii) a second count representing a sum of second values that derive from key values of the respective storage entities associated with each reference of the data segment, and (iii) a third count representing a number of references of the data segment by the respective storage entities. The techniques also include determining whether the said storage entity exclusively owns the data segment based on the plurality of counts and a key value of one of the respective storage entities.

Abstract: A specification of the process model is received. The process model includes a plurality of process components. A relationship between a first process component and another process component of the plurality of process components is determined using a predictive model. A process rule for the first process component is determined. The process rule specified a second process component to be executed. The process rule includes the relationship determined using the predictive model or a heuristic rule. The second process component is executed according to the process rule.

Abstract: The present disclosure relates to a computer-implemented method for processing a data table. The data table comprises a set of attributes. The method comprises storing the data table on one or more data blocks consisting of one or more sub-blocks. The method comprises determining distinct values of at least one attribute for the one or more sub-blocks relating to a respective data block of the one or more data blocks. The method further comprises storing information indicating the distinct values as hierarchical attribute value information for the respective data block. The hierarchical attribute value information indicates a presence of the distinct values in the one or more sub-blocks.

Abstract: Described herein are systems and methods for providing access to a database in a multi-tenant environment, including the use of a connection pool, and support for efficient connection validation. For example, the system can support a “seconds to trust idle connection” functionality, which enables lazy validation of connections in the connection pool. The seconds to trust idle connection is the time period, expressed, for example, as a number of seconds, within a particular connection usage, that the connection pool trusts that the connection is still viable, and if so will skip a connection validation test before delivering the connection to a requesting application.

Abstract: Database metadata and methods to adapt the same are disclosed. An example method includes determining, by executing a first instruction with a processor, a first database field pattern assigned to a field of a database, the first database field pattern assigned to the field via metadata for the database, determining, by executing a second instruction with the processor, an error rate of the data for the field with the first database field pattern, and in response to determining that the error rate meets a threshold: identifying, by executing a third instruction with the processor, a second database field pattern that matches the data; and modifying, by executing a fourth instruction with the processor, the metadata to assign the second database field pattern to the field.

Abstract: This specification describes technologies relating to generating transforms based on rule sets. In general, one aspect described in this specification can be embodied in methods that include receiving a rule set including execution cases, where at least one execution case in the rule set includes one or more trigger conditions and a specification of an output that is to be generated when the one or more trigger conditions are all satisfied. The methods may further include generating a control structure including a sequence of rows corresponding to one or more execution cases in the rule set. Each row may include a sequence of one or more trigger conditions and information specifying the output for a corresponding execution case. For at least one of the trigger conditions, when the trigger condition is failed, the control structure may direct processing to skip at least one row in the sequence of rows.

Abstract: Systems, methods, and articles of manufacture for evaluating colliding data records are provided. The system may ingest one or more data inputs from one or more data sources. The system may parse the data inputs and determine whether the data is preexisting in the system. In response to the data input and stored data at least partially conflicting (e.g., colliding), the system may generate a candidate dataset based on the data input and the stored data. The candidate dataset may comprise two or more data candidates comprising permutations of the data values in the data input and the stored data. The system may evaluate each data candidate, score each date candidate based on the evaluation, and determine the data candidate having the greatest score.

Abstract: Systems and methods are disclosed to implement a re-sharding technique that redistributes data in a first set of shards of a first stream into a second set of shards of a second stream to reduce the entropy of the data. In embodiments, individual ones of a number of re-sharding nodes determine statistics on an individual shard. The statistics include, for individual data keys in the shard, a frequency of the key and the cardinality of the key. The re-sharding node then selects a list of high-frequency, low-cardinality keys to be used generate a re-sharding scheme that is used to redistribute data items in the first set of shards to the second set. The re-sharding scheme assigns data items having the same key value combinations to the same range of shards in the second set. Accordingly, upon redistribution, data entropy in the second set of shards is reduced.

Abstract: The invention relates to applying a query tag in an object relational mapping tool. According to an embodiment of the present invention, a system comprises: a Repository API; a relational database management system (RDBMS); an object relational mapping (ORM) Tool that receives input from the Repository API and translates the input to the RDBMS; and a processor, coupled to the Repository API, the ORM Tool and the RDMBS, configured to perform the steps comprising: determine, at the Repository API, a query tag that identifies an origination source code; propagate the query tag to a database connection context within the ORM Tool; and inject the query tag into a generated SQL command.

Abstract: The disclosure generally describes methods, software, and systems for comparing different configurations of the same system. A query for determining differences between a first system and a different second system is received at a central server. Both systems are remote from the central server and have configurations related to a particular application. Using stored metadata at the central server, a difference is determined between a first customized configuration of the first system and a different second customized configuration of the different second system. The stored metadata identifies tables defining a scoping of each of the first system and the different second system. The difference is provided by the central server in response to the received query.

Abstract: A system or method selects among multiple tuners to tune a particular channel. A request is received to tune a first channel. In response to this request, a first tuner is assigned to tune the first channel. A request is received to tune a second channel. If the program tuned by the first tuner is not being recorded, the first tuner is assigned to tune the second channel. If the program tuned by the first tuner is being recorded, the second tuner is assigned to tune the second channel.

Abstract: A controller, which manages nodes that provide virtual entities, receives information from a first of the nodes, where the received information relates to a characteristic of a virtual entity provided by the first node. The controller determines that the received information is inconsistent with information, maintained by the controller, relating to the characteristic of the virtual entity provided by the first node. In response to the determining, the controller reconciles an inconsistency between the received information and the information maintained by the controller.

Abstract: Systems and techniques for stream selection from multi-stream storage devices. Notification of a KVS tree write request for a multi-stream storage device is received. The notification includes a KVS tree scope corresponding to data in the write request. A stream identifier (ID) is assigned to the write request based on the KVS tree scope and a stability value of the write request. The stream ID is returned to govern stream assignment to the write request, the stream assignment modifying a write operation of the multi-stream storage device.

Abstract: Embodiments include a code loader method for loading attributes corresponding to an isolated method by a container-based language runtime. The attributes are received by the container-based language runtime without any specified container for storage of the isolated method attributes. The attributes received as parameters of code loader method and include instructions, live objects, and parameter types corresponding to the isolated method. The container-based language runtime selects a first-order container for storing the attributes of the isolated method.

Abstract: Systems and methods for enhancing the depth and richness of content in computer-generated patent applications by providing non-explicit support for individual claim features are disclosed. Exemplary implementations may: receive a previously unseen claim feature, the previously unseen claim feature being absent from the previously received patent documents; provide one or more sentences of never-been-seen-before computer-generated text using the trained machine learning model and the previously unseen claim feature as input; and insert the one or more sentences of non-explicit support in a draft patent application proximal to explicit support for the previously unseen claim feature.

Abstract: Systems and techniques for merge tree modifications for maintenance operations are described herein. A request for a KVS tree is received. Here, the KVS tree is a data structure including nodes and the nodes include a temporally ordered sequence of kvsets that store keys in sorted order. A parameter set for the KVS tree is received. The request is executed on the KVS tree by modifying operation of the KVS tree in accordance with the parameter.

Abstract: A secure element (SE) with a notion of time useful for checking secure items is disclosed herein. Use of Public Key Infrastructure (PKI) with secure elements is improved by verifying secure items used by an SE. Methods of obtaining time information by the SE include push, pull, opportunistic, local interface, and multi-check methods. The SE uses the time information to evaluate arriving and stored public key certificates and to discard those which fail the evaluation. The SE, in some embodiments, uses the time information in cooperation with certificate revocation lists (CRLs) and/or online certificate status protocol (OCSP) stapling procedures. A multi-check architecture is provided herein by which more than entity is involved in checking a time value before the time value reaches the SE. The multi-check architecture uses both PKI and blockchain techniques.

Abstract: Systems and methods are presented for cross-fading (or other multiple clip processing) of information streams on a user or client device, such as a telephone, tablet, computer or MP3 player, or any consumer device with audio playback. Multiple clip processing can be accomplished at a client end according to directions sent from a service provider that specify a combination of (i) the clips involved; (ii) the device on which the cross-fade or other processing is to occur and its parameters; and (iii) the service provider system. For example, a consumer device with only one decoder, can utilize that decoder (typically hardware) to decompress one or more elements that are involved in a cross-fade at faster than real time, thus pre-fetching the next element(s) to be played in the cross-fade at the end of the currently being played element.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to implement a network protocol based file system client for read-only exports. The file system client receives a mount request to mount an export at a file system server. The file system client stores an access type of the mounted export. Responsive to the file system client receiving from a user a modification request to perform a modification on an object in the mounted export, the file system client sends an attribute check request to the file system server. Responsive to the file system client receiving a first read-only file system error from the file system server, the file system client sets a read-only file system error flag.

Abstract: Techniques described herein relate to systems and methods of data storage, and more particularly to providing layering of file system functionality on an object interface. In certain embodiments, file system functionality may be layered on cloud object interfaces to provide cloud-based storage while allowing for functionality expected from a legacy applications. For instance, POSIX interfaces and semantics may be layered on cloud-based storage, while providing access to data in a manner consistent with file-based access with data organization in name hierarchies. Various embodiments also may provide for memory mapping of data so that memory map changes are reflected in persistent storage while ensuring consistency between memory map changes and writes. For example, by transforming a ZFS file system disk-based storage into ZFS cloud-based storage, the ZFS file system gains the elastic nature of cloud storage.