Abstract: Techniques are disclosed for serializing assertion-triggering transactions by locking special purpose resources (i.e. other than rows or tables), which enables a high level of concurrency for these transactions while at the same time ensuring correctness of the SQL assertion validation code. The techniques involve creating objects referred to therein as “Assertion-Locking Memory-Objects” or “ALMOs”. The database server causes each assertion-triggering transaction to obtain locks on one or more ALMOs prior to determining whether the changes made by assertion-triggering transaction violates the assertion. Because locks on the ALMOs are finer than the table locks, fewer transactions are blocked by ALMO locks.

Abstract: Embodiments are for generating a merged file and identifying distinct portions of the merged file to improve processing efficiency receive at least two data portions to be merged; determine data formats associated with each of the at least two data portions; condition the at least two data portions based on the determined data formats, thereby creating conditioned data portions having a consistent data format; identify cutoffs for each of the conditioned data portions; after identifying cutoffs for each of the conditioned data portions, add the conditioned data portions to one another, thereby creating a merged file having the consistent data format, the merged file configured for efficient use because of ease of consistent data format and identified cutoffs.

Abstract: Examples for graph database query classification include receiving a graph query and determining if the graph query matches benchmark data. In the event that the graph query does not match benchmark data, the query may be parsed, a canonical internal representation of the query may be determined, the representation may be mapped to a rule, and the query may be classified based on the rule. In the event that the confidence score for the query classification does not exceed a threshold, the query may be sent to a synthetic graph or synopsis for simulation. In some examples, the simulation may include selecting computationally expensive graph operators in the query for simulation.

Abstract: Data stream generation using prime numbers is disclosed, including: receiving an initialization parameter; and using the initialization parameter to generate a data stream comprising a merging of a first sequence and a second sequence, wherein the first sequence is generated using a first prime number and the initialization parameter and the second sequence is generated using a second prime number and the initialization parameter.

Abstract: A client identifies a first data unit to be shared from a first file to a second file and sends an operation to copy that indicates the first data unit to be shared. The operation to copy the first data unit from the first file to the second file is received. In response to receiving the operation to copy the first data unit from the first file to the second file, it is determined whether the first data unit can be shared with the second file. In response to determining that the first data unit cannot be shared with the second file, the first data unit is copied to the second file. In response to determining that the first data unit can be shared with the second file, the first data unit is shared between the first file and the second file.

Abstract: Generating a data stream with a predictable change rate is disclosed, including: receiving a change rate parameter; and using the change rate parameter to provide a modified data stream that differs from a corresponding unmodified non-deduplicatable data stream by an amount determined based at least in part on the change rate parameter, including by: modifying at least a portion of a plurality of data blocks associated with the non-deduplicatable data stream to obtain a corresponding portion of the modified data stream, wherein a data block of the plurality of data blocks is associated with a block size that is based on a segmenting attribute associated with a storage destination.

Abstract: Method and apparatus for performing a database query using a bitmap index in a data-base having a plurality of bitmap vectors, the method comprising the steps of: upon receipt of a query containing a selection condition, creating a filter bitmap based on the query input; performing a bitmap scan for the filter bitmap in order to determine at least one value of an existing matching data-base entry; determining a bitmap of the determined at least one value; creating a filtered bitmap by combining the filter bitmap with the bitmap of the determined at least one value; determining all entries in the database matching the filtered bitmap; sub-tracting the filtered bitmap from the filter bitmap, thus creating a new filter bitmap; repeating the steps, starting with the step of performing a bitmap scan based on the new filter bitmap, until the step of sub-tracting results in an empty bitmap.

Abstract: In an example embodiment, a first set of results from first search results are displayed in a user interface. A plurality of facets, including selectable filters, of the first search results are displayed. A sampling scheme is retrieved, with the sampling scheme defining a first sampling rate for a first number of search results and a second sampling rate for a second number of search results. The first search results are traversed using the sampling scheme, sampling search results for the first number of search results at the first sampling rate and sampling search results for the second number of search results at the second sampling rate, for each sampled search result, causing an increase in a facet count for a facet and/or selectable filter having a matching value in the sampled search result. Facet counts for each of the facets and/or selectable filters are displayed in the user interface.

Abstract: In one aspect, the invention is directed to a method of expanding storage for filesystems in a fine-grained, scalable manner. The method includes determining, by a file server, a run bias for a span, wherein the run bias indicates a number of contiguous chunks of memory associated with an entry in an address translation table for a filesystem. The method includes receiving, by the file server, a request for an expansion of memory for the filesystem. The method includes scoring, by the chunk allocator, each stripe set in a group of stripe sets based at least in part on a number of unused chunks on the stripeset and a number of chunks on the stripeset being used by the filesystem. The method includes allocating, by the chunk allocator, a chunk on the stripeset with the highest score, wherein the allocated chunk lies outside of runs reserved for other filesystems.

Abstract: Techniques are described herein for computing columnar information during join enumeration in a database system. The computation occurs in two phases: the first phase involves a pre-computational phase that is only run once per query block to initialize and prepare a set of data structures. The second phase is an incremental approach that takes place for every query sub-plan. Upon completion of the second phase, the generated projected attributes of a query sub-plan are associated as columnar information associated with the query sub-plan, and used to compute the query execution cost. Subsequently, based on the computed query execution cost, the query sub-plan may be executed as part of the query execution plan.

