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: Application-level data in a storage system are evaluated. For example, a backup analysis tool retrieves a backup object stored in the storage system. The backup analysis tool reconstructs an application object from the backup object. The backup analysis tool accesses the first application object according to a native application format associated with the first object.

Abstract: Provided are a computer program product, system, and method for performing conflict analysis of replicated changes among nodes in a network A first node and a second node include a first instance and second instance of a data set, respectively. The second node receives a first transaction replicated from the first node, applied to the first instance of the data set. The second node determines a conflict that would occur between the replicated first transaction and a second transaction applied to the second instance of the data set. A conflict policy is applied at the second node to perform a first action in response to determining the conflict. The conflict policy is applied to the first node to perform a second action at the first node to handle the conflict when the first node receives a replication of the second transaction to the second instance of the data set.

Abstract: Edge-based recognition systems and methods are presented. Edges of the object are identified from the image data based on co-circularity of edgels, and edge-based descriptors are constructed based on the identified edges. The edge-based descriptors along with additional perception metrics are used to obtain a list of candidate objects matched with the edge-based descriptors. Through various filtering processes and verification processes, false positive candidate objects are further removed from the list to determine the final candidate object.

Abstract: Techniques are disclosed for managing a series of blocks in a distributed system. One embodiment presented herein includes a computer-implemented method, which includes dividing the series of blocks into a plurality of groups. The method further includes distributing the plurality of groups to a plurality of processors. The plurality of processors may apply one or more functions to each group of the plurality of groups in parallel. The method further includes receiving, from the plurality of processors, results of the one or more functions. The method further includes merging the results to generate combined results. The combined results may be used in processing data.

Abstract: Systems for replication group partitioning include a workload profiling module configured to analyze historical workload data for a plurality of data elements to identify and categorize one or more transaction patterns; and a recommendation module configured to generate a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal.

Abstract: Methods and systems for replication group partitioning include analyzing historical workload data for a plurality of data elements to generate one or more transaction patterns and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal.

Abstract: A configuration workstation generates configuration tables representative of applications that each comprise one or more object data structures. Each of the object data structures are linked to one or more staging databases that, in turn, obtain data from one or more standalone data sources. Each of the object data structures comprises at least one property that defines available data for the object data structure. The configuration tables are provided to a controller that obtains data from the staging database(s). The controller also causes the obtained data to be converted to the semantic data format and stored in a semantic database. A web server obtains requested semantic data from the semantic database for at least some of the object data structures for an application. The web server then generates a user interface based on the requested semantic data and provides it to a user device for display.

Abstract: An approach is provided for accessing data in a database. A query which accesses item(s) in the data is received. The query has multiple conditions whose execution produces a final result. Amounts of filtering of portions of the data caused by utilizing different types of indexes to filter the portions are determined. Greatest amounts of filtering for the portions are determined. Types of indexes are selected so that a utilization of a given type of index causes a greatest amount of filtering for a given portion. Data access methods for the portions of data are generated. During runtime, process tasks are generated for the multiple conditions in the query. An execution flow is controlled. The execution flow executes the process tasks by utilizing the data access methods to generate initial results. The final result of the query is generated by combining the initial results from the process tasks.

Abstract: Systems and methods are provided for optimizing displays in one or more user interfaces. An exemplary method may include retrieving web entries from a database and generating a plurality of candidates based on the retrieved web entries, where each web entry of the web entries is a clickable item that is displayed on the one or more user interfaces. Additionally, provide the plurality of candidates for display on the one or more user interfaces and determine click-through rates for each of the plurality of candidates. Thereafter, create a display pool of candidates to display from plurality of candidates based on the click-through rates and update the display pool of candidates responsive to retrieving additional web entries from the database.

Abstract: A method, apparatus, and system for join operations of a plurality of relations that are distributed over a plurality of storage locations over a network of computing components.

Abstract: An interface for requesting, and technique for generation of, a backup of a past state of a database table are provided. Changes made to a database table are accumulated, in durable storage, and snapshots of partitions of the table are obtained. The accumulated changes and the successive partition snapshots are used to generate a past state of the database at any point in time across a continuum between successive snapshots. Although each partition of the table may have a snapshot that was generated at a time different from when other partition snapshots were generated, changes from respective change logs may be selectively log-applied to distinct partitions of a table to generate backup in the past of the entire table at common point-in-time across partitions.

