Temporal graph analytics on persistent memory
AssigneeIntel Corporation
InventorsJoana Matos Fonseca da Trindade, Jawad Khan, Sanjeev Trika
Life of this patent
Estimating the term…
Abstract
Systems, apparatuses and methods may provide for technology that includes a single server to store a portion of a temporal graph to a first memory of the single server, and store a second portion of the temporal graph to a second memory of the single server, wherein an access rate of the first memory is greater than an access rate of the second memory, and wherein a capacity of the second memory is greater than a capacity of the first memory. The single server may also retrieve vertices of the second portion in response to a selectivity of an input query exceeding a cost model threshold.
Claims17
A single server comprising:
- a network controller;
- a processor coupled to the network controller;
- and
- a memory structure coupled to the processor, the memory structure including a first memory and a second memory, wherein an access rate of the first memory is greater than an access rate of the second memory, and wherein a capacity of the second memory is greater than a capacity of the first memory, the memory structure further including a set of instructions, which when executed by the processor, cause the processor to:
- store a first portion of a temporal graph to the first memory;
- generate index data for one or more vertices of the temporal graph in response to a degree of the one or more vertices exceeding a degree threshold;
- organize the index data into a heap in a first dimension and a binary search tree in a second dimension;
- incorporate the index data into a second portion of the temporal graph;
- and
- store the second portion of the temporal graph to the second memory.
At least one non-transitory computer readable storage medium comprising a set of instructions, which when executed by a single server, cause the single server to:
- store a first portion of a temporal graph to a first memory of the single server;
- generate index data for one or more vertices of the temporal graph in response to a degree of the one or more vertices exceeding a degree threshold;
- organize the index data into a heap in a first dimension and a binary search tree in a second dimension;
- incorporate the index data into a second portion of the temporal graph;
- and
- store the second portion of the temporal graph to a second memory of the single server, wherein an access rate of the first memory is greater than an access rate of the second memory, and wherein a capacity of the second memory is greater than a capacity of the first memory.
A semiconductor apparatus comprising:
- one or more substrates;
- and
- logic coupled to the one or more substrates, wherein the logic is implemented at least partly in one or more of configurable or fixed-functionality hardware, the logic to:
- store a first portion of a temporal graph to a first memory of a single server;
- generate index data for one or more vertices of the temporal graph in response to a degree of the one or more vertices exceeding a degree threshold;
- organize the index data into a heap in a first dimension and a binary search tree in a second dimension;
- incorporate the index data into a second portion of the temporal graph;
- and
- store the second portion of the temporal graph to a second memory of the single server, wherein an access rate of the first memory is greater than an access rate of the second memory, and wherein a capacity of the second memory is greater than a capacity of the first memory.
A method comprising:
- storing a first portion of a temporal graph to a first memory of a single server;
- generating index data for one or more vertices of the temporal graph in response to a degree of the one or more vertices exceeding a degree threshold;
- organizing the index data into a heap in a first dimension and a binary search tree in a second dimension
- incorporating the index data into a second portion of the temporal graph;
- and
- storing the second portion of the temporal graph to a second memory of the single server, wherein an access rate of the first memory is greater than an access rate of the second memory, and wherein a capacity of the second memory is greater than a capacity of the first memory.
Dependencies are inferred from the claim text.