Abstract: A method is provided. The method includes in response to a new query or new input data being input, calculating a required minimum number of cycles per unit time which corresponds to the minimum number of cycles per unit time that is required to process the new query or the new input data, selecting a query to execute first, calculating the number of cycles to be processed during the time period set in advance by multiplying the calculated, required minimum number of cycles per unit time with a time period that is allocated to process the selected query or the input data and is set in advance, and putting a system into a dormant state for a remaining period of time in response to the calculated number of cycles being completely executed within the time period set in advance.

Abstract: The apparatuses and methods described herein may operate to identify, from an index structure stored in memory, a reference minimum bounding shape that encloses at least one minimum bounding shape. Each of the at least one minimum bounding shape may correspond to a data object associated with a leaf node of the index structure. Coordinates of a point of the at least one minimum bounding shape may be associated with a set of first values to produce a relative representation of the at least one minimum bounding shape. The set of first values may be calculated relative to coordinates of a reference point of the reference minimum bounding shape such that each of the set of first values comprises a first number of significant bits fewer than a second number of significant bits representing a second value associated with a corresponding one of absolute coordinates of the point.

Abstract: A scheme for accessing an index structure using a reference minimum bounding shape is disclosed. In one example embodiment, a reference minimum bounding shape that encloses two or more minimum bounding shapes may be identified from an index structure stored in memory. Each of the two or more minimum bounding shapes may correspond to a data object associated with a corresponding leaf node of the index structure. In one example embodiment, the index structure may be accessed using the reference minimum bounding shape. In one example embodiment, at least one minimum bounding shape of the two or more minimum bounding shapes may be represented in a relative representation calculated relative to the reference minimum bounding shape. Also disclosed are a method, a system and a non-transitory computer-readable storage medium for accomplishing the same scheme as described above.

Abstract: A scheme for accessing an index structure using a reference minimum bounding shape is disclosed. In one example embodiment, a reference minimum bounding shape that encloses two or more minimum bounding shapes may be identified from an index structure stored in memory. Each of the two or more minimum bounding shapes may correspond to a data object associated with a corresponding leaf node of the index structure. In one example embodiment, the index structure may be accessed using the reference minimum bounding shape. In one example embodiment, at least one minimum bounding shape of the two or more minimum bounding shapes may be represented in a relative representation calculated relative to the reference minimum bounding shape. Also disclosed are a method, a system and a non-transitory computer-readable storage medium for accomplishing the same scheme as described above.

Abstract: A scheme for accessing a multi-dimensional index structure resident in main memory to refer to data objects stored in a database is disclosed. To reduce the amount of accessed index data, the scheme compresses a minimum bounding rectangle (“MBR”). The first step to compress the MBR is to represent the MBR relatively to a reference MBR. The relative representation of an MBR (“RMBR”) is coordinates of the MBR represented relative to coordinates of the reference MBR. In addition, quantization may be performed as an additional step for further compression. In this step, the RMBR is quantized using a finite level of quantization chosen from a given set of quantization levels. Alternatively, a proper node size can be chosen to reduce the index search time.

Abstract: A scheme for accessing a multi-dimensional index structure resident in main memory to refer to data objects stored in a database is disclosed. To reduce the amount of accessed index data, the scheme compresses a minimum bounding rectangle (“MBR”). The first step to compress the MBR is to represent the MBR relatively to a reference MBR. The relative representation of an MBR (“RMBR”) is coordinates of the MBR represented relative to coordinates of the reference MBR. In addition, quantization may be performed as an additional step for further compression. In this step, the RMBR is quantized using a finite level of quantization chosen from a given set of quantization levels. Alternatively, a proper node size can be chosen to reduce the index search time.

Abstract: A cache-conscious version of the R-tree, called the CR-tree, is disclosed. To pack more entries in a node, the CR-tree compresses MBR keys, which occupy substantial part of the index data. It first represents the coordinates of an MBR key relatively to the lower left corner of its parent MBR to eliminate the leading 0's from the relative coordinate representation. Then, it quantizes the relative coordinates with a fixed number of bits to further cut off the trailing less significant bits. Consequently, the CR-tree becomes significantly wider and smaller than the ordinary R-tree. The experimental and analytical results show that the two-dimensional CR-tree performs search faster than the ordinary R-tree while maintaining similar update performance and consuming less memory space.

Abstract: A cache-conscious version of the R-tree, called the CR-tree, is disclosed. To pack more entries in a node, the CR-tree compresses MBR keys, which occupy substantial part of the index data. It first represents the coordinates of an MBR key relatively to the lower left corner of its parent MBR to eliminate the leading 0's from the relative coordinate representation. Then, it quantizes the relative coordinates with a fixed number of bits to further cut off the trailing less significant bits. Consequently, the CR-tree becomes significantly wider and smaller than the ordinary R-tree. The experimental and analytical results show that the two-dimensional CR-tree performs search faster than the ordinary R-tree while maintaining similar update performance and consuming less memory space.