Abstract: Seed patterns are derived from a sequence database. Execution costs for types of seed patterns are computed. Each seed pattern is iteratively distributed to distributed nodes along with that seed pattern's assigned execution cost. The distributed nodes processing in parallel to mine the sequence database for super patterns found in the sequence database. When a distributed node exhausts its execution budget, any remaining mining needed for the seed pattern being mined is reallocated to another distributed node having remaining execution budget.

Abstract: A computer program product for searching a repository of binary uninterpretted data, according to one embodiment, includes a computer readable storage medium having program instructions executable by a computer to cause the computer to perform a method comprising: analyzing, by the computer, segments of each of the repository and input data to determine a repository segment that is similar to an input segment, the analyzing including searching an index of representation values of the repository data for matching representation values of the input in a time independent of a size of the repository and linear in a size of the input data; and analyzing, by the computer, the similar repository segment with respect to the input segment to determine their common data sections while utilizing at least some of the matching representation values for data alignment, in a time linear in a size of the input segment.

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 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: The disclosed subject matter includes systems, methods, and computer readable medium for improving performance of a computer data system. An electronic request for a remote query processor (RQP) can be sent from the persistent query controller to a remote query dispatcher (RQD) executing on a query server computer. The request can include parameters for configuring the RQP and an operating environment for the RQP. The RQD can automatically attempt to allocate an isolated operating environment for the RQP and to prepare the RQP on the query server computer. When the RQP is prepared, performing: providing the controller with an address assignment of the RQP; automatically connecting from the controller to the RQP via a network; transmitting a persistent database query electronically from the controller to the RQP; publishing persistent database query configuration information including a query state and the RQP address assignment; and connecting from a client to the RQP.

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.

Abstract: A method of generating synthetic data from a model of a dataset comprises the steps of receiving a model of a dataset, extracting information from the received model, constructing a database view from the extracted information, receiving a query to the constructed database view, and generating synthetic data from the constructed database view according to the received query.

Abstract: Systems and methods for reclaiming and reusing primary key values are provided. According to one embodiment, multiple unused primary key values of a database application are reclaimed by a key generator by locating a gap in a sequence of a primary key column of the database application. Reuse of the reclaimed unused primary key values is facilitated by the key generator by returning a reclaimed unused primary key value responsive to a request from the database system for a new primary key value for the primary key column.

Abstract: A technique for performing overwrites on shared data blocks in a file system transfers reference weights of block pointers to other block pointers that share those data blocks. To overwrite a portion of a file stored in a shared data block pointed to by a first block pointer, a file system manager locates a second block pointer in the file system that points to the same data block. The first block pointer has a first reference weight, and the second block pointer has a second reference weight. The file system manager transfers the first reference weight to the second block pointer, e.g., by replacing the second reference weight with the sum of the first reference weight and the second reference weight.

Abstract: Social media content items are mapped to relevant time-based media events. These mappings may be used as the basis for multiple applications, such as ranking of search results for time-based media, automatic recommendations for time-based media, prediction of audience interest for media purchasing/planning, and estimating social interest in the time-based media. Social interest in time-based media (e.g., video and audio streams and recordings) segments is estimated through a process of data ingestion and integration. The estimation process determines social interest in specific events represented as segments in time-based media, such as particular plays in a sporting event, scenes in a television show, or advertisements in an advertising block. The resulting estimates of social interest also can be graphically displayed.

Abstract: A computer system includes a first database system that includes a plurality of tables, and a second database system that includes a subset of the tables in the first database system. The system identifies a plurality of reports that are currently generated using the second database system. The system also identifies a plurality of reports that are not currently generated using the second database system, but that are capable of being generated using the second database system, and displays a list of these reports on a computer display device. In an embodiment, the system further replicates one or more tables that are required for generation of additional reports from the first database system to the second database system.

Abstract: A facility for managing filesystem object storage quotas (i.e., size limits) in a storage environment is disclosed. The facility enables users to establish, modify, and remove quotas on directories and files within a filesystem. Each quota acts as a soft limit on the size of the associated filesystem object, including any child objects of the filesystem object. The facility improves the speed at which the system can test for and identify violations of quotas established for individual filesystem objects by using aggregation and reconciliation techniques rather than constantly traversing a filesystem in its entirety to test for violations of quotas.

Abstract: A query generator is operable to generate a query for retrieving data that satisfy a conditional expression from a database, and/or perform an arbitrary calculation on at least part of the retrieved data. The query generator can receive an input query and analyze the query to ascertain whether it contains a replaceable token. If the query contains a replaceable token, the query generator can replace that token with user input specifying a parameter of the conditional expression and/or the arbitrary calculation, thereby generating an output query for retrieving the data that satisfy the conditional expression and/or performing the arbitrary calculation on the retrieved data.