Abstract: A database export system exports data using a plurality of nodes that process the data to generate structured result files that are partitioned by an export parameter in an export request. The database export system distributes the data and merges the files to avoid small file creation and increase processing speed via parallelism. The database export system generates the result files of a specified maximum size in a final format, where the files are processed merged in a temporary file format. The parallel processing is optimized and constrained per the amount of processing nodes, available memory, requested final file sizes, and operation based ordering to complete data exports in a scalable multi-stage approach.

Abstract: Provided are image search system and methods. The image search system may include a query engine for reconfiguring a search query based on a description and an attribute of a sketch query that is input to a query image; a search engine for extracting image data that matches the search query from a database; and a display apparatus for displaying the extracted image data.

Abstract: A database system processes database queries that process external tables representing data obtained from an external systems. The database system generates an execution plan to execute the database query. The database system sends a request for data of the external table to an external system. The request provides connection information to the external system. The external system sends a request to connect to the database system and provides data of the external table as a data stream. If the database system reaches an operator that processes the data of the external table, the database system waits for data from the external system. The database system processes the database query using the data of the data stream. The database system provides the result of the database query to a requestor, for example, a client device.

Abstract: System and method for associating user-entered consumable item description to an entry in a consumable item database. In one embodiment, formally structured restaurant menu item is matched to a large database of food items that has been constructed via crowd-sourcing. A novel, practical, and scalable machine learning solution architecture, consisting of two major steps is utilized. First a query generation approach is applied, based on a Markov Decision Process algorithm, to reduce the time complexity of searching for matching candidates. That is then followed by a re-ranking step, using deep learning techniques, to ensure matching quality goals are met.

Abstract: The subject technology receives a notification that a modification has been made to an external table, the modification comprising inserting at least one row of new data to the external table, the at least one row corresponding to a first micro-partition that includes a first portion of data from the external table prior to the inserting. The subject technology, in response to the notification indicating the modification to the external table, generates a new micro-partition different from the first micro-partition, the new micro-partition including the inserted at least one row of new data and the first portion of data from the external table. The subject technology generates a refreshed materialized view based at least in part on the generated new micro-partition such that the refreshed materialized view comprises a representation of the external table after the modification has been made.

Abstract: Methods of the invention include representing biological data in a memory subsystem within a computer system with a data structure that is particular to a location in the memory subsystem and serializing the data structure into a stream of bytes that can be deserialized into a clone of the data structure. In a preferred genomic embodiment, the biological data comprises genomic sequences and the data structure comprises a genomic directed acyclic graph (DAG) in which objects have adjacency lists of pointers that indicate the location of any object adjacent to that object. After serialization and deserialization, the clone genomic DAG has the same structure as the original to represent the same sequences and relationships among them as the original.

Abstract: Techniques are disclosed relating to a database system synchronizing a current state of the database system among a plurality of nodes configured to handle requests for data of the database system stored in a distributed storage with one of the plurality of nodes being currently active and the other nodes of the plurality of nodes being currently standby nodes. In various embodiments, the active node receives a request to perform a transaction that includes committing data to the distributed storage. In response to receiving the request, in some embodiments, the active node commits the data to the distributed storage to update the current state of the database system and causes storing of metadata that provides an indication of the commitment in a transaction log stored in the distributed storage.

Abstract: Incremental inline journaling in a journaled file system can be utilized to facilitate concurrency and throughput of a journaled file system. In an example, a request can be received for a transaction to modify a sub-block portion of a file stored in a distributed storage system. In response to that, the modification can be allocated to a data structure in a journal of the distributed storage system. After the transaction commits, a current value of the sub-block portion of the file can be saved to the delta structure. Then, a new value corresponding to the request for the transaction to modify the sub-block portion of the file can be written to the metadata block. After writing the new value to the metadata block, a memory space used to store the delta structure can be freed.

Abstract: One or more techniques and/or computing devices are provided for data synchronization. For example, an in-flight log may be maintained to track storage operations that are received by a first storage node, but have not been committed to both first storage of the first storage node and second storage of a second storage node that has a replication relationship, such as a disaster recovery relationship, with the first storage node. A dirty region log may be maintained to track regions within the first storage that have been modified by storage operations that have not been replicated to the second storage. Accordingly, a catchup synchronization phase (e.g., asynchronous replication by a resync scanner) may be performed to replicate storage operations (e.g., replicate data within dirty regions of the first storage that were modified by such storage operations) to the second storage until the first storage and the second storage are synchronized.

Abstract: A computer-implemented method, computerized apparatus and computer program product for query performance prediction, the method comprising: obtaining a result list comprising a listing of documents retrieved from a collection in response to a query; obtaining for each of the listed documents in the result list a score indicating a measure of the document's relevance to the query; sampling the result list to obtain a plurality of sub-lists each of which comprising a listing of documents subsumed by the result list; for each of the plurality of sub-lists, analyzing scores of the documents listed therein to obtain a sample performance estimator; and estimating performance of the result list based on the sample performance estimator of each of the plurality of sub-lists.

