Tunnel: Parallel-inducing sort for large string analytics
Saved in:
| Published in | Future generation computer systems Vol. 149; pp. 650 - 663 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
01.12.2023
|
| Online Access | Get full text |
| ISSN | 0167-739X |
| DOI | 10.1016/j.future.2023.08.009 |
Cover
| Author | Du, Zhihui Zhang, Sen Bader, David A. |
|---|---|
| Author_xml | – sequence: 1 givenname: Zhihui orcidid: 0000-0002-8435-1611 surname: Du fullname: Du, Zhihui – sequence: 2 givenname: Sen orcidid: 0000-0002-0173-5362 surname: Zhang fullname: Zhang, Sen – sequence: 3 givenname: David A. orcidid: 0000-0002-7380-5876 surname: Bader fullname: Bader, David A. |
| BookMark | eNotz81qwzAQBGAdUmiS9g168AvY3ZVs2eqthP4EAu0hhd6EIq-CjSoXyT7k7WuTngZmYODbsFUYAjH2gFAgoHzsCzeNU6SCAxcFNAWAWrH1PNV5LdT3Lduk1AMA1gLXTB2nEMg_ZZ8mGu_J511oJ9uFc5aGOGZuiJk38UxZGuPSmmD8ZexsumM3zvhE9_-5ZV-vL8fde374eNvvng-55QBjjqUg6ahBaCtuqDqJFkvXkqmsQSWtkI0xpeONbACpdU4qJbiyOGdVnkhsWXn9tXFIKZLTv7H7MfGiEfRC1r2-kvVC1tDomSz-AP73UMQ |
| Cites_doi | 10.1007/s00453-004-1094-1 10.1145/2442516.2442536 10.1016/j.parco.2007.06.004 10.1145/2807591.2807609 10.1109/TC.2010.188 10.1145/1242471.1242472 10.1145/321941.321946 10.1145/2312005.2312018 10.1093/bioinformatics/btp112 10.1145/1217856.1217858 10.1145/1008861.1008865 10.1137/0222058 10.1109/TC.2018.2842050 10.1007/s11227-018-2395-5 10.1002/cpe.3867 10.1016/j.jda.2004.08.002 10.1016/j.ic.2021.104818 10.1016/j.tcs.2007.07.017 10.1016/j.tcs.2007.07.018 10.1145/2493175.2493180 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.future.2023.08.009 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 663 |
| ExternalDocumentID | 10_1016_j_future_2023_08_009 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29H 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABBOA ABDPE ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADJOM ADMUD ADNMO AEBSH AEIPS AEKER AFJKZ AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIIUN AIKHN AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 R2- ROL RPZ SBC SDF SDG SES SEW SPC SPCBC SSV SSZ T5K UHS WUQ XPP ZMT ~G- ~HD |
| ID | FETCH-LOGICAL-c200t-143e6fe810d52ae5b3d14fdea5ca196c368aa4f286801edff699329c169954be3 |
| ISSN | 0167-739X |
| IngestDate | Thu Oct 02 04:23:48 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c200t-143e6fe810d52ae5b3d14fdea5ca196c368aa4f286801edff699329c169954be3 |
| ORCID | 0000-0002-7380-5876 0000-0002-8435-1611 0000-0002-0173-5362 |
| PageCount | 14 |
| ParticipantIDs | crossref_primary_10_1016_j_future_2023_08_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-12-00 |
| PublicationDateYYYYMMDD | 2023-12-01 |
| PublicationDate_xml | – month: 12 year: 2023 text: 2023-12-00 |
| PublicationDecade | 2020 |
| PublicationTitle | Future generation computer systems |
| PublicationYear | 2023 |
| References | 10.1016/j.future.2023.08.009_b8 Puglisi (10.1016/j.future.2023.08.009_b22) 2007; 39 10.1016/j.future.2023.08.009_b13 Nong (10.1016/j.future.2023.08.009_b28) 2010; 60 10.1016/j.future.2023.08.009_b15 Kim (10.1016/j.future.2023.08.009_b5) 2003 McCreight (10.1016/j.future.2023.08.009_b2) 1976; 23 Kärkkäinen (10.1016/j.future.2023.08.009_b16) 2006; 53 JáJá (10.1016/j.future.2023.08.009_b20) 1992 Bentley (10.1016/j.future.2023.08.009_b21) 1980; 12 Kärkkäinen (10.1016/j.future.2023.08.009_b4) 2003 Manzini (10.1016/j.future.2023.08.009_b7) 2004; 40 Wang (10.1016/j.future.2023.08.009_b27) 2016; 28 Futamura (10.1016/j.future.2023.08.009_b12) 2001; 64 Homann (10.1016/j.future.2023.08.009_b17) 2009; 25 Ko (10.1016/j.future.2023.08.009_b3) 2005; 3 10.1016/j.future.2023.08.009_b24 Shun (10.1016/j.future.2023.08.009_b26) 2014 Manber (10.1016/j.future.2023.08.009_b1) 1993; 22 Nong (10.1016/j.future.2023.08.009_b10) 2013; 31 Lao (10.1016/j.future.2023.08.009_b18) 2018; 67 Larsson (10.1016/j.future.2023.08.009_b23) 2007; 387 Li (10.1016/j.future.2023.08.009_b11) 2022; 285 Lao (10.1016/j.future.2023.08.009_b19) 2018; 74 Kärkkäinen (10.1016/j.future.2023.08.009_b9) 2007; 387 Osipov (10.1016/j.future.2023.08.009_b14) 2012 Kulla (10.1016/j.future.2023.08.009_b25) 2007; 33 Burkhardt (10.1016/j.future.2023.08.009_b6) 2003 |
| References_xml | – volume: 40 start-page: 33 issue: 1 year: 2004 ident: 10.1016/j.future.2023.08.009_b7 article-title: Engineering a lightweight suffix array construction algorithm publication-title: Algorithmica doi: 10.1007/s00453-004-1094-1 – ident: 10.1016/j.future.2023.08.009_b15 doi: 10.1145/2442516.2442536 – year: 1992 ident: 10.1016/j.future.2023.08.009_b20 – volume: 33 start-page: 605 issue: 9 year: 2007 ident: 10.1016/j.future.2023.08.009_b25 article-title: Scalable parallel suffix array construction publication-title: Parallel Comput. doi: 10.1016/j.parco.2007.06.004 – ident: 10.1016/j.future.2023.08.009_b24 doi: 10.1145/2807591.2807609 – volume: 60 start-page: 1471 issue: 10 year: 2010 ident: 10.1016/j.future.2023.08.009_b28 article-title: Two efficient algorithms for linear time suffix array construction publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2010.188 – start-page: 186 year: 2003 ident: 10.1016/j.future.2023.08.009_b5 article-title: Linear-time construction of suffix arrays – start-page: 55 year: 2003 ident: 10.1016/j.future.2023.08.009_b6 article-title: Fast lightweight suffix array construction and checking – volume: 39 start-page: 4 issue: 2 year: 2007 ident: 10.1016/j.future.2023.08.009_b22 article-title: A taxonomy of suffix array construction algorithms publication-title: ACM Comput. Surv. doi: 10.1145/1242471.1242472 – start-page: 387 year: 2014 ident: 10.1016/j.future.2023.08.009_b26 article-title: Fast parallel computation of longest common prefixes – volume: 23 start-page: 262 issue: 2 year: 1976 ident: 10.1016/j.future.2023.08.009_b2 article-title: A space-economical suffix tree construction algorithm publication-title: J. ACM doi: 10.1145/321941.321946 – ident: 10.1016/j.future.2023.08.009_b13 doi: 10.1145/2312005.2312018 – volume: 25 start-page: 1084 issue: 8 year: 2009 ident: 10.1016/j.future.2023.08.009_b17 article-title: mkESA: enhanced suffix array construction tool publication-title: Bioinformatics doi: 10.1093/bioinformatics/btp112 – volume: 53 start-page: 918 issue: 6 year: 2006 ident: 10.1016/j.future.2023.08.009_b16 article-title: Linear work suffix array construction publication-title: J. ACM doi: 10.1145/1217856.1217858 – volume: 12 start-page: 36 issue: 3 year: 1980 ident: 10.1016/j.future.2023.08.009_b21 article-title: A general method for solving divide-and-conquer recurrences publication-title: ACM SIGACT News doi: 10.1145/1008861.1008865 – volume: 64 year: 2001 ident: 10.1016/j.future.2023.08.009_b12 article-title: Parallel suffix sorting publication-title: Electrical Engineering and Computer Science - All Scholarship. 64. – start-page: 379 year: 2012 ident: 10.1016/j.future.2023.08.009_b14 article-title: Parallel suffix array construction for shared memory architectures – volume: 22 start-page: 935 issue: 5 year: 1993 ident: 10.1016/j.future.2023.08.009_b1 article-title: Suffix arrays: a new method for on-line string searches publication-title: SIAM J. Comput. doi: 10.1137/0222058 – start-page: 943 year: 2003 ident: 10.1016/j.future.2023.08.009_b4 article-title: Simple linear work suffix array construction – volume: 67 start-page: 1737 issue: 12 year: 2018 ident: 10.1016/j.future.2023.08.009_b18 article-title: Fast in-place suffix sorting on a multicore computer publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2018.2842050 – volume: 74 start-page: 3468 issue: 7 year: 2018 ident: 10.1016/j.future.2023.08.009_b19 article-title: Fast induced sorting suffixes on a multicore machine publication-title: J. Supercomput. doi: 10.1007/s11227-018-2395-5 – volume: 28 start-page: 3466 issue: 12 year: 2016 ident: 10.1016/j.future.2023.08.009_b27 article-title: Fast parallel skew and prefix-doubling suffix array construction on the GPU publication-title: Concurr. Comput.: Pract. Exper. doi: 10.1002/cpe.3867 – volume: 3 start-page: 143 issue: 2–4 year: 2005 ident: 10.1016/j.future.2023.08.009_b3 article-title: Space efficient linear time construction of suffix arrays publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2004.08.002 – volume: 285 year: 2022 ident: 10.1016/j.future.2023.08.009_b11 article-title: Optimal in-place suffix sorting publication-title: Inform. and Comput. doi: 10.1016/j.ic.2021.104818 – volume: 387 start-page: 258 issue: 3 year: 2007 ident: 10.1016/j.future.2023.08.009_b23 article-title: Faster suffix sorting publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2007.07.017 – ident: 10.1016/j.future.2023.08.009_b8 – volume: 387 start-page: 249 issue: 3 year: 2007 ident: 10.1016/j.future.2023.08.009_b9 article-title: Fast BWT in small space by blockwise suffix sorting publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2007.07.018 – volume: 31 start-page: 1 issue: 3 year: 2013 ident: 10.1016/j.future.2023.08.009_b10 article-title: Practical linear-time O(1)-workspace suffix sorting for constant alphabets publication-title: ACM Trans. Inf. Syst. (TOIS) doi: 10.1145/2493175.2493180 |
| SSID | ssj0001731 |
| Score | 2.3871224 |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 650 |
| Title | Tunnel: Parallel-inducing sort for large string analytics |
| Volume | 149 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) issn: 0167-739X databaseCode: GBLVA dateStart: 20110101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001731 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect issn: 0167-739X databaseCode: .~1 dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001731 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] issn: 0167-739X databaseCode: ACRLP dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001731 providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect issn: 0167-739X databaseCode: AIKHN dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001731 providerName: Elsevier |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA6LXrz4Ft_k4E1SbNOmrScfKIugeNiFvZVJm6KyrCLtQQ_-diePbosVUS9lKUv6-MJkMv2--Qg5SosgKlMZM5VEBQu5lAyETJjgvFBBrFQOWpx8eyeG4_BmEk0Gg7OuuqSSXv7-ra7kP6jiOcRVq2T_gOx8UDyBvxFfPCLCePwdxrVmqehN_T28alOUKcMtdp2bGgHm1YZDONVcb60JsXJEmL5VDcO9sec0fUW0mbJy8yF3Xg-u0XNrPl-bjxkPjw_1Y7_k3KrKLqCwU8FQ5o_PvW5xIeAdooarN2Icjblxu20Dpm0y6kKesI1j3eopbLjqBWZbI3jybKcUT1_LtE49SduFqPn4_mV9mrMGG0LaU2ZHyfQomXbR1ArOxQDjujbv8D5ako8fO0dK9xiNeNIw_Pr30klOOlnGaJUsu-0BPbdYr5GBmq2TlcZ6g7pIvEFSC_0p7QFPNfAUgacGeGqBp3PgN8n4-mp0OWTOBYPlONcrhgmtEqVK_JMiCkBFkhd-WBYKohwwfOZcJABhGSQCkw1VlKXAlDNIc1_oVn9S8S2yMHueqW1CTbNCDlIAiBAwWZMRcImvCDhg5h7sENY8fvZim51kP7303T_-f48stZNsnyxUr7U6wJyukocGtk99kk2t |
| 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=Tunnel%3A+Parallel-inducing+sort+for+large+string+analytics&rft.jtitle=Future+generation+computer+systems&rft.au=Du%2C+Zhihui&rft.au=Zhang%2C+Sen&rft.au=Bader%2C+David+A.&rft.date=2023-12-01&rft.issn=0167-739X&rft.volume=149&rft.spage=650&rft.epage=663&rft_id=info:doi/10.1016%2Fj.future.2023.08.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_future_2023_08_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-739X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-739X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-739X&client=summon |