-
公开(公告)号：US10984029B2
公开(公告)日：2021-04-20
申请号：US15380970
申请日：2016-12-15
Applicant: SAP SE
Inventor： Daniela Maftuleac , Alejandro Lopez-Ortiz , Jeffrey Pound , Alejandro Salinger
Abstract: A bit vector having a bit vector length is accessed. A select operator directory tree can be generated using the bit vector. The select operator directory tree includes a first level of superblocks including large superblocks and small superblocks, a second level of blocks including large blocks and small blocks, each block associated with one of the superblocks, and a third level of sub-blocks, each sub-block associated with a block. The large superblocks each have, a length greater than a first constant that is independent of the bit vector length and the large blocks each have a length greater than a second constant that is independent of the bit vector length. The select operator directory tree can be stored. Related apparatus, systems, techniques and articles are also described.
-
公开(公告)号：US10417208B2
公开(公告)日：2019-09-17
申请号：US15380985
申请日：2016-12-15
Applicant: SAP SE
Inventor： Alejandro Lopez-Ortiz , Daniela Maftuleac , Alejandro Salinger , Jeffrey Pound
IPC: G06F16/22 , G06F16/2455
Abstract: A plus-minus-one array in which adjacent entries vary by no more than positive one and no less than negative one is accessed. A range minimum query directory tree including blocks and subblocks of the plus-minus-one array is determined. Blocks are contained in the plus-minus-one array and subblocks are contained in the blocks. A data structure characterizing positions of minimum elements within the range minimum query directory tree is generated. The characterization includes positions of minimums within each subblock, between subblocks in a respective block, within each block, and between blocks. The data structure is stored. Related apparatus, systems, techniques and articles are also described.
-
公开(公告)号：US20180173738A1
公开(公告)日：2018-06-21
申请号：US15380985
申请日：2016-12-15
Applicant: SAP SE
Inventor： Alejandro Lopez-Ortiz , Daniela Maftuleac , Alejandro Salinger , Jeffrey Pound
IPC: G06F17/30
CPC classification number: G06F16/2237 , G06F16/2246 , G06F16/2455
Abstract: A plus-minus-one array in which adjacent entries vary by no more than positive one and no less than negative one is accessed. A range minimum query directory tree including blocks and subblocks of the plus-minus-one array is determined. Blocks are contained in the plus-minus-one array and subblocks are contained in the blocks. A data structure characterizing positions of minimum elements within the range minimum query-directory tree is generated. The characterization includes positions of minimums within each subblock, between subblocks in a respective block, within each block, and between blocks. The data structure is stored. Related apparatus, systems, techniques and articles are also described.
-
4.发明申请公开(公告)号：US20180173710A1
公开(公告)日：2018-06-21
申请号：US15380970
申请日：2016-12-15
Applicant: SAP SE
Inventor： Daniela Maftuleac , Alejandro Lopez-Ortiz , Jeffrey Pound , Alejandro Salinger
IPC: G06F17/30
CPC classification number: G06F16/3347 , G06F16/2237 , G06F16/322
Abstract: A bit vector having a bit vector length is accessed. A select operator directory tree can be generated using the bit vector. The select operator directory tree includes a first level of superblocks including large superblocks and small superblocks, a second level of blocks including large blocks and small blocks, each block associated with one of the superblocks, and a third level of sub-blocks, each sub-block associated with a block. The large superblocks each have, a length greater than a first constant that is independent of the bit vector length and the large blocks each have a length greater than a second constant that is independent of the bit vector length. The select operator directory tree can be stored. Related apparatus, systems, techniques and articles are also described.
-
-
-
Search Results
4
records
(took 0.011 seconds)
