An electronic apparatus and a method for reducing the number of commands are provided. The electronic apparatus includes a central processor and a co-processor. The central processor generates a plurality of original register setting commands to set at least one bit of at least one register of the co-processor. The original register setting commands include a plurality of first original register setting commands, and a plurality of setting targets of the first original register setting commands have address continuity. The central processor merges the first original register setting commands to generate at least one merged register setting command. The central processor transmits the at least one merged register setting command to the co-processor.

A unique method for determining and assigning, from a grouping of individuals or objects (“rankers”), each of these rankers into a specific entity, from a grouping of entities (“ranked entities”) having varying sized capacities (“capacities”), based upon or using each ranker's assigned preference, listed from most preferential to least preferential, to each of the ranked entities (“entry”), where the total number of rankers is equal to or less than the sum of the capacities for all the ranked entities; provided that, the numbers of rankers who prefer specific ranked entities are larger than the capacities of those specific ranked entities.

A unique method for determining and assigning, from a grouping of individuals or objects (“rankers”), each of these rankers into a specific entity, from a grouping of entities (“ranked entities”) having varying sized capacities (“capacities”), based upon or using each ranker's assigned preference, listed from most preferential to least preferential, to each of the ranked entities (“entry”), where the total number of rankers is equal to or less than the sum of the capacities for all the ranked entities; provided that, the numbers of rankers who prefer specific ranked entities are larger than the capacities of those specific ranked entities.

In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.

In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.

Disclosed are an information output method and apparatus. One specific implementation of the method comprises: acquiring order data to be sorted; determining whether items to be sorted matching the order data to be sorted are stored in a shelf set; in response to having determined that items to be sorted matching the order data to be sorted are stored in the shelf set, determining, from the shelf set, a shelf storing an item to be sorted, and adding same to a candidate shelf set; choosing a candidate shelf from the candidate shelf set and adding same to a target shelf set, where the target shelf set stores the items to be sorted matching the order data; and outputting an identifier of a target shelf in the target shelf set.

Disclosed are an information output method and apparatus. One specific implementation of the method comprises: acquiring order data to be sorted; determining whether items to be sorted matching the order data to be sorted are stored in a shelf set; in response to having determined that items to be sorted matching the order data to be sorted are stored in the shelf set, determining, from the shelf set, a shelf storing an item to be sorted, and adding same to a candidate shelf set; choosing a candidate shelf from the candidate shelf set and adding same to a target shelf set, where the target shelf set stores the items to be sorted matching the order data; and outputting an identifier of a target shelf in the target shelf set.

Multi-cycle key compare units. A compare unit includes a comparator, additional compare logic and at least one pair of buffers which provide input to the comparator. The compare unit sorts variable length records in streaming mode without the need for complex state machines to maintain state relating to the comparing. A record may have a variable length key and optional variable length data. The record and/or the key is split into fixed, pre-defined lengths. The total key and record lengths are unknown to the comparator of the compare unit.

Multi-cycle key compare units. A compare unit includes a comparator, additional compare logic and at least one pair of buffers which provide input to the comparator. The compare unit sorts variable length records in streaming mode without the need for complex state machines to maintain state relating to the comparing. A record may have a variable length key and optional variable length data. The record and/or the key is split into fixed, pre-defined lengths. The total key and record lengths are unknown to the comparator of the compare unit.

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.