Abstract: Embodiments of the present disclosure propose an Erasing-based Lossless Floating-point compression method, i.e., Elf. The main idea of Elf is to erase the last few bits (i.e., set them to zero) of floating-point values, so the XORed values are supposed to contain many trailing zeros, where the erased bits are determined based on the decimal place count and the digits on the exponent bits.

Abstract: A method for determining a spatial two-tuple is performed by a computer device. The method comprises: obtaining a given spatial distance and multiple spatial objects, wherein each spatial object belongs to a first spatial object set or belongs to a second spatial object set (101); determining a global area according to a minimum bounding rectangle (MBR) and an extended minimum bounding rectangle (EMBR) corresponding to the first spatial object set and an MBR and an EMBR corresponding to the second spatial object set (102); performing subspace division on the global area to obtain multiple subspaces (103); partitioning the multiple spatial objects according to a positional relationship between each spatial object and each subspace to determine spatial objects comprised in each subspace (104); and according to a spatial distance between the spatial objects of each subspace, determining a spatial two-tuple comprised in each subspace that matches the given spatial distance (105).

Abstract: A spatial join query method and apparatus, an electronic device, and a storage medium. The spatial join query method comprises: obtaining a first resilient distributed dataset of first spatial data and a second resilient distributed dataset of second spatial data; generating multi-tree spatial indexes for spatial partitions, and collecting statistics about spatial distribution information of geometric objects according to the multi-tree spatial indexes to obtain global spatial distribution information; determining an overlapping spatial partition according to the global spatial distribution information; and setting data, in the first spatial data and the second spatial data, corresponding to the overlapping spatial partition as target data, and performing spatial join calculation on the target data.

Abstract: The present disclosure relates to the technical field of computers, and provides a nearest neighbor trajectory query method and apparatus, an electronic device, and a readable storage medium. The nearest neighbor trajectory query method comprises: acquiring a first trajectory to be queried, and determining spatial position information of the first trajectory; generating a trajectory signature according to a positional relationship between the spatial position information of the first trajectory and a region to be queried; determining a spatial position index code of the first trajectory by means of XZ-Ordering; and constructing a spatial range index of the first trajectory according to the trajectory signature and the spatial position index code.

Abstract: Embodiments of the invention relate to a self-adaptive network control transmission method and system based on TCP. By creating network coding layer between transmission layer and IP layer on both the sending and receiving nodes, we can add network-coding headers which contains specific variables in the coding packets and ACK packets, transmit and refresh those variables through network-coding packets and ACK packets, and adjust redundancy factor R according to the variables. This method can strengthen the resistance to burst loss and maintain the redundancy factor R at the optimum value, thus raise the network throughputs.

Abstract: Embodiments of the invention relate to a self-adaptive network control transmission method and system based on TCP. By creating network coding layer between transmission layer and IP layer on both the sending and receiving nodes, we can add network-coding headers which contains specific variables in the coding packets and ACK packets, transmit and refresh those variables through network-coding packets and ACK packets, and adjust redundancy factor R according to the variables. This method can strengthen the resistance to burst loss and maintain the redundancy factor R at the optimum value, thus raise the network throughputs.

Abstract: This invention provides a structure of load-balancing packet switches with minimum buffers complexity and its concomitant methodology. It abandons the VOQ between the first stage and the second stage fabrics, which has no problems of queue delay and packets out-of-sequence. Therefore, this invention solves the packets out-of-sequence problem in load-balancing Birkhoff-von Neumann switching structure and improves the end-to-end throughput. Moreover, it greatly reduces the buffer complexity to O(N).