Social Based Layouts for the Increase of Locality in Graph Operations
Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy. Here, we propose layou...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 569 |
|---|---|
| container_issue | |
| container_start_page | 558 |
| container_title | |
| container_volume | |
| creator | Prat-Pérez, Arnau Dominguez-Sal, David Larriba-Pey, Josep L. |
| description | Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy.
Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that improves the performance of graph algorithms consistently over other state of the art strategies. |
| doi_str_mv | 10.1007/978-3-642-20149-3_40 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>csuc_sprin</sourceid><recordid>TN_cdi_csuc_recercat_oai_recercat_cat_2072_195462</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_recercat_cat_2072_195462</sourcerecordid><originalsourceid>FETCH-LOGICAL-c240t-c8b782064b6e338e359e97b177682000f2d96dd956394f2f91b1a6b15414c8d93</originalsourceid><addsrcrecordid>eNpFkMtOwzAQRc1LopT-AQv_gGH8iB9LqKBUitQFsLYcx6GBKq7sdNG_x21BjDQazb1zZ3EQuqNwTwHUg1GacCIFIwyoMIRbAWfohhflKMA5mlBJKeFcmAs0K_d_npaXaAIcGDFK8Gs0y_kLSlW8klpM0PNb9L3b4CeXQ4trt4-7MeMuJjyuA14OPoXi4NjhOnq36cc97ge8SG67xqttSG7s45Bv0VXnNjnMfucUfbw8v89fSb1aLOePNfFMwEi8bpRmIEUjA-c68MoEoxqqlCwyQMdaI9vWVJIb0bHO0IY62dBKUOF1a_gU0dNfn3fepuBD8m600fX_y6EZKGapqYRkJcNOmbxN_fAZkm1i_M6Wgj3AtQWW5bbgskeW9gCX_wA5MGXA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Social Based Layouts for the Increase of Locality in Graph Operations</title><source>Springer Books</source><source>Recercat</source><creator>Prat-Pérez, Arnau ; Dominguez-Sal, David ; Larriba-Pey, Josep L.</creator><contributor>Kim, Myoung Ho ; Yu, Jeffrey Xu ; Unland, Rainer</contributor><creatorcontrib>Prat-Pérez, Arnau ; Dominguez-Sal, David ; Larriba-Pey, Josep L. ; Kim, Myoung Ho ; Yu, Jeffrey Xu ; Unland, Rainer</creatorcontrib><description>Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy.
Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that improves the performance of graph algorithms consistently over other state of the art strategies.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783642201486</identifier><identifier>ISBN: 3642201482</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3642201490</identifier><identifier>EISBN: 9783642201493</identifier><identifier>DOI: 10.1007/978-3-642-20149-3_40</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Bandwidth ; Community detection ; Graph mining ; Informàtica ; Sistemes d'informació ; Àrees temàtiques de la UPC</subject><ispartof>Database Systems for Advanced Applications, 2011, p.558-569</ispartof><rights>Springer-Verlag Berlin Heidelberg 2011</rights><rights>info:eu-repo/semantics/openAccess</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-642-20149-3_40$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-642-20149-3_40$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,775,776,780,789,881,26953,27904,38234,41421,42490</link.rule.ids></links><search><contributor>Kim, Myoung Ho</contributor><contributor>Yu, Jeffrey Xu</contributor><contributor>Unland, Rainer</contributor><creatorcontrib>Prat-Pérez, Arnau</creatorcontrib><creatorcontrib>Dominguez-Sal, David</creatorcontrib><creatorcontrib>Larriba-Pey, Josep L.</creatorcontrib><title>Social Based Layouts for the Increase of Locality in Graph Operations</title><title>Database Systems for Advanced Applications</title><description>Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy.
Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that improves the performance of graph algorithms consistently over other state of the art strategies.</description><subject>Bandwidth</subject><subject>Community detection</subject><subject>Graph mining</subject><subject>Informàtica</subject><subject>Sistemes d'informació</subject><subject>Àrees temàtiques de la UPC</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783642201486</isbn><isbn>3642201482</isbn><isbn>3642201490</isbn><isbn>9783642201493</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>XX2</sourceid><recordid>eNpFkMtOwzAQRc1LopT-AQv_gGH8iB9LqKBUitQFsLYcx6GBKq7sdNG_x21BjDQazb1zZ3EQuqNwTwHUg1GacCIFIwyoMIRbAWfohhflKMA5mlBJKeFcmAs0K_d_npaXaAIcGDFK8Gs0y_kLSlW8klpM0PNb9L3b4CeXQ4trt4-7MeMuJjyuA14OPoXi4NjhOnq36cc97ge8SG67xqttSG7s45Bv0VXnNjnMfucUfbw8v89fSb1aLOePNfFMwEi8bpRmIEUjA-c68MoEoxqqlCwyQMdaI9vWVJIb0bHO0IY62dBKUOF1a_gU0dNfn3fepuBD8m600fX_y6EZKGapqYRkJcNOmbxN_fAZkm1i_M6Wgj3AtQWW5bbgskeW9gCX_wA5MGXA</recordid><startdate>2011</startdate><enddate>2011</enddate><creator>Prat-Pérez, Arnau</creator><creator>Dominguez-Sal, David</creator><creator>Larriba-Pey, Josep L.</creator><general>Springer Berlin Heidelberg</general><scope>XX2</scope></search><sort><creationdate>2011</creationdate><title>Social Based Layouts for the Increase of Locality in Graph Operations</title><author>Prat-Pérez, Arnau ; Dominguez-Sal, David ; Larriba-Pey, Josep L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c240t-c8b782064b6e338e359e97b177682000f2d96dd956394f2f91b1a6b15414c8d93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Bandwidth</topic><topic>Community detection</topic><topic>Graph mining</topic><topic>Informàtica</topic><topic>Sistemes d'informació</topic><topic>Àrees temàtiques de la UPC</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Prat-Pérez, Arnau</creatorcontrib><creatorcontrib>Dominguez-Sal, David</creatorcontrib><creatorcontrib>Larriba-Pey, Josep L.</creatorcontrib><collection>Recercat</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Prat-Pérez, Arnau</au><au>Dominguez-Sal, David</au><au>Larriba-Pey, Josep L.</au><au>Kim, Myoung Ho</au><au>Yu, Jeffrey Xu</au><au>Unland, Rainer</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Social Based Layouts for the Increase of Locality in Graph Operations</atitle><btitle>Database Systems for Advanced Applications</btitle><date>2011</date><risdate>2011</risdate><spage>558</spage><epage>569</epage><pages>558-569</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783642201486</isbn><isbn>3642201482</isbn><eisbn>3642201490</eisbn><eisbn>9783642201493</eisbn><abstract>Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy.
Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that improves the performance of graph algorithms consistently over other state of the art strategies.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-642-20149-3_40</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Database Systems for Advanced Applications, 2011, p.558-569 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_csuc_recercat_oai_recercat_cat_2072_195462 |
| source | Springer Books; Recercat |
| subjects | Bandwidth Community detection Graph mining Informàtica Sistemes d'informació Àrees temàtiques de la UPC |
| title | Social Based Layouts for the Increase of Locality in Graph Operations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T17%3A40%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-csuc_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Social%20Based%20Layouts%20for%20the%20Increase%20of%20Locality%20in%20Graph%20Operations&rft.btitle=Database%20Systems%20for%20Advanced%20Applications&rft.au=Prat-P%C3%A9rez,%20Arnau&rft.date=2011&rft.spage=558&rft.epage=569&rft.pages=558-569&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783642201486&rft.isbn_list=3642201482&rft_id=info:doi/10.1007/978-3-642-20149-3_40&rft_dat=%3Ccsuc_sprin%3Eoai_recercat_cat_2072_195462%3C/csuc_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3642201490&rft.eisbn_list=9783642201493&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |