Abstract: A device receives, from a user device, a request to prune a primary database, and receives primary database information associated with the primary database and secondary database information associated with a secondary database that is different than the primary database. The device processes the primary database information and the secondary database information, with a machine learning model, to generate suggested pruning parameters, and provides the suggested pruning parameters to the user device. The device receives selected pruning parameters from the user device, where the selected pruning parameters are selected from the suggested pruning parameters or are input via the user device. The device removes pruned information from the primary database based on the selected pruning parameters, and provides the pruned information to the secondary database based on the selected pruning parameters.

Abstract: A storage apparatus includes a memory, and a processor coupled to the memory and configured to, upon reception of an instruction to restore a copy source volume of a copy source storage apparatus that includes the copy source volume and a first volume on which a first snapshot of the copy source volume is created, make a determination as to whether remote copying of the first snapshot to a copy destination volume of a copy destination storage apparatus is completed and the copy destination volume is equivalent to the first volume, the copy destination storage apparatus including the copy destination volume onto which the remote copying is performed and including a second volume on which a second snapshot of the copy destination volume is created, and configured to decide, based on a result of the determination, a restoration source volume from the copy destination volume and the second volume.

Abstract: One or more techniques and/or systems are provided for detecting stale data and/or changed data. For example, a bitmap file may be maintained and mapped to an inofile describing various states of files of a file system. The bitmap file may be populated with bitmap records indicating whether files were accessed, modified, or have other states. The bitmap file may efficiently convey information used to determine whether files have not been accessed recently (e.g., stale data) or were recently modified (e.g., changed data) compared to the inofile because the bitmap file may comprise a fraction of the size of the inofile (e.g., a byte of information may be used to represent various states of one or more files). In this way, instead of evaluating a relatively larger inofile, the bitmap file may be evaluated to efficiently identify stale data for deletion or destaging and/or changed data for backup.

Abstract: The apparatus for converting metadata sets a standard protocol model of metadata to be applied, collects metadata of a distribution platform that is a collection target, performs mapping between the collected metadata and the standard protocol model, and converts mapped metadata to a file format for metadata exchange.

Abstract: A verification architecture described according to embodiments of the present invention validates changes made to metadata and may comprise one or more subsystems and phases. According to some embodiments, the “mkfs” volume creation utility works in cooperation with the device driver to create a file system volume by means of reservation and initialization space for metadata structures inside the device's partition that is reserved for the specific file system volume. The storage device uses a verified area legend when checking write requests after the file system volume has been created. The verified area legends may be stored in a dedicated partition or inside the master boot record (MBR) or Globally Unique Identifier (GUID) partition table (GPT) or special memory chip (NAND flash, for example). Write requests that overlap with any extent of reserved metadata area must be verified to prevent metadata corruption.

Abstract: The present disclosure relates to methods and apparatus where a user may enter information into a computing device that may allow the computing device to classify data or files that are stored on one or more computing devices to be quickly classified. Methods and systems consistent with the present disclosure allow a user to identify data by a type of data or file and provide classification information such that the computing device may identify data by the data type and to classify that data automatically according to a rule. The information entered by a user that wishes to classify stored data may be entered over a graphical user interface (GUI) at a user device.

Abstract: Orchestrated disaster recovery is provided in which replication volumes are automatically configured as part of a failover procedure. An example method includes obtaining replication volume configuration information identifying configuration of a replication volume in a data replication relationship in which data is replicated from a replication source to a replication target. The replication volume is configured for the replication source and replication volume remains at least partially non-configured for the replication target during data replication from the replication source to the replication target. Based on an indication of failover, the obtained configuration information is used in automatically configuring the replication volume for the replication target in preparation for use by application(s) of the replication target site. Automatically configuring includes configuring, for the replication volume, a volume group and a mount point.

Abstract: An information management system including at least one data storage device and at least one processor coupled to the at least one data storage device. The at least one processor is configured to receive at least one object, the object having a location in a hierarchical file organizational structure. The processor also generates at least one prospective keyword for the at least one object based upon the location of the object in the hierarchical organization structure, and associates the at least one object with at least one of the prospective keywords.

