G06F7/36

Method and apparatus for processing join query
11030196 · 2021-06-08 · ·

A method and apparatus for processing join query is disclosed. The method includes: determining a frequent table combination whose emergence frequency in a historical query record is greater than a preset value, and the table combination includes a join key and tables that are joined by using the join key; creating a clustered index according to information about the join key in the frequent table combination; and performing a shuffle operation according to an index column in the clustered index, and saving records that have a same index column value into at least one data block to form a table cluster corresponding to the frequent table combination.

Electronic template generation, data extraction and response detection

A file receiver receives an electronic structure file that includes structure-file data associated with a spatial arrangement and detects a content object for processing that includes content-object data. A file transformation engine transforms the structure-file data from the structure file into an electronic record. A rendering engine renders an image of the transformed structure-file data arranged in the spatial arrangement. An interface engine detects an input corresponding to specification of a position of a data segment. A parsing engine defines a segment-position specification indicative of the position. A template engine generates an electronic template that associates an identifier of the data segment with the segment-position specification and associates the electronic template with a template identifier. A record classifier determines that the content object corresponds to the template identifier. The parsing engine further extracts, using the segment-position specification, a portion of the content-object data that corresponds to the data segment.

Trading off cache space and write amplification for B.SUP.ε.-trees

Certain aspects provide systems and methods for performing an operation on a B.sup.ε-tree. A method comprises writing a message associated with the operation to a first slot in a first buffer of a first non-leaf node of the B.sup.ε-tree in an append-only manner, wherein a first filter associated with the first slot is used for query operations associated with the first slot. The method further comprises determining that the first buffer is full and, upon determining to flush the message to a non-leaf child node, flushing the message in an append-only manner to a second slot in a second buffer of the non-leaf child node, wherein a second filter associated with the second slot is used for query operations associated with the second slot. The method further comprises, upon determining to flush the message to a leaf node, flushing the message to the leaf node in a sorted manner.

MERGING MULTIPLE SORTED LISTS IN A DISTRIBUTED COMPUTING SYSTEM
20210141602 · 2021-05-13 ·

A technique is described for merging multiple lists of ordinal elements such as keys into a sorted output. In an example embodiment, a merge window is defined, based on the bounds of the multiple lists of ordinal elements, that is representative of a portion of an overall element space associated with the multiple lists. Lists of elements to be sorted can be placed into one of at least two different heaps based on whether they overlap the merge window. For example, lists that overlap the merge window may be placed into an active or hot heap, while lists that do not overlap the merge window may be placed into a separate inactive or cold heap. A sorted output can then be generated by iteratively processing the active heap. As the processing of the active heap progresses, the merge window advances, and lists may move between the active and inactive heaps.

SYSTEM AND METHOD FOR STORING MULTIMEDIA RESOURCES

A system and a method for storing a multimedia resource are provided. The method may include determining a time slice of the multimedia resource having a specified format in real time. The method may further include storing the multimedia resource to a corresponding file based on a corresponding relation between the time slice and a preset time slice.

Positional indexing for a tiered data storage system

The system and methods disclosed herein relate to an improvement in automated data tiering technology. The systems and methods disclosed herein enhance database storage performance characteristics in myriad ways. First, the speed with which data can be relocated from one tier to another in a tiered data storage system is increased by reducing the number of sort cycles required to perform data relocation. In addition, data relocation among the tiers is performed on the backend by an offload engine, which results in uninterrupted access to read/write commands within the data storage system from a user's perspective on the frontend. Third, users are able to adjust the percentages of hot or cold data that are relocated within the database without having to alter the service level agreements. In this way, users can make spontaneous changes to performance characteristics related to the promotion and demotion of data stored within a tiered data storage system.

Positional indexing for a tiered data storage system

The system and methods disclosed herein relate to an improvement in automated data tiering technology. The systems and methods disclosed herein enhance database storage performance characteristics in myriad ways. First, the speed with which data can be relocated from one tier to another in a tiered data storage system is increased by reducing the number of sort cycles required to perform data relocation. In addition, data relocation among the tiers is performed on the backend by an offload engine, which results in uninterrupted access to read/write commands within the data storage system from a user's perspective on the frontend. Third, users are able to adjust the percentages of hot or cold data that are relocated within the database without having to alter the service level agreements. In this way, users can make spontaneous changes to performance characteristics related to the promotion and demotion of data stored within a tiered data storage system.

MOBILE USER INTERFACE FOR DISPLAYING HETEROGENEOUS ITEMS INTERLEAVED BY COMMON DATA TYPE
20210048927 · 2021-02-18 ·

An embodiment may involve: transmitting a first graphical user interface (GUI) that allows selection of a plurality of item streams for a mobile user interface; receiving a selection of a first item stream; transmitting a second GUI, where the first item stream is populated from a first database table and the second GUI allows selection of a first field from the first database table; receiving a selection of a second item stream; transmitting the second GUI, where the second item stream is populated from a second database table and the second GUI allows selection of a second field from the second database table, where the first and second fields are of a common type; and transmitting, to a mobile device, the mobile user interface with items from the first and second item streams sorted according to values in the first and second fields.

IDENTIFYING AN APPROPRIATE CONTACT ACROSS COLLABORATIVE APPLICATIONS
20210064607 · 2021-03-04 ·

A computer-implemented method, system and computer program product for identifying an appropriate contact across collaborative applications. Contact information is collected from monitored messages, communication lists and contact lists in each collaborative application. Contact records are generated based on the collected contact information, where such records are inserted into a contact list. After receiving a query from a user containing a keyword(s) that include a nickname (or portion thereof) of a second user whom the user desires to interact via the current collaborative application, a search is performed in the contact list for any record containing a nickname that is similar to the provided keyword(s). Record(s) in the contact list containing a nickname that exceeds a threshold degree of similarity as the keyword(s) are identified. Such identified records may contain a user identifier which is used to identify the appropriate nickname of the second user associated with the current collaborative application.

GENERATING FILE USAGE INFORMATION

Embodiments relate to systems and methods for tracking local and remote file usage, and aggregating the resulting file usage statistics for presentation to a user. The operating system of a local computer can cause presentation of a merged list of unified file usage information, wherein the merged list of unified file usage information comprises a first representation of the local file associated with local file usage information and a second representation of a Web application file associated with remote file usage information from a remote network host. The operating system can further receive a selection of at least one of the local file or the Web application file from the merged list of unified file usage information, determine, using saved preference information, a default application with which to open the at least one of the local file or the Web application file, and, responsive to a request, open the at least one of the local file or the Web application file with an application other than the default application.