Abstract: A graph processing system for concurrent property graph queries of a property graph implemented in a distributed network computes on respective nodes a subgraph shard represented as edge-sets containing vertices within a certain range. Each node stores data for a subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph. Each subgraph shard also has boundary vertices having edges that connect the subgraph shard to boundary vertices of another subgraph shard. Upon receipt of concurrent queries of the property graph, a query of the subgraph shards is scheduled in accordance with an initial vertex for each concurrent user query. The property graph is traversed by traversing edge-sets within a subgraph shard on each node and during traversal messaging is used to send values of boundary vertices to at least one other node having another subgraph shard sharing the boundary vertices.

Abstract: Techniques are described for analyzing text. Embodiments tokenize a plurality of documents into a plurality of sets of terms. An average top dimension weight corresponding to the plurality of documents is calculated based on performing singular value decomposition (SVD) factorization for a plurality of dimension counts. An average inverse top dimension top term ranking for the plurality of documents is further calculated based on the SVD factorization for the plurality of dimension counts. A number of dimensions is determined based on the average top dimension weight and the average inverse top dimension top term ranking. A topic model is built for the plurality of documents based on the number of dimensions. The topic model is adapted to identify patterns of terms that correspond to semantic topics in at least the plurality of documents.

Abstract: A key-value storage device includes a non-volatile memory and a controller. A method of operating the key-value storage device includes: receiving, from a host, information regarding at least one of a random region, comprising random bits, and a non-random region each included in a key; receiving, from the host, a first command including a first key; generating, based on the received information, a mapping index of a mapping table from first bits, the first bits corresponding to at least some of the random bits included in the first key; and controlling an operation for the non-volatile memory, according to the first command, by using the mapping table.

Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

Abstract: System and method for integrating systems to implement data quality processing. A business rule creation module is configured to create a business rule associated with a business term. A data quality specification module is configured to create a data quality specification based on the business rule. The data quality specification comprises (1) an identity of a column of a table stored in a database comprising data to be tested; (2) a test to perform on the data to be tested; and (3) reference data required to perform the test on the data. A validation module is configured to receive the data quality specification; retrieve data associated with the column from the database; and test the retrieved data in accordance with the test using the reference data. A result publication module is configured to return a result of the test to the data quality specification module.

Abstract: A method includes generating from a time-series dataset multiple corresponding time-slice datasets. Each time-slice dataset has a corresponding time-slice time index and includes field-value data strings and associated field-value-time-index data strings, or pointers indicating the corresponding strings in an earlier time-slice dataset, that are the latest in the time-series dataset that are also earlier than the corresponding time-slice time index. A query of the time-series dataset for latest data records earlier than a given query time index is performed by using the time-slice datasets to reduce or eliminate the need to directly access or interrogate the time-series dataset.

Abstract: Techniques for context sensitive illustrated graphical user interface elements, comprising a social networking application. The social networking application may include, among other components, a social networking graphical elements management component to provide a list of recommended graphical element identifier information, in response to a request for the list of recommended graphical element identifier information, a context determination component to determine user context information representative of the at least one user context based at least partially on user communications intent information, user profile information, device location information, calendar event information, and/or external event information, and a graphical elements recommendation component to generate the list of recommended graphical element identifier information based at least partially on the user profile information, graphical elements promotion information, and/or the user context information.

Abstract: An electronic device associated with a media-providing service has one or more processors and memory storing instructions for execution by the one or more processors. For each track of a plurality of tracks consumed by a user of the media-providing service, the electronic device receives, over a time window, an indication of user selection of the track to compile a listening history of the user and determines, based on the listening history of the user with the media-providing service, whether the track has previously been consumed by the user. The electronic device determines, for the user, a discovery score corresponding to an average preference of the user for selecting previously unconsumed tracks. In response to determining that an amount of use of the media-providing service by the user does not satisfy a use threshold, the electronic device forgoes recommending tracks to the user based on the discovery score.