Abstract: In a general aspect, a multiple-entity root of trust is constructed and maintained for use in a cryptography system. In some aspects, a genesis data block includes genesis block data entries representing respective member entities of a root of trust consortium. A genesis block is generated by digitally signing the genesis data block. The genesis block is provided for use by end entities as a root of trust in a cryptography system. In some aspects, a hash of an existing block of a chain is obtained, and a data block comprising a data entry is generated. The data entry identifies an action by one or more member entities of the root of trust consortium. A new block of the chain is generated by digitally signing a combination of the data block and the hash of the existing block. The new block is provided for use by end entities as the root of trust in the cryptography system.

Abstract: A method includes integrating a file system recovery log layer in a file system. The file system buffers data in a cyclical manner, and transforms all incoming random requests into a series of synchronous sequential updates. The method determines a length value of a write transaction byte-range for a received write transaction. Upon the length value exceeding a threshold value, data for the write transaction byte-range is written to permanent storage in the file system. Upon the length value being less than the threshold value, the data for the write transaction byte-range is written to a recovery log that is stored in the file system recovery log layer. The threshold value is changed dynamically while the file system is mounted.

Abstract: The technology disclosed herein enables the restoration of a database version across cloud environments. In a particular embodiment, a method provides receiving, in a second cloud environment from a first cloud environment, first metadata describing a first data version stored in the first cloud environment. The first data version includes first data items and the first metadata. After receiving the first metadata, the method provides receiving, in the second cloud environment, an instruction to restore the first data items to the second cloud environment. In response to the instruction, the method provides restoring the first data items to the second cloud environment using the first metadata.

Abstract: Methods and a system are provided. A method includes automatically detecting, by an attribute structural variation detector, attribute structural variations in record schemas of a database lacking schema enforcement. The automatically detecting step includes encoding, by an encoder, nodes in the record schemas based on respective updated node labels to obtain a plurality of codes. The encoding step comprises, for each of the plurality of codes: recording, by a label frequency counter, a frequency f1 of the record schemas that include a given label; and recording, by a label frequency counter, a frequency fc of the record schemas that use a given one of the plurality of codes to update a label of a next level. An attribute variation is detected and retrieved responsive to the frequency fc?0, and the frequency f1>(two times the frequency fc).

Abstract: An information processing apparatus includes an outcome management unit that manages an outcome, a message management unit that manages a message corresponding to the outcome, and a presentation unit that classifies and presents the message according to a relationship between the outcome and the message.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for infinite versioning by automatic coalescing. In a particular embodiment, a method provides determining an age range for a plurality of data versions stored in a secondary data repository and identifying first data versions of the plurality of data versions that are within the age range. The method further provides determining a compaction ratio for the first data versions and compacting the first data versions based on the compaction ratio.

Abstract: A system comprises a data system interface, a database system and a data object storage interface. The data system interface receives a request issued by a requester to retrieve content data from the database system; forwards the request to the database system; receives in response, non-content data relating to a data object stored in a data object storage; forwards to the data object storage interface: the non-content data and details of the request; receives from the data object storage interface, a response comprising the content data; and forwards the content data to the requester. The data object storage interface receives details of the request, together with non-content data; forwards them to the data object storage, receives from the data object storage a data object comprising the content data; and forwards to the data system interface the content data.

Abstract: A non-transitory computer-readable medium stores program code including instructions that, when executed by one or more processors, cause the one or processors to perform operations including storing and managing social network data in a social network database; receiving location information from a plurality of electronic devices associated with the social network data; specifying users of electronic devices present in a specific space at a specific time among the plurality of electronic devices; filtering relation information between the specified users in the social network database; and calculating an analysis index for the specific space and the specific time based on the filtered relation information.

