Abstract: A metadata-driven file system prioritizes the distribution of files across different storage devices based on arbitrary file metadata matching to different file usage scenarios defined within one or more workflows or taxonomies. The file metadata may be tagged with different key-value pairs from the defined workflows or taxonomies. Upon receiving a file or file access request, the metadata-driven file system matches the file metadata to a key-value pair combination of the taxonomy, and stores the file to a storage device that is selected using a storage rule that is defined for the matching key-value pair combination. The taxonomy may be defined with other programmatic file operations that the metadata-driven file system may perform against files with matching metadata.

Abstract: The present disclosure discloses a method and system for integrating a dynamic Business Logic (BL) Database (DB) with a Human Machine Interface (HMI) application. The method comprises receiving a Business Logic (BL) specification. The BL specification comprises BL data and one or more parameters associated with the BL data. Further, one or more state charts of the BL data are generated from the BL specification. Thereafter, a dynamic BL DB is developed based on the one or more parameters and the one or more state charts. Furthermore, the BL data in the dynamic BL DB is updated when the BL data in the BL specification is updated. Lastly, the dynamic BL DB is integrated with a HMI application utilizing the BL data to implement the BL. The HMI application retrieves the updated BL data from the dynamic BL DB for implementing updated BL.

Abstract: Systems, products and methods for enabling symptom verification. Verifying a symptom may include eliminating repeated symptom definitions or eliminating symptoms having low accuracy. A computer system enables verification of a symptom including a rule for detecting a set of events related to a given problem. The computer system includes a symptom database which stores the symptom, a specimen database which stores a specimen including a set of events detected according to a rule of a certain symptom, and an analysis unit which analyzes the specimen stored in the specimen database using a new symptom in order to determine whether to add the new symptom to the symptom database. The present disclosure also includes a method and a computer program for enabling verification of a symptom including a rule for detecting a set of events related to a given problem.

Abstract: Provided is a database journaling method and apparatus for storing a log file in a storing apparatus by performing a lesser number of record commands to decrease a volume of data to be input and output by the storing apparatus, and the database journaling method may include determining whether a database is changed based on an operation performed on data in the database, generating a log file including log entries for the database when the database is changed, and performing journaling on the database by storing the generated log file in a storing apparatus, wherein each of the log entries includes a log record in which the data associated with a change of the database is stored, and metadata for the log record is recorded in a predetermined area embedded in the log record.

Abstract: Replication of search-related configuration customizations across multiple individual configuration files of search heads of a cluster for a consistent user experience. A search head leader of the cluster can receive a first journal entry relating to a first customization of a knowledge object from a first search head of the cluster. Each search head of the cluster can be configured to perform a reduce phase of a map-reduce search computation. The search head leader may determine the first journal entry references a parent commit journal entry matching a latest commit journal entry in a journal stored in a local data store of the search head leader. The first journal entry can be stored in the journal. A configuration file in the local data store of the search head leader may be updated to include the first journal entry. A communication indicating the updating of the configuration file can be sent to the first search head.

Abstract: The scalable high-level fusion of structured and unstructured data includes ingesting and processing unstructured data to produce a statistical model stored as extracted entities then mapped to a collection of resource description framework (RDF) triples, and applying a semantic analysis to a set of structured data to produce a logical model stored as a collection of triples. Reasoners are applied to both models generating an extended knowledge graph of both base and inferred knowledge that is decomposed into a wide table database, with each row storing a corresponding triple, and a reasoner converting the RDF triples into associated triples by adding a new column to the database in response to detecting a new predicate for a subject already present in one of the rows of the database so that the new predicate is stored in the new column in a new row created for the subject already present.

Abstract: Some embodiments are directed to a method for exchanging data between a user and one or more data sources, the method including configuring a non-transitory computer readable medium to access data from the one or more data sources via a data source query in accordance with options specified in first and second XML configuration files. The non-transitory computer readable medium further retrieves the data in a predefined format at a database and displays the data in accordance with display options specified in the first and the second XML configuration files.

Abstract: In an example embodiment, gradient boosted decision trees are used to generate tree interaction features, which encode a set of decision rules for features of search results and hence allow feature interactions. These tree interaction features may then be used as features of a GLMix model, essentially injecting non-linearity into the GLMix model.

Abstract: A data model can be generated by dualizing another data model. In other words, a first data model can be transformed into a second data model, wherein the second data model is a mathematical dual of the first data model. For example, a non-relational data model can be generated by dualizing a relational data model.

Abstract: An intelligent log gap detection to ensure necessary backup promotion. Specifically, a method and system are disclosed, which entail determining whether to pursue a differential database backup or promote the differential database backup to a full database backup, in order to preclude data loss across high availability databases. The deduction pivots on a matching or mismatching between log sequence numbers (LSNs).

