Abstract: The disclosure herein describes synchronizing a data cache and an LSM tree file system on an object storage platform. Instructions to send a cached data set from the data cache to the LSM tree file system are received. An updated metadata catalog is generated. If the LSM tree structure is out of shape, compaction is performed on the LSM tree file system which may be on a different system or server. When an unmerged compacted metadata catalog is identified, a merged metadata catalog is generated, based on the compacted metadata catalog and the cached data set, and associated with the cached data set. The cached data set and the associated metadata catalog are sent to the LSM tree file system, whereby the data cache and the LSM tree file system are synchronized. Synchronization is enabled without the data cache or file system being locked and/or waiting for the other entity.

Abstract: Search systems and methods for searching structured data and enhancing the relevancy of search results provided to a requesting user or application. Enhanced search results are provided by searching a cache of a user's most recently used items to eliminate or reduce search indexing latency. Also, more relevant search results are provided by re-ranking results based on use history, data security models and/or hierarchical user role models. Further, enhanced search results are provided by including user information in the search index.

Abstract: Example apparatus and methods identify files that are so small or so large that they compromise the efficient operation of a file system that uses re-assignable one-to-one inodes and inode numbers. Small files are aggregated into collections of files and large files are subdivided into collections of smaller files. Information for locating multiple related files with fewer lookups is generated and stored in a folder. An inode having a new type of inode number is then created. The new type of inode number encodes information for finding the folder. The encoded information may include a folder identifier that acts as a primary key into a database that is configured to locate a member of the aggregated or subdivided files with a single lookup. A filter file system may be updated with the new inode. The new inode number is unique within the filter file system and may not be re-assigned.

Abstract: Approaches for routing data to storage are provided. An approach includes determining implicit metadata from explicit metadata received with a request from a user to store a file. The approach also includes determining a storage resource based on the explicit metadata, the implicit metadata, and a registry of storage resources. The approach additionally includes routing data of the file to the determined storage resource.

Abstract: A distributed database system may implement dynamic quorum group membership changes. In various embodiments, a quorum set may maintain a replica of a data object among group members according to a protection group policy for the data object. A group member may be identified as to be replaced. In response, a new quorum set may be created from the remaining group members and a new group member. The protection group policy may be updated to include the new group members such that subsequently received updates are maintained at both the previous to quorum set and the new quorum set. Previously received updates may be replicated on the new group member. Upon completion of replicating the previously received updates, the protection group policy for the data object may be revised such that subsequently received updates are maintained at the new quorum set.

Abstract: An information processing apparatus, system, method, and program are provided. The information processing apparatus includes storage circuitry, communication circuitry and control circuitry. The storage circuitry stores ingredients classification information that is information obtained by classifying ingredients into upper and lower classes. The communication circuitry receives menu information from a user terminal. The control circuitry specifies each low-order ingredient that is an ingredient included in a lower class of each high-order ingredient, which is an ingredient of an upper class, from the ingredients classification information in a case where the high-order ingredient is included in the menu information, controls the communication circuitry to transmit ingredient information including information of the low-order ingredient to the user terminal, and receives registration of the menu information when the communication circuitry receives the menu information including the low-order ingredient.

Abstract: Systems and methods are provided for integrated data analysis. At least one object that is responsive to a first search query is determined. The object is stored in an object model that is managed by a first computing platform, and the at least one object is associated with one or more properties. One or more data sets that are responsive to a second search query are determined. The data sets are managed by a second computing platform. The one or more data sets are determined related to the at least one object. The at least one object is updated to include at least one property that references at least one analysis that relies on the one or more data sets.

Abstract: A method may include obtaining forms each including fields each including field metadata, obtaining a schema including elements each including element metadata and defining constraints on a field of a form, identifying a corresponding element for each field, creating, for the field, a search result by combining the field metadata of the field and the element metadata of the corresponding element, adding the search result to a search results repository, receiving, from a user, a search query, in response to receiving the search query, determining, using the search results repository, search results, and ranking, using a ranking model, the search results.

Abstract: Techniques are described for real time anonymization. In one example, a first a first query associated with a table is received, the table associated with a first anonymization operation satisfying satisfies a privacy requirement. The first anonymization operation is applied at runtime to generate a first anonymized data set against which the first query is executed. At T2 after T1, a subsequent query is received. A determination is made as to whether a change to the table has occurred since T1. If so, a determination is made as to whether the first anonymization operation satisfies the privacy requirement as applied to the current table. If the operation does not satisfy the privacy requirement when applied to the current table, a second anonymization operation satisfying the defined privacy requirement is determined and applied at runtime to generate a second anonymized data set against which the subsequent query can be executed.

Abstract: Systems and methods are disclosed for optimizing full-spectrum cardinality approximations on big data utilizing an optimized order statistics technique. To accomplish the foregoing, a multiset of objects that each corresponds to one of a plurality of objects associated with a resource are obtained. A compound data object is populated at least in part with data that is derived based on generated decimal fraction hash values that correspond to each object in the obtained multiset. The populated compound data object is processed with a full-spectrum arithmetic mean estimation operation that can accurately determine a cardinality estimate for the obtained multiset using less resources and time when compared to traditional techniques. The determination is further made without the need to employ linear counting or bias correction operations on low or high cardinalities.