Abstract: A computer based method of searching for, monitoring for, tracking, and automatic reporting of a title plant filed documents relating to user's selection parameters within a client's area of business, standardizing and categorizing the data in order to easily query the title plant records relatable to the standardized property owner data, continually updating the title plant data with newly filed pertinent documents, and notifying the client if a newly filed pertinent document is detected. The user's selection of search parameters and type of documents monitored are selected by the user. The database is updated frequently, daily if possible, to provide the most accurate search results. Automatic notification of a newly filed selectively identified document is sent to the user in real time.

Abstract: A method for managing contents shared by a Social Network Service (SNS), executed by a cloud server which is associated with an account of the SNS. It is detected whether a first content has been newly uploaded to the SNS or whether a metadata related to the first content previously uploaded to the SNS has been newly added. A second content corresponding to the first content is searched. The cloud storage is updated by linking context information related to the first content to the second content corresponding to the first content. The cloud server interworks with an account of the SNS of each user's individual to link context information of content shared on the SNS with the content stored in the personal cloud storage, thereby enabling easier update of the cloud storage. A user may easily search for desired contents using the context information.

Abstract: A system and a method are disclosed for using a client that is unsynchronized with a blockchain network to validate blockchain transactions for IoT devices, web apps, mobile apps, and other applications. The client retrieves a register of nodes (acting as information provider or validator) that are synchronized with the blockchain network, selects a node from the register, and transmits an information request to the selected node. The client receives a response to the request, the response including the requested information and validation indicia (e.g., proofs), and determines whether the response is valid based on the validation indicia. The client transmits, in response to determining that the response is valid, a confirmation to the IoT device, web app, mobile app or other applications.

Abstract: Managing digital asset representation of physical assets with smart contracts recorded in a blockchain ledger in IoT systems and environments using a blockchain ledger. Digital twin events are recorded in the blockchain ledger. The events are monitored to detect satisfaction of the smart contract. The digital twin is instantiated and appropriate actions are taken, such as indicating a length of time to maintain the digital twin.

Abstract: Disclosed herein is a system and method for interoperability of blockchains thereby allowing use of smart contracts across blockchains in real time and in a secured manner. A plurality of blockchains are connected to each other and allow use of smart contracts written on them by other connected blockchains without the need of rewriting and/or downloading the smart contract on other blockchain. The disclosed system and methods use a distributed file system storage for secured processing of information flowing from one blockchain to other connected blockchain. Further, each connected blockchain is associated with distinct private and public key in order to encrypt and decrypt the data flowing across blockchains.

Abstract: A new approach is proposed that contemplates systems and methods to ascribe or transfer metadata from one search-related entity to another, where each entity can be one of subject or source, citation, and object or target. First, one or more complete or incomplete attributes associated with one or more of entities across source, citation and target are identified with a high degree of probable accuracy, wherein such metadata or attributes include but are not limited to, time, language, and location of the entities. The identified attributes are then ascribed or transferred from one entity where the metadata is available to other search entities. Finally, the transferred attributes can be utilized to facilitate the selection and ranking of the cited targets for the search result.

Abstract: [PROBLEM TO BE SOLVED] To efficiently associate fields for performing data analysis across a plurality of data sources having different designs, facilitating various analyses. [SOLUTION] Set indices for each field in a plurality of data stores, determine similarity between each field, and generate an enterprise data graph, a graph format data with highly similar fields as nodes. To determine similarity, a technique such as a morphological analysis provided by a search engine may be used. By using the enterprise data graph, it is possible to handle various inquiry requests that run across multiple data stores.

Abstract: A method may include generating, based on a representation of a hierarchy stored in a database, a visiting sequence data structure. The hierarchy may be stored in a table in the database. Each of a plurality of rows comprising the table may correspond to one of a plurality of nodes comprising the hierarchy. The visiting sequence data structure may include a row vector specifying an order for traversing the plurality of nodes in the hierarchy. A hierarchical window function may be executed by iterating through the plurality of rows in the table in accordance with the order specified by the row vector. The execution of the hierarchical window function may further include determining, for a first node in the hierarchy, a summary value corresponding to a first value of the first node and a second value of a second node descendent from the first node.

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: A user device includes a processing unit that executes a search application. Executing the search application causes the processing unit to receive a user search query, send the user search query to a plurality of target applications, and receive a set of search results from each of the target applications. Each search result includes application state access data configured to access an application state of the target application associated with the search result. Executing the search application causes the processing unit to rank the search results, display the ranked search results, and detect user selection of one of the displayed search results. Additionally, executing the search application causes the processing unit to send the application state access data associated with the selected search result to the target application associated with the selected search result and display the application state accessed using the application state access data.