Abstract: Various embodiments virtualize data across heterogeneous formats. In one embodiment, a plurality of heterogeneous data sources is received as input. A local schema graph including a set of attribute nodes and a set of type nodes is generated for each of the plurality of heterogeneous data sources. A global schema graph is generated based on each local schema graph that has been generated. The global schema graph comprises each of the local schema graphs and at least one edge between at least one of two or more attributes nodes and two or more type nodes from different local schema graphs. The edge indicates a relationship between the data sources represented by the different local schema graphs comprising the two or more attributes nodes based on a computed similarity between at least one value associated with each of the two or more attributes nodes.

Abstract: A system and method for generating modifiers for updated search queries are provided. In example embodiments, metadata is accessed, the metadata corresponds to search results of an input query and comprising a plurality of candidate modifiers. A score is calculated for each candidate based on a relevance value that indicates the correlation between a candidate modifier and the input query. A list of top number of candidate modifiers is generated based on the score of the candidate modifier transgressing a first threshold. A uniqueness score is calculated for combination pairs of candidate modifiers within the list, the uniqueness score being used to eliminate candidate modifiers. The list of top number of candidate modifiers is presented, at a user interface, according to a ranked order based on the score.

Abstract: Backup file path determination is described. A request is input from a source device to access a backup file on a storage device. One or more paths to the backup file are output to the source device. A determination whether the backup file is accessible to the source device via a path of the one or more paths is enabled. Access to the backup file is enabled via the path if the backup file is accessible to the source device via the path.

Abstract: Systems and methods for managing individuals are provided. A method includes recording interactions of a user with one or more computer-implemented applications and calculating parameter values for the user for a plurality of user attributes based on the interactions. The method can further include determining whether at least a portion of the parameter values are missing or conflicting and in response to determining wherein at least a portion of the parameter values are missing or conflicting, prompting the user to interact with at least one additional computer-implemented application that is associated with the portion of the parameter values. After the prompting, the method can include repeating the recording and the calculating to update the parameter values.

Abstract: A method for updating a column store database and includes establishing a row store database, wherein each row comprises a plurality of attributes. The method includes establishing a column store database including attribute vectors corresponding to at least one attribute in the row store, wherein each attribute vector includes data used to satisfy at least one of previously received analytic queries. The method includes collecting a SQL change statements beginning from a synchronization point indicating when the row store database and the column store database are synchronized, and continuing until an analytic query is received. The method includes sending the plurality of SQL change statements to the column store database upon receipt of the analytic query for updating the column store database for purposes of satisfying the query, wherein the analytic query is directed to a queried range of primary key attributes in the plurality of attributes.

Abstract: Systems, methods and/or software for identifying relevancy and trending among multiple messages in a social networking context. Topics that are of interest and/or relevant to a user are classified based on factors including frequency and trending behavior. Alert indicators, such as color-coded “sparklines” are generated and displayed close to the associated messages, to attract appropriate levels of attention from the user. The alert indicators are regularly updated to reflect trending changes, in near real time, as they occur.

Abstract: A method includes identifying a first table including data. The first table has associated metadata, an associated replication state, an associated replication log file including replication logs logging mutations of the first table, and an associated replication configuration file including a first association that associates the first table with a replication family. The method includes inserting a second association in the replication configuration file that associates a second table having a non-loadable state with the replication family. The association of the second table with the replication family causes persistence of any replication logs in the replication log file that correspond to any mutations of the first table during the existence of the second table. The method further includes generating a third table from the first table, the metadata associated with the first table, and the associated replication state of the first table.

Abstract: A clinical data aggregation system and method, comprising ingesting, transforming and storing data in a clinical data lake. The present invention uses an Extract Load and Transform (ELT) rather than traditional Extract Transform and Load (ETL) design principle. The data hub platform leverages modern noSQL databases which makes the platform highly flexible to configure studies with any design complexity with relative ease.

Abstract: In one implementation, a data transformation engine is employed to analyze an incoming JSON schema syntax and use a “best effort” model to convert a plurality of JSON schemas to other types of schemas such as an XML schema. The model is configured to be adaptable and dynamic in order to convert as much of the JSON as possible. In addition, the conversion tool is configured to transform schemas to other technologies and allow for conversion errors within one or more error thresholds. Further, the system may be distributed standalone with no dependencies to other implementations, such as BPM implementations.

Abstract: Described are embodiments of an invention for prioritizing data items for backup in a computing environment. The computing environment includes a plurality of clients coupled through a network to a backup system for backing up items stored locally on the client. Each client includes a continuous data protection (CDP) module that prioritizes the order of files transmitted to the backup system for storage on one or more storage devices based on policy. The CDP module builds an initial backup list and a CDP backup list. The initial backup list includes any item that meets the criteria of the initial backup profile. The CDP backup list includes items that have been modified since the initial backup process began. The data that is the most critical to a user is often the most recently modified data. Thus, the CDP module preferentially performs a backup of items on the CDP backup list.