Abstract: Systems, computer program products, and methods are described herein for execution of SQL Server Integration Service (SSIS) package. The present invention is configured to electronically receive a user request to execute one or more SSIS packages; retrieve the one or more SSIS packages; initiate an execution of the one or more SSIS packages, wherein the execution further comprises: traversing through each of the one or more steps associated with each of the one or more SSIS packages; identifying one or more files associated with the one or more SISS packages at each of the one or more steps; parsing each file at each step to identify one or more SQL commands embedded in each of the one or more files; and executing each of the one or more identified SQL commands, wherein executing further comprises exporting data; and load the exported data into one or more external databases.

Abstract: To present one or more content to users of an online system, the online system identifies a content evaluation pipeline including an order of a plurality of stages having one or more computer models for evaluating a likelihood of user interaction with a content item. The content evaluation pipeline selects a decreasing number of content items, from each stage of the order, according to the order of the stages in the order. The online system identifies a set of candidate modifications to one or more operational parameters of the content evaluation pipeline. For each candidate modification, the online system determines a compute time value and a content selection value. For a given amount of compute time, the online system optimizes the one or more operational parameters based on the determined content time value and the determined content selection value to increase the content selection value of the content evaluation pipeline.

Abstract: A modular visualization framework registers definitions for a variety of visualization types. The definitions are tagged with visualization characteristics. During a working session, likely interactive, a user identifies a search query used to produce data to be visualized. The working context, including the search query and data produced by its execution, is tagged for its visualization characteristics. Information about the working context, including its visualization characteristics, is then used to produce a customized list of candidates suited for the working context from which the user may select a visualization type.

Abstract: An apparatus, computer-readable medium, and computer-implemented method for visualizing relationships between pairs of columns, comprising identifying a relationship classification corresponding to two columns in a plurality of columns based on a data type of each column in the two columns, applying one or more statistical measures to data in the two columns to generate association data quantifying a plurality of relationships between data values in a first column of the two columns and data values in a second column of the two columns, wherein the one or more statistical measures are determined based at least in part on the relationship classification, and transforming the association data into a visualization, wherein the visualization comprises one or more indicators corresponding to one or more relationships in the plurality of relationships and wherein a layout of the visualization is determined based on the relationship classification.

Abstract: A method and associated systems improve access time of a federated repository that represents a set of individual data repositories as a virtualized aggregated repository. An analyzer module counts the number of entries in each individual repository that are associated with each possible value of a selected concordance parameter. The analyzer stores these counts in a Concordance Frequency Table. When the federated-repository manager receives a data-access request, the analyzer associates the requested data element with a corresponding value of the concordance parameter. The analyzer then uses information stored in the Table to select an optimal sequence in which the federated-repository manager should search the repositories for the requested data. This optimal sequence orders the repositories such that the first repositories to be searched will be those that contain the greatest number of entries associated with the concordance-parameter value of the requested data.

Abstract: Described are methods, systems and computer readable media for persistent query connection architecture.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. A hierarchical cluster ID is generated for respective data records. The hierarchical cluster ID may be made up of a series of values, wherein each value reflects a tier within the hierarchical clustering scheme. A user may enter a partial hierarchical cluster ID to select clusters associated with a lower confidence. Thus, in some embodiments, the hierarchical cluster ID is variable in length in a manner that corresponds to the tiers in the hierarchical clustering scheme.

Abstract: A method is provided that includes generating answer-passage pairs, each associated with a respective one of multiple feature vectors. The method includes, for each answer in the pairs, merging the feature vectors associated with any of the pairs that include the answer to obtain a merged answer vector. The method includes, for each passage in the pairs, (i) merging the feature vectors associated with any of the pairs that includes the passage to obtain a merged passage vector, (ii) merging the feature vectors from the merged answer vector for each answer that is associated with the passage via at least one of the pairs to obtain a merged passage-answer vector, and (iii) concatenating the merged passage vector and the merged passage-answer vector to obtain a concatenated passage vector. The method includes ranking the concatenated passage vector for each passage to obtain a ranked list of passages with associated confidence scores.

Abstract: Systems and methods for improving accuracy of geographic position data are provided. A networked system mines ticket data from content of the ticket. Based on the ticket data, a determination is made that the ticket indicates an issue with a trip involving a point of interest (POI). The networked system extracts trip data from a trip log corresponding to the trip involving the POI, and identifies, from a data storage, stored attributes of the POI. The networked system analyzes the ticket data, trip data, and attributes to determine a workflow to improve accuracy of the POI, whereby the analyzing comprises determining a priority level to verify accuracy of the POI. The workflow is triggered based on the priority level to verify accuracy of the POI.

Abstract: Techniques herein optimize subgraph pattern matching. A computer receives a graph vertex array and a graph edge array. Each vertex and each edge has labels. The computer stores an array of index entries and an array of edge label sets. Each index entry corresponds to a respective vertex originating an edge and associates an offset of the edge with an offset of the respective vertex. Each edge label set contains labels of a respective edge. The computer selects a candidate subset of edges originating at a current vertex. The edge labels of each candidate edge of the candidate subset include a same particular query edge labels. The computer selects the candidate subset based on the index array and afterwards selects a result subset of vertices from among the terminating vertices of the candidate edges. The labels of each vertex of the result subset include a same particular query vertex labels.