Abstract: The present invention is a computer-implemented method in a server system for evaluating a number of submissions provided by a number of applicants. The method groups the submissions into subgroups which are then assigned to each applicant. Each applicant ranks the subgroup that they are provided from best to worse. A score is calculating based on the rankings by all applicants. That score is used to calculate an initial global ranking which can be compared to the rankings of specific pairs of submissions within each subgroup to determine the accuracy of the global ranking overall. If inaccurate, the specific pairs can be adjusted to increase the accuracy of the global ranking.

Abstract: A method, system, and processor-readable storage medium are directed towards generating a report derived from data, such as event data, stored on a plurality of distributed nodes. In one embodiment the analysis is generated using a “divide and conquer” algorithm, such that each distributed node analyzes locally stored event data while an aggregating node combines these analysis results to generate the report. In one embodiment, each distributed node also transmits a list of event data references associated with the analysis result to the aggregating node. The aggregating node may then generate a global ordered list of data references based on the list of event data references received from each distributed node. Subsequently, in response to a user selection of a range of global event data, the report may dynamically retrieve event data from one or more distributed nodes for display according to the global order.

Abstract: According to certain aspects, the invention provides advanced software architected to leverage the operational data volumes from IT, intelligent devices and machines supported and maintained by IT or end users for use by business groups or individuals in order to create a low Total Cost of Operation (TCO) processes that enable data sources to be transferred, modified, and computations performed based on the needs of the end users operating independently or within the enterprise data assets To cost effectively capture any data source and place within the enterprise' standard data structures and processes. According to another aspect, the invention provides the end user options with capability to re-structure, copy, and re-position data for corporate and end users for ongoing corporate applications via a selection of options methodology that is supported by usage of the end user versions of spreadsheet software.

Abstract: A system for extracting latent information from data includes obtaining or generating components of the data, where the data components include scores indicating how the component relates to the data. Memory is allocated for the components and the components are stored in the allocated memory. The components are then transformed into documents using a suitable transformation function, and the documents are analyzed using natural language processing, to extract latent information contained in the data.

Abstract: A non-transitory computer-readable recording medium having stores therein a metadata processing program for causing a computer to execute a process including: extracting, based on comparison between a first input item name of first input data and a first output item name of first output data, an element other than an element included in both of the first input item name and the first output item name; and generating, when the extracted element and an argument of a program which generates the first output data from the first input data include an element related to a first input item value of the first input data, metadata in which the element related to the first input item value in the extracted element is transformed into a variable.

Abstract: Techniques and mechanisms are disclosed to execute data searches using generation identifiers. In general, a method of executing the searches comprises broadcasting, from a search head, a first query to a plurality of indexers in a cluster, wherein a portion of the first query is directed to a set of data, and wherein the set of data comprises time-stamps within a particular time frame. The method further comprises providing, with the first query, a first generation identifier for the set of data, wherein the first generation identifier identifies a first indexer from the plurality of indexers to serve as a primary indexer for responding to queries that comprise the first generation identifier and that pertain to the set of data, wherein one or more indexers in the cluster other than the first indexer are designated as secondary indexers, wherein the secondary indexers are configured to ignore queries that pertain to the set of data and that comprise the first generation identifier.

Abstract: A method and apparatus for distribution of applications amongst a number of servers, ensuring that changes to application data on a master for that application are asynchronously replicated to a number of slaves for that application. Servers may be located in geographically diverse locations; the invention permits data replication over high-latency and lossy network connections and failure-tolerance under hardware and network failure conditions. Access to applications is mediated by a distributed protocol handler which allows any request for any application to be addressed to any server, and which, when working in tandem with the replication system, pauses connections momentarily to allow seamless, consistent live-migration of applications and their state between servers.

