FAST CIRCULAR DATABASE
    1.
    发明申请

    公开(公告)号:US20170177636A1

    公开(公告)日:2017-06-22

    申请号:US14975287

    申请日:2015-12-18

    CPC classification number: G06F16/2264 G06F16/2255 G06F16/2477

    Abstract: A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube.

    Fast circular database
    2.
    发明授权

    公开(公告)号:US11681678B2

    公开(公告)日:2023-06-20

    申请号:US17569352

    申请日:2022-01-05

    CPC classification number: G06F16/2264 G06F16/2255 G06F16/2477

    Abstract: A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube.

    FAST CIRCULAR DATABASE
    3.
    发明申请

    公开(公告)号:US20220129434A1

    公开(公告)日:2022-04-28

    申请号:US17569352

    申请日:2022-01-05

    Abstract: A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube.

    Fast circular database
    4.
    发明授权

    公开(公告)号:US11232087B2

    公开(公告)日:2022-01-25

    申请号:US16908527

    申请日:2020-06-22

    Abstract: A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube.

    FAST CIRCULAR DATABASE
    5.
    发明申请

    公开(公告)号:US20200320052A1

    公开(公告)日:2020-10-08

    申请号:US16908527

    申请日:2020-06-22

    Abstract: A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube.

    Fast circular database
    6.
    发明授权

    公开(公告)号:US10740309B2

    公开(公告)日:2020-08-11

    申请号:US14975287

    申请日:2015-12-18

    Abstract: A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube.

Patent Agency Ranking