{"id":20150,"date":"2024-04-08T09:18:55","date_gmt":"2024-04-08T09:18:55","guid":{"rendered":"https:\/\/www.writemyessays.app\/blog\/questions\/overview-of-techniques-for-partitioning-historical-graphs-in-distributed-environments-only-the-theoretical-part\/"},"modified":"2024-04-08T09:18:55","modified_gmt":"2024-04-08T09:18:55","slug":"overview-of-techniques-for-partitioning-historical-graphs-in-distributed-environments-only-the-theoretical-part","status":"publish","type":"questions","link":"https:\/\/www.writemyessays.app\/blog\/questions\/overview-of-techniques-for-partitioning-historical-graphs-in-distributed-environments-only-the-theoretical-part\/","title":{"rendered":"Overview of techniques for partitioning historical graphs in distributed environments (only the theoretical part)"},"content":{"rendered":"<p>Historical graphs (historical graphs\/ evolving graphs) are graphs that aim to store all historical information in order to make later questions about its evolution. The different times in a historical graph are called snapshots. As the graph evolves, different snapshots have different topology making it more difficult to have a universal structure for efficient partitioning of the graph across different machines [1]. The approaches that have been applied so far involve temporal partitioning, topological partitioning or partitioning based on hash functions. Objectives: to investigate existing techniques for efficient partitioning of a historical graph and to compare them. Finding which applications are most efficient (node-centric, snapshot-based, time-centric systems).<\/p>\n<div>What is asked is to find the existing techniques for efficient partitioning of a historical graph to make a comparison and in which applications they are most efficient. The research piece will be done by me so I ask only bibliographic piece. I have additional papers available as a bibliography to be provided later.<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Historical graphs (historical graphs\/ evolving graphs) are graphs that aim to store all historical information in order to make later questions about its evolution. The different times in a historical graph are called snapshots. As the graph evolves, different snapshots have different topology making it more difficult to have a universal structure for efficient partitioning [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","template":"","meta":[],"disciplines":[63],"paper_types":[],"tagged":[],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/questions\/20150"}],"collection":[{"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/questions"}],"about":[{"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/types\/questions"}],"author":[{"embeddable":true,"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/comments?post=20150"}],"version-history":[{"count":0,"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/questions\/20150\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/media?parent=20150"}],"wp:term":[{"taxonomy":"disciplines","embeddable":true,"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/disciplines?post=20150"},{"taxonomy":"paper_types","embeddable":true,"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/paper_types?post=20150"},{"taxonomy":"tagged","embeddable":true,"href":"https:\/\/www.writemyessays.app\/blog\/wp-json\/wp\/v2\/tagged?post=20150"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}