Abstract: A size of a metadata-based system snapshot is determined based on performing incremental calculations in background mode to assure accurate size reporting without producing considerable workload. Snapshot sizes are relative to each other. For example, a size of a first snapshot is set when a second snapshot is generated. Moreover, a size of the latest snapshot is relative to a current tree version and a size of an older snapshot is relative to a snapshot that follows it. An aggregated size of all system snapshots can be determined by adding the individual snapshot sizes. This provides simplicity during snapshot management.

Abstract: Example storage systems and methods provide data storage management using change values in a key data store. A key data store includes a set of key data entries that each include a key value associated with a storage operation, a precondition value, and a postcondition value. A storage parameter is calculated using the precondition value and the postcondition value for each key data entry the set of key data entries. The calculated storage parameter may be reported to manage storage configuration and operations in the storage system.

Abstract: This specification describes techniques for managing assets in a blockchain. One example method includes receiving, from a target user recorded in a distributed database of a blockchain network, a user input including a request to transfer a plurality of asset objects including digital assets corresponding to physical assets associated with the target user, in response to receiving the request, combining the plurality of asset objects in a target object, the target object including an address field used to maintain address information of the plurality of asset objects, deleting address information corresponding to the plurality of asset objects from the target object, and adding the address information to asset receiving objects corresponding to the plurality of asset objects.

Abstract: The method includes receiving, by one or more computer processors, data that includes at least one of audio data, video data, and optical data. The method further includes identifying, by one or more computer processors, keywords from the received data. The method further includes generating, by one or more computer processes, Internet search terms based upon the identified keywords. In some embodiments, the method further includes searching the Internet based upon the generated Internet search terms.

Abstract: Providing a private data exchange is described. An example computer-implemented method can include providing a data exchange by a cloud computing service on behalf of an entity. The data exchange may comprise several data listings provided by one or more data providers. The data listings reference one or more data sets stored in a data storage platform associated with the cloud computing service. The method may also include designating a data exchange administrator account of the data exchange. The data exchange administrator account may be associated with the entity and may be capable of: granting and denying requests from data consumers to access the data exchange; and granting and denying requests from data providers to publish data listings on the data exchange.

Abstract: A data processing method comprises receiving a request to perform a prior period adjustment (PPA) for a tenant in which data values applicable to a time period earlier than a current time period will be modified, in response to the request, identifying a working subset of data from tenant data in the production database and copying the working subset to a calculation database separate from the production database, performing the PPA, using the working subset in the calculation database, to result in creating and storing a plurality of result data, receiving, while performing the PPA, an additional request using the tenant data in the production database, performing the additional request using the tenant data in the production database while performing the PPA and updating the replay log, after completing the PPA and using the replay log, transferring the plurality of results to the production database.

Abstract: A information management system allows a user to search through a secondary copy of data, such as a back up, archive, or snapshot without first retrieving the secondary copy of data. Instead, the system constructs lightweight data that can be displayed to a user as a representation of the search results. Lightweight data may include metadata or other information that identifies data included in the secondary copy of data. The lightweight data may be perceived as being the secondary copy of data and allow a user to browse through search results. Once the user identifies a search result that is of interest, information in the lightweight data can be used to retrieve the secondary copy of data. Because lightweight data may have a smaller file size than the file size of the secondary copy of data, the latency of performing a search may be reduced.

Abstract: According to certain aspects, a client computing system can be configured to map stored database data into a plurality of second data units having a second level of granularity larger than first data units; store a mapping of the second data units to the first data units; monitor writes to the database data by the database application; identify of the writes changed first data units of the first data units which have changed as a result of the writes; use the mapping to identify changed second data units of the second data units which each include at least one of the changed first data units; maintain a table listing the changed second data units; and in response to instructions to create a secondary copy of the database data, consult the table to identify the changed second data units, and forward the changed second data units to secondary storage controller computer(s).

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating metadata-based statistics-oriented query processing for large datasets in an on-demand services environment. In one embodiment and by way of example, a method comprises evaluating metadata associated with a query placed on behalf of a tenant in a multi-tenant environment, and computing process statistics for the query based on the metadata, where the process statistics reveal an estimation of resources needed for execution of the query within a predictable amount of time and using fewer than or equal to an allocated number of scans of a database. The method may further include associating, based on the process statistics, a set of rules and the estimated resources to process the query, and executing the query based on the set of rules and using the estimated resources such that the query is processed within the predictable amount of time and using fewer than or equal to the allocated number of scans of the database.

Abstract: Aspects of the present disclosure include a system comprising a computer-readable storage medium storing at least one program and computer-implemented methods for providing suggestions of additional input to users entering user input into a data input field. In some embodiments, the method includes receiving initial user input entered via a data input field of a user interface rendered on a client device, and identifying a dominant category corresponding to the initial user input. The method further includes identifying a set of aspects corresponding to the dominant category, and selecting, from the set of aspects, a set of aspect suggestions based on a ranking of each aspect in the set of aspects. The method further includes causing display of a suggestion box presented in conjunction with the data input field. The suggestion box comprises a presentation of the set of aspect suggestions.