Abstract: Disclosed aspects include the database management system detecting that a first data storage medium includes a first set of data of a database. The first data storage medium has a first access-factor. The database management system detects that a second data storage medium includes a second set of data of the database. The second data storage medium has a second access-factor which differs from the first access-factor. Based on a data storage relationship, the database management system determines a query plan to access both the first set of data with respect to the first data storage medium and the second set of data with respect to the second data storage medium. The database management system establishes the query plan.

Abstract: According to some embodiments, a selection server is in communication with a potential communication device database and a currently participating device database, the potential communication device database storing information about communication devices associated with a transition from a first state to a second state, including at least one communication address associated with each communication device. The selection server may automatically identify a communication device as meeting a pre-determined criteria and copy information about the identified communication device from the potential communication device database to the currently participating device database.

Abstract: Methods and systems for shuffling data are described. A processor may generate pair data from source data. The processor may insert the pair data into local tuple spaces. In response to a request for a particular key, the processor may determine a presence of the requested key in a global tuple space. The processor may, in response to a presence of the requested key in the global tuple space, update the global tuple space. The update may be based on the pair data among the local tuple spaces including the existing key. The processor may, in response to an absence of the requested key in the global tuple space, insert pair data including the missing key from the local tuple spaces into the global tuple space. The processor may fetch the requested pair data, and may shuffle the fetched data to generate a dataset.

Abstract: Aspects of the disclosure relate to generating a memory efficient, graph-based tree representation of an address database, where each vertex in the tree corresponds to an individual character in an address. Each address in the database is a string of hierarchical components, and the techniques create a separate tree for each component. Tree jumps connect the last vertex of the tree for one component to the root (first) vertex in the tree of the next component. Aspects of the disclosure relate to depth-first search techniques for determining alignment between a user-input address string and the sequences in such an address tree, for example, by searching first for sequences that exactly match the input and iteratively increasing the allowable edit penalty if not enough results are returned.

Abstract: A method computer program product and computer system for generating a backup of a primary object in an object store system. The object store system comprising: a proxy layer comprising: a plurality of proxy nodes; a backup module; and a ring; a storage layer in communication with the plurality of proxy nodes and the backup module through the ring, the storage layer comprising a plurality of storage nodes, with each storage node having a plurality of servers for managing accounts, a plurality of containers, at least one backup container, and objects stored within the containers and the at least one backup container; and a backup database in communication with the backup module for storing associations between versions of backup copies of the primary objects, the primary copies of objects, the containers, and the at least one backup container.

Abstract: A parameter optimization method includes: a parameter search is performed on an input parameter, an output response value and a target value through a plurality of optimization schemes to search for a plurality of candidate recommended parameters. Each optimization scheme is assigned to a weight value according to user historical decision information. At least one recommended parameter is selected from the candidate recommended parameters according to the weight values. An user interface is provided for a user to input a decision instruction. A new input parameter is selected from the at least one recommended parameter according to the decision instruction; the new input parameter is inputted into the target system; and a new output response value is evaluated whether meets a specification condition. The user historical decision information is updated based on the decision instruction to adjust the weight values.

Abstract: The disclosed apparatus, systems and methods relate to various apparatus, systems and methods relating to associating a tangible item or asset with a specific website by way of a paired signaler and target URL. A wireless communicator and short URL may be used. The system utilizes cloud management platforms and human readable URLs. The signaler may be re-used with multiple target URLs.

Abstract: Systems, methods, and non-transitory computer readable media can perform a first ranking to rank each ephemeral content item collection of a plurality of ephemeral content item collections based on a probability of a user selecting the ephemeral content item collection. One or more ephemeral content item collections from the first ranking to provide in an ephemeral content feed of the user can be selected. A second ranking to rank each ephemeral content item collection of the plurality of ephemeral content item collections other than the selected ephemeral content item collections from the first ranking based on a probability of the user spending time on the ephemeral content item collection can be performed. One or more ephemeral content item collections from the second ranking to provide in the ephemeral content feed of the user can be selected.

Abstract: Cache optimization for missing data is provided. A database system receives a first request for a database record. The database system determines whether the database record is stored in a cache. The database system determines whether the database record is stored in a data store in response to a determination that the database record is not stored in the cache. The database system stores a dummy entry for the database record in the cache in response to a determination that the database record is not stored in the data store. The database system receives a second request for the database record. The database system determines whether the database record is stored in the cache. The database system outputs an indication that the database record is unavailable in response to a determination that the dummy entry stored for the database record is in the cache.

Abstract: Analyzing a large number of files to identify malicious software including evaluating a multigraph including determining a graph having a plurality of nodes, including a source node and target nodes from a data set and merging the graph into a multigraph in response to a node score above a threshold level, for each target node; determining one or more specificity indexes for target node and determining a node score for the target node based, at least in part, on a specificity index.