Abstract: An analytics platform is configured to receive a request to execute a distributed analytics workflow specification comprising multiple distributed computations to be performed across a plurality of data processing clusters associated with respective data zones. For each of a plurality of analytic services to be executed in accordance with the distributed analytics workflow specification, the platform determines if execution of the analytic service is authorized for the request, and for each of a plurality of datasets to be operated on by one or more of the analytic services in accordance with the distributed analytics workflow specification, the platform determines if execution of the one or more analytic services on the dataset is authorized by its corresponding data zone for the request.

Abstract: Disclosed are interest tag determining method and device for accurately promoting information for users in a group based on interest tags of the group. This includes obtaining a group identifier and a corresponding group name, obtaining user identifiers corresponding to the group identifier and first user contents of the user identifiers, concatenating the first user contents of the user identifiers corresponding to the group identifier to obtain a first group content of the group identifier, calculating probabilities that the first group content is under the topic identifiers, and determining interest tags of the group identifier according to the probabilities that the first group content is under the topic identifiers and an association relationship between the topic identifiers and the interest tags that is determined through pre-training.

Abstract: Systems and methods for indexing data include formulating an objective function to index a dataset, a portion of the dataset including supervision information. A data property component of the objective function is determined, which utilizes a property of the dataset to group data of the dataset. A supervised component of the objective function is determined, which utilizes the supervision information to group data of the dataset. The objective function is optimized using a processor based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

Abstract: A hierarchical structure (e.g., a hierarchy) for use in hierarchical analysis (e.g., hierarchical forecasting) of timestamped data can be automatically generated. This automated approach to determining a hierarchical structure involves identifying attributes of the timestamped data, clustering the timestamped data to select attributes for the hierarchy, ordering the attributes to achieve a recommended hierarchical order, and optionally modifying the hierarchical order based on user input. Through the approach disclosed herein, a hierarchy can be generated that is designed to perform well under hierarchical models. This recommended hierarchy for use in hierarchical analysis may be agnostic to any planned hierarchy provided by or used by a user to otherwise interpret the timestamped data.

Abstract: A semantic indexing system, the semantic indexing system comprising a processing resource configured to: provide a corpus comprising a plurality of textual documents, wherein (a) each of the textual documents being composed of one or more sentences; (b) each of the sentences being composed of one or more statements; and generate an index, the index mapping each of the statements to one or more frames; wherein each frame defines a structure that carries a semantic meaning, thereby enabling searching the corpus by the semantic meaning of a search statement.

Abstract: A method for processing text information is provided, the method including: obtaining text information and extracting text characters contained in the text information; extracting, from the text characters, target characters satisfying a predetermined rule; calculating a filtering index of the text information according to the target characters; and when the filtering index meets a predetermined condition, executing an operation corresponding to the predetermined condition on the text information. In addition, an apparatus for processing text information is further provided. The method and apparatus for processing text information can improve the accuracy and efficiency of filtering out junk text information.

Abstract: Computer-implemented methods for determining missing content in a database are provided. The database may contain a plurality of known embedded sentences and their relationship to content. In one aspect, a method includes receiving new queries and generating new embedded sentences from said new queries. The method also includes determining whether the new embedded sentences are similar to known embedded sentences. The method also includes generating a message indicating that new embedded sentence is not linked to content. Systems are also provided.

Abstract: Creating a summary of a plurality of texts includes tokenizing each of a plurality of texts to obtain tokens; generating a vector space using a first set of vectors having one or more obtained feature scores equal to or larger than a predefined value; executing non-hierarchical clustering using the vector space to generate a first plurality of clusters; choosing a first representative text in each of the plurality of clusters;; generating a second set of vectors from each of the arrays generated based on a number of characters included in tokens of the representative texts; executing hierarchical clustering using the second set of vectors to generate a second plurality of clusters ; and in response to a determining a number of clusters included in the second plurality of clusters, determining a second representative text for each of the clusters included in the second plurality of clusters.

