iTri: Index-based triangle listing in massive graphs
Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive graphs such as social networks because these graphs cannot be accommodated in the memory. Thus, external memory-based algorithms have been propos...
Gespeichert in:
| Veröffentlicht in: | Information sciences Jg. 336; S. 1 - 20 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.04.2016
|
| Schlagworte: | |
| ISSN: | 0020-0255, 1872-6291 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive graphs such as social networks because these graphs cannot be accommodated in the memory. Thus, external memory-based algorithms have been proposed recently, but these approaches still require frequent multiple scans of the whole graph on the disk and large volumes of calculations are performed that involve the whole graph during every iteration. In this study, we propose a novel index-based method for listing triangles in massive graphs. First, we present new notions for the vertex range index and potential cone vertex index. Next, we propose an index join-based triangle listing algorithm. Our method accesses the indexed data asynchronously and joins them to list triangles using a multi-threaded parallel processing technique. Based on experiments, we demonstrate that our algorithm outperforms the state-of-the-art solution methods by three to eight times in terms of the wall clock time. |
|---|---|
| AbstractList | Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive graphs such as social networks because these graphs cannot be accommodated in the memory. Thus, external memory-based algorithms have been proposed recently, but these approaches still require frequent multiple scans of the whole graph on the disk and large volumes of calculations are performed that involve the whole graph during every iteration. In this study, we propose a novel index-based method for listing triangles in massive graphs. First, we present new notions for the vertex range index and potential cone vertex index. Next, we propose an index join-based triangle listing algorithm. Our method accesses the indexed data asynchronously and joins them to list triangles using a multi-threaded parallel processing technique. Based on experiments, we demonstrate that our algorithm outperforms the state-of-the-art solution methods by three to eight times in terms of the wall clock time. |
| Author | Park, Kisung Rasel, Mostofa Kamal Han, Yongkoo Kim, Jinseung Tu, Nguyen Anh Lee, Young-Koo |
| Author_xml | – sequence: 1 givenname: Mostofa Kamal surname: Rasel fullname: Rasel, Mostofa Kamal email: rasel@khu.ac.kr – sequence: 2 givenname: Yongkoo surname: Han fullname: Han, Yongkoo email: ykhan@khu.ac.kr – sequence: 3 givenname: Jinseung surname: Kim fullname: Kim, Jinseung email: jinseungk@khu.ac.kr – sequence: 4 givenname: Kisung surname: Park fullname: Park, Kisung email: kspark224@khu.ac.kr – sequence: 5 givenname: Nguyen Anh surname: Tu fullname: Tu, Nguyen Anh email: tunguyen@khu.ac.kr – sequence: 6 givenname: Young-Koo orcidid: 0000-0003-2314-5395 surname: Lee fullname: Lee, Young-Koo email: yklee@khu.ac.kr |
| BookMark | eNp9kD1PwzAURS1UJNrCD2DLyJLgZ8dOAxOq-KhUiaXMluO8lFelTrHTCv49qcrE0OlKT_c86Z4JG_nOI2O3wDPgoO83GfmYCQ4qA5Fxri_YGGaFSLUoYcTGnAuecqHUFZvEuOGc54XWY5bTKtBDsvA1fqeVjVgnfSDr1y0mLcWe_Dohn2xtjHTAZB3s7jNes8vGthFv_nLKPl6eV_O3dPn-upg_LVMnJe9TaZsKUJQ55KVsSmWtLKSqK2GhVrap80Y5zht5vCqtGlFVqphJIUoHTmiUU3Z3-rsL3dceY2-2FB22rfXY7aOBYqZB5TMohiqcqi50MQZszC7Q1oYfA9wcDZmNGQyZoyEDwgyGBqb4xzjqbU-d74Ol9iz5eCJxWH8gDCY6Qu-wpoCuN3VHZ-hfVZSBOw |
| CitedBy_id | crossref_primary_10_1109_TBDATA_2018_2889120 crossref_primary_10_1109_ACCESS_2018_2878032 crossref_primary_10_1007_s10619_023_07437_x crossref_primary_10_1016_j_ins_2018_02_018 crossref_primary_10_1587_transinf_2018EDP7421 crossref_primary_10_3390_s22249894 |
| Cites_doi | 10.1145/48529.48535 10.1145/2691190.2691193 10.1137/0214017 10.1016/j.disc.2005.09.051 10.1016/j.tcs.2008.07.017 10.1073/pnas.012582999 10.14778/1921071.1921073 10.1145/128762.128764 10.1145/152610.152611 10.1145/2382577.2382581 10.1137/140964801 10.1038/30918 10.1561/0400000014 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Inc. |
| Copyright_xml | – notice: 2015 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ins.2015.12.006 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| EISSN | 1872-6291 |
| EndPage | 20 |
| ExternalDocumentID | 10_1016_j_ins_2015_12_006 S0020025515008956 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADGUI ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SDP SES SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ WH7 XPP ZMT ~02 ~G- 1OL 29I 77I 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO ADVLN AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HLZ HVGLF HZ~ H~9 R2- SBC SDS SEW UHS WUQ YYP ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-3afb1e2941493f95aa3735db2a1d5afd4f5c00f33735565f2bb5783229c1c26e3 |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000370102500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Sun Sep 28 05:37:01 EDT 2025 Tue Nov 18 21:54:59 EST 2025 Sat Nov 29 06:24:59 EST 2025 Fri Feb 23 02:33:57 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Graph indexing CPU parallelism Triangle listing I/O-efficient algorithm Graph mining |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-3afb1e2941493f95aa3735db2a1d5afd4f5c00f33735565f2bb5783229c1c26e3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0003-2314-5395 |
| PQID | 1786154817 |
| PQPubID | 23500 |
| PageCount | 20 |
| ParticipantIDs | proquest_miscellaneous_1786154817 crossref_primary_10_1016_j_ins_2015_12_006 crossref_citationtrail_10_1016_j_ins_2015_12_006 elsevier_sciencedirect_doi_10_1016_j_ins_2015_12_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-04-01 2016-04-00 20160401 |
| PublicationDateYYYYMMDD | 2016-04-01 |
| PublicationDate_xml | – month: 04 year: 2016 text: 2016-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Information sciences |
| PublicationYear | 2016 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Schank, Wagner (bib0029) 2005 Chu, Cheng (bib0007) 2011 Newman, Watts, Strogatz (bib0024) 2002; 99 Eppstein, Goodrich, Strash, Trott (bib0010) 2010 Tangwongsan, Pavan, Tirthapura (bib0031) 2013 Jha, Seshadhri, Pinar (bib0017) 2015; 9 Twitter, Twitter statistics, Mar 2015, url Mishra, Eich (bib0023) 1992; 24 Wang, Zhang, Tan, Tung (bib0034) 2010; 4 Björklund, Pagh, Williams, Zwick (bib0004) 2014 Park, Chung (bib0026) 2013 Hu, Tao, Chung (bib0015) 2014; 39 Itai, Rodeh (bib0016) 1977 Korth, Silberschatz (bib0019) 1986 Watts, Strogatz (bib0036) 1998; 393 Kim, Han, Lee, Park, Yu (bib0018) 2014 Pavan, Tangwongan, Tirthapura (bib0028) 2013 Vitter (bib0033) 2008; 2 Fomin, Todinca, Villanger (bib0012) 2015; 44 Park, Silvestri, Kang, Pagh (bib0027) 2014 May (bib0022) 2001 Hu, Tao, Chung (bib0014) 2013 Aggarwal, Vitter, Jeffrey (bib0001) 1988; 31 Wasserman (bib0035) 1994; vol. 8 Batagelj, Zaveršnik (bib0002) 2007; 307 Chu, Cheng (bib0008) 2012; 6 Buriol, Frahling, Leonardi, Marchetti-Spaccamela, Sohler (bib0005) 2006 Pagh, Silvestri (bib0025) 2014 . Latapy (bib0020) 2008; 407 DeWitt, Naughton, Burger (bib0009) 1993 Facebook, Facebook statistics, Jun 2015, url Becchetti, Boldi, Castillo, Gionis (bib0003) 2008 Chiba, Nishizeki (bib0006) 1985; 14 Lim, Kang (bib0021) 2015 Graefe (bib0013) 1993; 25 Shun, Tangwongsan (bib0030) 2015 Chu (10.1016/j.ins.2015.12.006_bib0007) 2011 Hu (10.1016/j.ins.2015.12.006_bib0014) 2013 Fomin (10.1016/j.ins.2015.12.006_bib0012) 2015; 44 Itai (10.1016/j.ins.2015.12.006_bib0016) 1977 May (10.1016/j.ins.2015.12.006_bib0022) 2001 Wasserman (10.1016/j.ins.2015.12.006_bib0035) 1994; vol. 8 Eppstein (10.1016/j.ins.2015.12.006_bib0010) 2010 Hu (10.1016/j.ins.2015.12.006_bib0015) 2014; 39 Mishra (10.1016/j.ins.2015.12.006_bib0023) 1992; 24 Jha (10.1016/j.ins.2015.12.006_bib0017) 2015; 9 Vitter (10.1016/j.ins.2015.12.006_bib0033) 2008; 2 Wang (10.1016/j.ins.2015.12.006_bib0034) 2010; 4 Björklund (10.1016/j.ins.2015.12.006_bib0004) 2014 Chiba (10.1016/j.ins.2015.12.006_bib0006) 1985; 14 Pagh (10.1016/j.ins.2015.12.006_bib0025) 2014 Park (10.1016/j.ins.2015.12.006_bib0026) 2013 Lim (10.1016/j.ins.2015.12.006_bib0021) 2015 Newman (10.1016/j.ins.2015.12.006_bib0024) 2002; 99 Tangwongsan (10.1016/j.ins.2015.12.006_bib0031) 2013 Becchetti (10.1016/j.ins.2015.12.006_bib0003) 2008 Chu (10.1016/j.ins.2015.12.006_bib0008) 2012; 6 Kim (10.1016/j.ins.2015.12.006_bib0018) 2014 Aggarwal (10.1016/j.ins.2015.12.006_bib0001) 1988; 31 10.1016/j.ins.2015.12.006_bib0011 10.1016/j.ins.2015.12.006_bib0032 Shun (10.1016/j.ins.2015.12.006_bib0030) 2015 Buriol (10.1016/j.ins.2015.12.006_bib0005) 2006 Schank (10.1016/j.ins.2015.12.006_bib0029) 2005 Latapy (10.1016/j.ins.2015.12.006_bib0020) 2008; 407 Watts (10.1016/j.ins.2015.12.006_bib0036) 1998; 393 Batagelj (10.1016/j.ins.2015.12.006_bib0002) 2007; 307 Graefe (10.1016/j.ins.2015.12.006_bib0013) 1993; 25 Pavan (10.1016/j.ins.2015.12.006_bib0028) 2013 DeWitt (10.1016/j.ins.2015.12.006_bib0009) 1993 Korth (10.1016/j.ins.2015.12.006_bib0019) 1986 Park (10.1016/j.ins.2015.12.006_bib0027) 2014 |
| References_xml | – volume: 14 start-page: 210 year: 1985 end-page: 223 ident: bib0006 article-title: Arboricity and subgraph listing algorithms publication-title: SIAM J. Comput. – start-page: 1 year: 1977 end-page: 10 ident: bib0016 article-title: Finding a minimum circuit in a graph publication-title: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing (STOC ’77) – year: 1986 ident: bib0019 publication-title: Database System Concepts – volume: 407 start-page: 458 year: 2008 end-page: 473 ident: bib0020 article-title: Main-memory triangle computations for very large (sparse (power-law)) graphs publication-title: Theor. Comput. Sci. – volume: 25 start-page: 73 year: 1993 end-page: 169 ident: bib0013 article-title: Query evaluation techniques for large databases publication-title: ACM Comput. Surv. – volume: 31 start-page: 1116 year: 1988 end-page: 1127 ident: bib0001 article-title: The input/output complexity of sorting and related problems publication-title: Commun. ACM – start-page: 253 year: 2006 end-page: 262 ident: bib0005 article-title: Counting triangles in data streams publication-title: Proceedings of the Twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS ’06) – start-page: 781 year: 2013 end-page: 786 ident: bib0031 article-title: Parallel triangle counting in massive streaming graphs publication-title: Proceedings of the Twenty-second ACM international Conference on Information and Knowledge Management – start-page: 230 year: 1993 end-page: 242 ident: bib0009 article-title: Nested loops revisited publication-title: Proceedings of the Second International Conference on Parallel and Distributed Information Systems – reference: Twitter, Twitter statistics, Mar 2015, url: – start-page: 672 year: 2011 end-page: 680 ident: bib0007 article-title: Triangle listing in massive networks and its applications publication-title: Proceedings of the Seventeenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’11) – start-page: 539 year: 2013 end-page: 548 ident: bib0026 article-title: An efficient MapReduce algorithm for counting triangles in a very large graph publication-title: Proceedings of the Twenty-second ACM International Conference on Information and Knowledge Management – year: 2001 ident: bib0022 publication-title: Parallel I/O for high performance computing – volume: 2 start-page: 305 year: 2008 end-page: 474 ident: bib0033 article-title: Algorithms and data structures for external memory publication-title: Found. Trends Theor. Comput. Sci. – volume: 307 start-page: 310 year: 2007 end-page: 318 ident: bib0002 article-title: Short cycle connectivity publication-title: Discret. Math. – volume: 39 start-page: 27:1 year: 2014 end-page: 27:30 ident: bib0015 article-title: I/o-efficient algorithms on triangle listing and counting publication-title: ACM Trans. Database Syst. – year: 2013 ident: bib0028 article-title: Parallel and distributed triangle counting on graph streams publication-title: Technical Report – volume: vol. 8 year: 1994 ident: bib0035 publication-title: Social Network Analysis: Methods and Applications – start-page: 224 year: 2014 end-page: 233 ident: bib0025 article-title: The input/output complexity of triangle enumeration publication-title: Proceedings of the Thirty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS ’14) – start-page: 325 year: 2013 end-page: 336 ident: bib0014 article-title: Massive graph triangulation publication-title: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD ’13) – reference: Facebook, Facebook statistics, Jun 2015, url: – volume: 6 start-page: 17:1 year: 2012 end-page: 17:32 ident: bib0008 article-title: Triangle listing in massive networks publication-title: ACM Trans. Knowl. Discov. Data – volume: 9 start-page: 15 year: 2015 ident: bib0017 article-title: A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox publication-title: ACM Trans. Knowl. Discov. Data (TKDD) – volume: 44 start-page: 54 year: 2015 end-page: 87 ident: bib0012 article-title: Large induced subgraphs via triangulations and CMSO publication-title: SIAM J. Comput. – reference: . – start-page: 1739 year: 2014 end-page: 1748 ident: bib0027 article-title: MapReduce triangle enumeration with guarantees publication-title: Proceedings of the Twenty-third ACM International Conference on Information and Knowledge Management – start-page: 223 year: 2014 end-page: 234 ident: bib0004 article-title: Listing triangles publication-title: Automata, Languages, and Programming – volume: 393 start-page: 440 year: 1998 end-page: 442 ident: bib0036 article-title: Collective dynamics of small-world networks publication-title: Nature – start-page: 128 year: 2010 end-page: 141 ident: bib0010 article-title: Extended dynamic subgraph statistics using publication-title: Proceedings of the Fourth International Conference on Combinatorial Optimization and Applications - Volume Part I (COCOA ’10) – volume: 99 start-page: 2566 year: 2002 end-page: 2572 ident: bib0024 article-title: Random graph models of social networks publication-title: Proc. Natl. Acad. Sci. United States Am. – year: 2015 ident: bib0030 article-title: Multicore triangle computations without tuning publication-title: Proceedings of the IEEE International Conference on Data Engineering (ICDE) – start-page: 637 year: 2014 end-page: 648 ident: bib0018 article-title: OPT: A new framework for overlapped and parallel triangulation in large-scale graphs publication-title: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD ’14) – volume: 24 start-page: 63 year: 1992 end-page: 113 ident: bib0023 article-title: Join processing in relational databases publication-title: ACM Comput. Surv. – start-page: 606 year: 2005 end-page: 609 ident: bib0029 article-title: Finding, counting and listing all triangles in large graphs, an experimental study publication-title: Proceedings of the Fourth International Conference on Experimental and Efficient Algorithms (WEA ’05) – start-page: 16 year: 2008 end-page: 24 ident: bib0003 article-title: Efficient semi-streaming algorithms for local triangle counting in massive graphs publication-title: Proceedings of the Fourteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – start-page: 685 year: 2015 end-page: 694 ident: bib0021 article-title: MASCOT: Memory-efficient and accurate sampling for counting local triangles in graph streams publication-title: Proceedings of the Twenty-first ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – volume: 4 start-page: 58 year: 2010 end-page: 68 ident: bib0034 article-title: On triangulation-based dense neighborhood graph discovery publication-title: Proc. VLDB Endow. – ident: 10.1016/j.ins.2015.12.006_bib0011 – volume: 31 start-page: 1116 issue: 9 year: 1988 ident: 10.1016/j.ins.2015.12.006_bib0001 article-title: The input/output complexity of sorting and related problems publication-title: Commun. ACM doi: 10.1145/48529.48535 – volume: 39 start-page: 27:1 year: 2014 ident: 10.1016/j.ins.2015.12.006_bib0015 article-title: I/o-efficient algorithms on triangle listing and counting publication-title: ACM Trans. Database Syst. doi: 10.1145/2691190.2691193 – volume: 14 start-page: 210 issue: 1 year: 1985 ident: 10.1016/j.ins.2015.12.006_bib0006 article-title: Arboricity and subgraph listing algorithms publication-title: SIAM J. Comput. doi: 10.1137/0214017 – year: 2013 ident: 10.1016/j.ins.2015.12.006_bib0028 article-title: Parallel and distributed triangle counting on graph streams – start-page: 672 year: 2011 ident: 10.1016/j.ins.2015.12.006_bib0007 article-title: Triangle listing in massive networks and its applications – ident: 10.1016/j.ins.2015.12.006_bib0032 – start-page: 1 year: 1977 ident: 10.1016/j.ins.2015.12.006_bib0016 article-title: Finding a minimum circuit in a graph – volume: 307 start-page: 310 issue: 3 year: 2007 ident: 10.1016/j.ins.2015.12.006_bib0002 article-title: Short cycle connectivity publication-title: Discret. Math. doi: 10.1016/j.disc.2005.09.051 – volume: 407 start-page: 458 issue: 1–3 year: 2008 ident: 10.1016/j.ins.2015.12.006_bib0020 article-title: Main-memory triangle computations for very large (sparse (power-law)) graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.07.017 – start-page: 325 year: 2013 ident: 10.1016/j.ins.2015.12.006_bib0014 article-title: Massive graph triangulation – start-page: 685 year: 2015 ident: 10.1016/j.ins.2015.12.006_bib0021 article-title: MASCOT: Memory-efficient and accurate sampling for counting local triangles in graph streams – volume: 99 start-page: 2566 issue: Suppl 1 year: 2002 ident: 10.1016/j.ins.2015.12.006_bib0024 article-title: Random graph models of social networks publication-title: Proc. Natl. Acad. Sci. United States Am. doi: 10.1073/pnas.012582999 – start-page: 253 year: 2006 ident: 10.1016/j.ins.2015.12.006_bib0005 article-title: Counting triangles in data streams – volume: 4 start-page: 58 issue: 2 year: 2010 ident: 10.1016/j.ins.2015.12.006_bib0034 article-title: On triangulation-based dense neighborhood graph discovery publication-title: Proc. VLDB Endow. doi: 10.14778/1921071.1921073 – volume: vol. 8 year: 1994 ident: 10.1016/j.ins.2015.12.006_bib0035 – volume: 24 start-page: 63 issue: 1 year: 1992 ident: 10.1016/j.ins.2015.12.006_bib0023 article-title: Join processing in relational databases publication-title: ACM Comput. Surv. doi: 10.1145/128762.128764 – start-page: 223 year: 2014 ident: 10.1016/j.ins.2015.12.006_bib0004 article-title: Listing triangles – year: 2001 ident: 10.1016/j.ins.2015.12.006_bib0022 – volume: 25 start-page: 73 issue: 2 year: 1993 ident: 10.1016/j.ins.2015.12.006_bib0013 article-title: Query evaluation techniques for large databases publication-title: ACM Comput. Surv. doi: 10.1145/152610.152611 – start-page: 606 year: 2005 ident: 10.1016/j.ins.2015.12.006_bib0029 article-title: Finding, counting and listing all triangles in large graphs, an experimental study – start-page: 781 year: 2013 ident: 10.1016/j.ins.2015.12.006_bib0031 article-title: Parallel triangle counting in massive streaming graphs – volume: 6 start-page: 17:1 issue: 4 year: 2012 ident: 10.1016/j.ins.2015.12.006_bib0008 article-title: Triangle listing in massive networks publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/2382577.2382581 – volume: 44 start-page: 54 issue: 1 year: 2015 ident: 10.1016/j.ins.2015.12.006_bib0012 article-title: Large induced subgraphs via triangulations and CMSO publication-title: SIAM J. Comput. doi: 10.1137/140964801 – start-page: 637 year: 2014 ident: 10.1016/j.ins.2015.12.006_bib0018 article-title: OPT: A new framework for overlapped and parallel triangulation in large-scale graphs – volume: 393 start-page: 440 issue: 6684 year: 1998 ident: 10.1016/j.ins.2015.12.006_bib0036 article-title: Collective dynamics of small-world networks publication-title: Nature doi: 10.1038/30918 – start-page: 16 year: 2008 ident: 10.1016/j.ins.2015.12.006_bib0003 article-title: Efficient semi-streaming algorithms for local triangle counting in massive graphs – volume: 9 start-page: 15 issue: 3 year: 2015 ident: 10.1016/j.ins.2015.12.006_bib0017 article-title: A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox publication-title: ACM Trans. Knowl. Discov. Data (TKDD) – volume: 2 start-page: 305 issue: 4 year: 2008 ident: 10.1016/j.ins.2015.12.006_bib0033 article-title: Algorithms and data structures for external memory publication-title: Found. Trends Theor. Comput. Sci. doi: 10.1561/0400000014 – start-page: 230 year: 1993 ident: 10.1016/j.ins.2015.12.006_bib0009 article-title: Nested loops revisited – start-page: 1739 year: 2014 ident: 10.1016/j.ins.2015.12.006_bib0027 article-title: MapReduce triangle enumeration with guarantees – start-page: 539 year: 2013 ident: 10.1016/j.ins.2015.12.006_bib0026 article-title: An efficient MapReduce algorithm for counting triangles in a very large graph – start-page: 128 year: 2010 ident: 10.1016/j.ins.2015.12.006_bib0010 article-title: Extended dynamic subgraph statistics using h-index parameterized data structures – year: 1986 ident: 10.1016/j.ins.2015.12.006_bib0019 – year: 2015 ident: 10.1016/j.ins.2015.12.006_bib0030 article-title: Multicore triangle computations without tuning – start-page: 224 year: 2014 ident: 10.1016/j.ins.2015.12.006_bib0025 article-title: The input/output complexity of triangle enumeration |
| SSID | ssj0004766 |
| Score | 2.2162905 |
| Snippet | Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Clocks CPU parallelism Graph indexing Graph mining Graphs I/O-efficient algorithm Mathematical analysis Social networks State of the art Triangle listing Triangles Walls |
| Title | iTri: Index-based triangle listing in massive graphs |
| URI | https://dx.doi.org/10.1016/j.ins.2015.12.006 https://www.proquest.com/docview/1786154817 |
| Volume | 336 |
| WOSCitedRecordID | wos000370102500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLeg4wAHBAO0DYaMhHagihTHcRxzm1AnPkrhkKFyspwPTxld0jUt6p_Ps-Ms0YBpHLhElZWk0Xs_vw-_L4Rek1iFItPUi0KivZAx7qlcKS8NVJgGQgtuZxF8m_LZLJ7PxVc3jLOx4wR4VcXbrVj-V1bDGjDblM7-A7uvXgoL8BuYDldgO1xvxfgyWZm0N9j5ebH1jJbKx2Y2R3W2KMYLs6XbKpYLMJtN2pBtWd0MjVRXomSR4TRknxEP77Onxp9NRw6txp_UhVr0cswKse91dfajrvv4fluKXVZNsXGa0hVcWzlTNt2qO34g0SBrpSsH8D3jmAxFKqVDoUgG2tVWvv0ut9sjhHNwNkwLdcLsEa3_hx7Zsy_y5HQ6lclknhwtLz0zPsyE2d0slbtoJ-BMxCO0c_xhMv_Yl8jyNmzdfW0X4Lapftf-9W8myjVlbS2Q5BF66FwHfNyy_DG6U1S76MGgoeQuOnRlKPgID5iInQB_gkIDjrd4AA3cQQM7aOCywg4auIXGU3R6Mknevffc3Awvo9Rfe1TplBSBCMH7pVowpSinLIftR3KmdB5qlvm-pmYV7HkdpCnIbZDsIiNZEBX0GRpVdVXsIRymcZEFQWraxYZKmBl1mVIs0lwoxjXbR35HKpm5pvJmtslCdtmD5xKoKw11JQkkUHcfvbl6ZNl2VLnp5rCjv3SAb009Cci56bFXHa8kiEsTA1NVUW8aSXgcGS-d8INb3PMc3e8x_wKN1qtNcYjuZT_XZbN66TD2C0b4ivI |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=iTri%3A+Index-based+triangle+listing+in+massive+graphs&rft.jtitle=Information+sciences&rft.au=Rasel%2C+Mostofa+Kamal&rft.au=Han%2C+Yongkoo&rft.au=Kim%2C+Jinseung&rft.au=Park%2C+Kisung&rft.date=2016-04-01&rft.issn=0020-0255&rft.volume=336&rft.spage=1&rft.epage=20&rft_id=info:doi/10.1016%2Fj.ins.2015.12.006&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |