Abstract: Upon receiving a query at a local database server from a client directed to a LOB stored at a remote database server, a remote LOB locator is created comprising a local LOB locator indicating the LOB's location and a database link associated with the remote database server. The remote LOB locator is communicated to the client, which submits a request to the local database server to perform an operation directed to the LOB. The request is forwarded to the remote database server using the remote LOB locator, where the operation is performed. This mechanism is extended to work with sharded databases. Character set conversions are minimized when returning data to the client from the remote database server. Remote LOB locators may serve as bind variables for DML statements directed to local or remote tables. Local LOB locators may serve as bind variables for DML statements directed to remote tables.

Abstract: Implementations include querying metadata of data objects to define a sub-set of data objects, each data object in the sub-set of data objects including a generic text field and/or an attachment field, and, for each data object in the sub-set of data objects, processing historical data of a data object to identify a set of data types, the historical data stored within a field of a table of a database system, providing a recommendation for a first extension corresponding to a first data type, and receiving user input indicating acceptance of the recommendation for the first extension and, in response, automatically providing extension code that is executable to add a field extension to the table and to modify a UI of an application for input of values corresponding to the first data type, and executing the extension code to deploy the extension and to modify the UI.

Abstract: A memory management system implements instructions including maintaining multiple pool data structures, each associated with a linked list of objects and including a head pointer pointing to the first element in the linked list. The instructions include, in response to a first object no longer being needed, recycling the first object by identifying a first pool data structure that corresponds to the first object and inserting the first object into the linked list without deallocating the memory for the first object. The instructions include, in response to a new object request, identifying a second pool data structure according to a feature of the new object. If the corresponding linked list is empty, memory is allocated for the new object and the new object is assigned to the second pool data structure. If the linked list is not empty, the first object is removed from the linked list and returned.

Abstract: Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

Abstract: A system and method builds functions into a web page sourced by a primary server and that would otherwise report to a set of one or more other servers actions performed by users of the web page when they interact with its elements so that the interactions instead report to the user of the web page. The system and method then causes the browser to simulate such interactions with all such web page elements, thereby causing the functions to report the information that would have been sent to the other server, and an identifier of the other server.

Abstract: A query engine or compute engine receiving a query request identifies a plurality of data sources for satisfying a query request, and determines, from among multiple data sources, one or more fields likely to incur substantial computational demands in processing the query request. Pre-positioning aggregation logic moves the determined fields one data source to another data source for positioning the moved fields to a single data source from which the query result will be computed.

Abstract: Decentralized deduplication operations in a computer system employ a hash index that is a variant of a B+ tree to support both efficient sequential updates as well as efficient random updates. Sequential update is selected when deduplication is infrequently performed, such as on the order of days, and random update is selected when deduplication is performed more frequently, such as on the order of seconds. More frequent deduplication may be beneficial during periods when large amounts of temporary duplicate data are created, and the system may not have enough storage space to accommodate the temporary spike in demand.

Abstract: Method, system and computer readable storage medium for transmitting content from an SCM version of a repository maintained by an SCM system to a corresponding search engine (SE) version of the repository maintained by a search engine system. The method includes generating a content request, the content request comprising information defining a start state of the SCM version of the repository and a filter field; identifying one or more files in the SCM version of the repository that have changed between the start state and an end state; filtering the identified files based on the filter field in the content request to form a filtered set of files and a removed set of files; extracting content and metadata for one or more files from the filtered set of files; and transmitting the extracted content to the search system for storage as part of the search system version of the repository.

Abstract: A method for processing requests, the method comprising: receiving, from a client application node and by a metadata node, a request for a data layout, determining a QoS tag associated with the request, identifying at least one file system block (FSB) in a sparse virtual space, wherein the FSB is mapped to a location in a storage pool that is associated with the QoS tag, generating the data layout based on the at least one identified FSB; and providing the data layout to the client application, wherein the client application node uses the data layout to directly write data to the location in the storage pool, wherein the metadata node does not participate in the writing of the data to the location in the storage pool.

Abstract: Aspects of the disclosure relate to joining data tables. A computing platform may input two or more tables into a statistical join function, which may initiate execution of the statistical join function, and where executing the statistical join function comprises applying one or more of: an end condition function, a partition tables function, or an outer join function to generate a new table that includes information from the two or more tables. The computing platform may send, to a user device, the new table and one or more commands directing the user device to display the new table, which may cause the user device to display the new table.