Abstract: Relationship extraction between descriptors in one or more lists of weather condition descriptors, and adverse event descriptors within unstructured data sources using natural language processing. Medical condition descriptor may be a descriptor that may be used to further extract relationships between weather condition descriptors and adverse event descriptors. A data object is generated, according to a data model, based on the extracted relationships between the descriptors. A set of candidate unstructured documents containing the extracted relationship between the descriptors is retrieved and filtered by selecting unstructured documents that include a precautionary measure descriptor. The filtered precautionary measure descriptors are presented to a user in a summarized message to a user device.

Abstract: A system comprising a computer-readable storage medium storing at least one program and a method for real-time auditing of industrial equipment conditions is presented. A user interface comprising a table view of condition factor scores associated with industrial equipment is presented. Each of the condition factor scores provides a measure of a factor that impacts an overall functional state of the industrial equipment. An editor window operable to edit a condition factor score from among the condition factor scores is presented within the user interface. A user edit to the condition factor score is received via the editor window. The table view is updated based on the user edit.

Abstract: A system, method and program product for implementing a sketch-based retrieval system. A system is disclosed that includes: an interface having a canvas for entering inputs including user generated strokes, and extracting features associated with the inputs; a hierarchy system for assigning an importance to the inputs; a matching system for retrieving matches from a database based on extracted features and importance associated with the extracted features; a feedback system that provides real-time feedback on the canvas to suggest improved inputs for the user; and a ranking system that ranks retrieved matches for output in the interface by incorporating user interaction history.

Abstract: A clothing information providing system 1 includes an image acquiring unit 11 that acquires an image captured by an image capturing device 2 via a network 90, a detecting unit 121 that analyzes the image acquired by the image acquiring unit and detects clothing of a subject appearing in the image, and a display unit 24 that displays clothing information on the clothing detected by the detecting unit 121 on a user terminal 20.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to interface among repositories of disparate datasets and computing machine-based entities configured to access datasets, and, more specifically, to a computing and data storage platform to implement computerized tools to identify data classifications and similar subsets of graph-based data arrangements with which to join, according to at least some examples. For example, a method may include determining a classification type for a subset of data based on a graph data arrangement, generating presentation data as a first user input to detect selection of the first user input. The method may include predicting a classification type for data. The method may also include generating other presentation data configured to join datasets, such as a column of tabular-formatted data with one or more portions of a graph data arrangement.

Abstract: A method of restoring version data stored across two or more cloud environments is provided. An example method includes accessing, in a second cloud environment, first metadata describing a first data version, the first data version including first data items and first metadata, wherein at least the first data items are stored in a first cloud environment and the first metadata is stored in a third cloud environment. In response to an instruction received in the second cloud environment, the first data items are restored to the second cloud environment using the first metadata.

Abstract: A method for traversing hierarchical data is provided. The method may include generating, based on a source table stored in a database, an index for traversing a graph corresponding to the source table. The source table may identify a parent node for each node in the graph. The generating of the index may include iterating over the source table to generate an inner node map. The inner node map may include at least one mapping identifying one or more children nodes descending from an inner node in the graph. The graph may be traversed based at least on the index. The index may enable the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A computer-implemented method of auditing drug supply chain data gathered from a distributed ledger is disclosed. The method includes receiving a population of drug product records from the distributed ledger. The method includes receiving a first set of drug product criteria. The method includes determining a weighted probability for one or more drug product records of the population of drug product records. The method includes generating a randomized first subset of drug product records from the population of drug product records based on the weighted probability of the one or more drug product records. Other methods, systems, and the like for unbiased drug selection for audit are also disclosed.

Abstract: Methods and apparatus to facilitate generation of database queries are disclosed. An example apparatus includes a generator to generate a global importance tensor. The global importance tensor based on a knowledge graph representative of information stored in a database. The knowledge graph includes objects and connections between the objects. The global importance tensor includes importance values for different types of the connections between the objects. The example apparatus further includes an importance adaptation analyzer to generate a session importance tensor based on the global importance tensor and a user query, and a user interface to provide a suggested query to a user based on the session importance tensor.