A data sorting method, apparatus and device, a storage medium, and a program product. The method includes: obtaining a data sorting and updating request, where the data sorting and updating request includes data to be updated and an update type; determining a current cursor node, according to the data sorting and updating request, from a circular doubly linked list corresponding to a binary heap storing original data and according to pointing of the current cursor node pointer; determining a node to be updated corresponding to the data to be updated in the binary heap according to the update type and the current cursor node; and performing updating and sorting operations on the original data according to the node to be updated and the data to be updated.

Aspects of the present disclosure provide for operations of a key-value tree data structure that merges key-value pair data of a node, in a key-value tree data structure using counter values.

A data sorting method, apparatus and device, a storage medium, and a program product. The method includes: obtaining a data sorting and updating request, where the data sorting and updating request includes data to be updated and an update type; determining a current cursor node, according to the data sorting and updating request, from a circular doubly linked list corresponding to a binary heap storing original data and according to pointing of the current cursor node pointer; determining a node to be updated corresponding to the data to be updated in the binary heap according to the update type and the current cursor node; and performing updating and sorting operations on the original data according to the node to be updated and the data to be updated.

Aspects of the present disclosure provide for operations of a key-value tree data structure that: merge key-value sets within a given node by merging and rewriting key blocks of the key-value sets while rewriting or deferring rewrite of value blocks of the merged key-value sets based on whether one or more child nodes of the given node comprise a leaf node; and move one or more portions of the merged key-value set into one or more child nodes of the given node.

Aspects of the present disclosure provide for operations of a key-value tree data structure that merges key-value pair data of a node, in a key-value tree data structure using counter values.

Aspects of the present disclosure provide for operations of a key-value tree data structure that merges key-value pair data of a node, in a key-value tree data structure using counter values.

Techniques for time-correlated ink are described. According to various embodiments, ink input is correlated to content. For instance, ink input received during playback of a video is timestamped. According to various embodiments, ink input displayed over content is removed after input ceases. Further, ink input is displayed during playback of the portion of content to which the ink input is time correlated.

A feed handler is configured to receive a transaction entry from a data feed, the transaction entry indicating at least a floating-point value amount, the data feed associated with a transaction target. The feed handler modifies a locally stored priority queue based on the transaction entry by converting the floating-point value amount in transaction entry to an integer value amount based on a ratio between two underlying components indicated by the transaction target; and storing the integer value amount in a corresponding entry in the locally stored priority queue.

Aspects of the present disclosure provide for operations of a key-value tree data structure that merges key-value pair data of a node, in a key-value tree data structure using counter values.

Aspects of the present disclosure provide for operations of a key-value tree data structure that: merge key-value sets within a given node by merging and rewriting key blocks of the key-value sets while rewriting or deferring rewrite of value blocks of the merged key-value sets based on whether one or more child nodes of the given node comprise a leaf node; and move one or more portions of the merged key-value set into one or more child nodes of the given node.