Abstract: A system, program product, and method for enhancing automatic multidimensional query processing. The method includes executing a database query including semi-joining a plurality of dimension tables with a fact table. The method also includes identifying for extraction one or more data values from each dimension table of the plurality of dimension tables. The data values from each dimension table of the plurality of dimension tables are associated with a respective record identification (RID), thereby defining one or more RIDs. The method further includes generating a plurality of RID lists. Each RID list of the plurality of RID lists includes a collection of the one or more RIDs for the respective dimension table. The method also includes merging the plurality of RID lists, sorting, subject to the merging, the plurality of RIDs as a function of data location, and fetching the data values from the fact table.

Abstract: Systems and methods for determining and rewarding accuracy in predicting user-provided ratings of content provided by other users are disclosed.

Abstract: Systems, methods, and software can be used to cluster software codes in a scalable manner. In some aspects, a computer-implemented method comprises: obtaining a plurality of software samples; computing one or more first hash results for each of the plurality of software samples; computing one or more second hash results for each of the plurality of software samples based on the one or more first hash results, wherein an amount of the one or more second hash results is less than an amount of the one or more first hash results; determining a similarity output based on the one or more second hash results of two of the plurality of software samples; and clustering the plurality of software samples based on the similarity output to generate one or more software sample clusters.

Abstract: Systems, methods, and computer media are described for index-based join size estimation. For a join operation between two tables, a filter is applied to the first table, resulting in a filter output. The filter output is then sampled. For each sample, an index for a second table is accessed and counts of records in the second table that match the sample are retrieved. Using the sample size and the retrieved counts from the index of the second table, a data size for the join operation can be efficiently and accurately estimated. Statistical confidence in the estimate can also be assessed using variance-based calculations.

Abstract: Described is hard link handling when a directory snapshot exists that includes the hard link's connected file object. A hard link is created by allocating a virtual inode number for the hard link, with the virtual inode number mapped to a real inode number that identifies a real inode of the file object; the hard link is assigned weight. A total weight associated with the real inode is increased by the hard link weight, and a hard link data store is updated with an entry for the hard link. Upon receiving data write request to the hard link, weight data determines that the file object is shared as a result of the snapshot; the hard link is disassociated from the real inode file, and associated with a new real inode number and new real inode of a new file object. The data is written based on the new real inode.

Abstract: A first direct index lookup table represents the current state of a storage object using entries with references corresponding to tracks of the storage object. A second direct index lookup table represents a first targetless snapshot of the storage object. A virtual replication data pointer table maps the entries of both the first direct index lookup table and the entries of the second direct index lookup table to backend storage via a system replication data pointer table. Updates to the storage object are represented using new entries in the first direct index lookup table and the system replication data pointer table. Movement of a track that is represented in multiple targetless snapshots that are represented by multiple direct index lookup tables is represented by updating the corresponding virtual replication data pointer table and system replication data pointer table rather than updating each of the direct index lookup tables.

Abstract: A system includes reception of a query execution plan associated with a plurality of query execution pipelines, estimated execution costs and estimated intermediate result cardinalities, determination of one or more precedence relationships of the plurality of query execution pipelines, determination of an execution order of the plurality of query execution pipelines based on the estimated execution costs, the estimated intermediate result cardinalities, and the one or more precedence relationships, and providing of the execution order of the plurality of query execution pipelines and the query execution plan to a query execution engine.

Abstract: Methods, systems, apparatuses, and computer program products are provided for coordinating a distributed database transaction. A transaction driver, such as a client machine, may initiate a distributed transaction. The transaction driver may transmit to a transaction coordinator a driver report that includes identifying information related to the distributed transaction, including an identification of participants involved in the transaction. The coordinator may determine whether participant reports, which include a status of the portion of the distributed database transaction of a particular participant, are received from each of the participants. Participant reports may also identify participants that are descendants of the reporting participant. The transaction coordinator may store, in a table, information to track the progress of the distributed transaction. Using the table, an outcome of the distributed transaction may be determined and transmitted to one or more of the involved participants.

Abstract: Systems and methods for composite storage of data across tiers of a multi-tenant storage device are provided. In embodiments, a method includes determining attributes associated with each query in a set of queries; determining whether each of the attributes meet respective predetermined threshold values for a first storage tier, a second storage tier and a third storage tier based on statistical data generated for the attributes; updating storage rules for at least one of the first storage tier, the second storage tier and the third storage tier based on the determining; receiving data from the tenant for storage; dividing the data into at least a first portion and a second portion based on the storage rules; and storing the at least the first portion and the second portion on separate ones of the first storage tier, the second storage tier and the third storage tier based on the storage rules.

Abstract: The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.