Randomized counter-based algorithms for frequency estimation over data streams in O ( log log N ) space
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 984; s. 114317 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
12.02.2024
|
| ISSN: | 0304-3975 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| ArticleNumber | 114317 |
|---|---|
| Author | Nitta, Riku Kakimura, Naonori |
| Author_xml | – sequence: 1 givenname: Naonori orcidid: 0000-0002-3918-3479 surname: Kakimura fullname: Kakimura, Naonori – sequence: 2 givenname: Riku surname: Nitta fullname: Nitta, Riku |
| BookMark | eNo9kM9KAzEYxHOoYFt9AG856mHXpNkmu0cp_oNiQfQcvk2-1C1tUpNUqDcfxVfzSdxScS7DwDAMvxEZ-OCRkAvOSs64vF6V2aRywiai5LwSXA3IkAlWFaJR01MySmnFek2VHJLwDN6GTfeJlpqw8xlj0ULqE6yXIXb5bZOoC5G6iO879GZPMeVuA7kLnoYPjNRCBppyROirnacLeknXYUl_vr7__Yle0bQFg2fkxME64fmfj8nr3e3L7KGYL-4fZzfzwvBG5QIEWlBtU3MJlslWSXBciqZiVQOc1a4xtURhZW1qy1tWITprVesMMHSsFmPCj7smhpQiOr2N_eu415zpAyW90j0lfaCkj5TEL665Yu8 |
| Cites_doi | 10.1006/jcss.1997.1545 10.14778/2367502.2367508 10.1007/BF01934993 10.1145/762471.762473 10.1145/1862919.1862923 10.1007/s00778-009-0172-z 10.1016/j.jalgor.2003.12.001 10.1145/2500128 10.1016/0167-6423(82)90012-0 10.1145/359619.359627 10.1145/3264427 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2023.114317 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2023_114317 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9DU 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ YNT ZMT ZY4 ~G- ~HD |
| ID | FETCH-LOGICAL-c197t-a3eda7b9816ad06b76af16394049a108f9c86e3d68c8d1b04eefdd7bfca0ef083 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001129002000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:24:51 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c197t-a3eda7b9816ad06b76af16394049a108f9c86e3d68c8d1b04eefdd7bfca0ef083 |
| ORCID | 0000-0002-3918-3479 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2023_114317 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-02-12 |
| PublicationDateYYYYMMDD | 2024-02-12 |
| PublicationDate_xml | – month: 02 year: 2024 text: 2024-02-12 day: 12 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2024 |
| References | Manku (10.1016/j.tcs.2023.114317_br0070) 2012; 5 Misra (10.1016/j.tcs.2023.114317_br0090) 1982; 2 Alon (10.1016/j.tcs.2023.114317_br0120) 1999; 58 Demaine (10.1016/j.tcs.2023.114317_br0050) 2002; vol. 2461 Ogata (10.1016/j.tcs.2023.114317_br0180) 2011 Leskovec (10.1016/j.tcs.2023.114317_br0020) 2014 Flajolet (10.1016/j.tcs.2023.114317_br0160) 1985; 25 Agarwal (10.1016/j.tcs.2023.114317_br0200) 2013; 38 Greenwald (10.1016/j.tcs.2023.114317_br0100) 2001 Berinde (10.1016/j.tcs.2023.114317_br0190) 2010; 35 Cormode (10.1016/j.tcs.2023.114317_br0150) 2005; 55 Shrivastava (10.1016/j.tcs.2023.114317_br0110) 2004 Bhattacharyya (10.1016/j.tcs.2023.114317_br0130) 2019; 15 Metwally (10.1016/j.tcs.2023.114317_br0080) 2005 Charikar (10.1016/j.tcs.2023.114317_br0140) 2002 Morris (10.1016/j.tcs.2023.114317_br0170) 1978; 21 Cormode (10.1016/j.tcs.2023.114317_br0030) 2010; 19 Karp (10.1016/j.tcs.2023.114317_br0060) 2003; 28 Feldman (10.1016/j.tcs.2023.114317_br0010) 2020 Anderson (10.1016/j.tcs.2023.114317_br0040) 2017 |
| References_xml | – volume: 58 start-page: 137 issue: 1 year: 1999 ident: 10.1016/j.tcs.2023.114317_br0120 article-title: The space complexity of approximating the frequency moments publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.1997.1545 – volume: 5 start-page: 1699 issue: 12 year: 2012 ident: 10.1016/j.tcs.2023.114317_br0070 article-title: Approximate frequency counts over data streams publication-title: Proc. VLDB Endow. doi: 10.14778/2367502.2367508 – volume: 25 start-page: 113 issue: 1 year: 1985 ident: 10.1016/j.tcs.2023.114317_br0160 article-title: Approximate counting: a detailed analysis publication-title: BIT Numer. Math. doi: 10.1007/BF01934993 – volume: vol. 2461 start-page: 348 year: 2002 ident: 10.1016/j.tcs.2023.114317_br0050 article-title: Frequency estimation of Internet packet streams with limited space – start-page: 239 year: 2004 ident: 10.1016/j.tcs.2023.114317_br0110 article-title: Medians and beyond: new aggregation techniques for sensor networks – volume: 28 start-page: 51 year: 2003 ident: 10.1016/j.tcs.2023.114317_br0060 article-title: A simple algorithm for finding frequent elements in streams and bags publication-title: ACM Trans. Database Syst. doi: 10.1145/762471.762473 – volume: 35 issue: 4 year: 2010 ident: 10.1016/j.tcs.2023.114317_br0190 article-title: Space-optimal heavy Hitters with strong error bounds publication-title: ACM Trans. Database Syst. doi: 10.1145/1862919.1862923 – volume: 19 start-page: 3 issue: 1 year: 2010 ident: 10.1016/j.tcs.2023.114317_br0030 article-title: Methods for finding frequent items in data streams publication-title: VLDB J. doi: 10.1007/s00778-009-0172-z – volume: 55 start-page: 58 issue: 1 year: 2005 ident: 10.1016/j.tcs.2023.114317_br0150 article-title: An improved data stream summary: the count-min sketch and its applications publication-title: J. Algorithms doi: 10.1016/j.jalgor.2003.12.001 – year: 2014 ident: 10.1016/j.tcs.2023.114317_br0020 – year: 2020 ident: 10.1016/j.tcs.2023.114317_br0010 – start-page: 693 year: 2002 ident: 10.1016/j.tcs.2023.114317_br0140 article-title: Finding frequent items in data streams – volume: 38 start-page: 1 issue: 4 year: 2013 ident: 10.1016/j.tcs.2023.114317_br0200 article-title: Mergeable summaries publication-title: ACM Trans. Database Syst. doi: 10.1145/2500128 – volume: 2 start-page: 143 issue: 2 year: 1982 ident: 10.1016/j.tcs.2023.114317_br0090 article-title: Finding repeated elements publication-title: Sci. Comput. Program. doi: 10.1016/0167-6423(82)90012-0 – volume: 21 start-page: 840 issue: 10 year: 1978 ident: 10.1016/j.tcs.2023.114317_br0170 article-title: Counting large numbers of events in small registers publication-title: Commun. ACM doi: 10.1145/359619.359627 – start-page: 514 year: 2011 ident: 10.1016/j.tcs.2023.114317_br0180 article-title: A randomized algorithm for finding frequent elements in streams using O(loglog N) space – volume: 15 issue: 1 year: 2019 ident: 10.1016/j.tcs.2023.114317_br0130 article-title: An optimal algorithm for ℓ1-heavy Hitters in insertion streams and related problems publication-title: ACM Trans. Algorithms doi: 10.1145/3264427 – start-page: 268 year: 2017 ident: 10.1016/j.tcs.2023.114317_br0040 article-title: A high-performance algorithm for identifying frequent items in data streams – start-page: 398 year: 2005 ident: 10.1016/j.tcs.2023.114317_br0080 article-title: Efficient computation of frequent and top-k elements in data streams – start-page: 58 year: 2001 ident: 10.1016/j.tcs.2023.114317_br0100 article-title: Space-efficient online computation of quantile summaries |
| SSID | ssj0000576 |
| Score | 2.4107966 |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 114317 |
| Title | Randomized counter-based algorithms for frequency estimation over data streams in O ( log log N ) space |
| Volume | 984 |
| WOSCitedRecordID | wos001129002000001&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 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211209 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELVgy4EeChQQUEA-gAREqfJt-7hCRYBgi9CC9hY5tlNSukm1m63a3vgp_DV-CePY-dhFSPTAJbsbRZaVefs8Y8_MQ-iZyBiNAwnRCVfKBcLL3Eww6spAEh5nkWe0Ab9-IJMJnc3YJ7uZs2zkBEhZ0vNzdvpfTQ33wNi6dPYK5u4GhRvwHYwOVzA7XP_J8J95Kat5cal0vdpKvzdXL1XS4SdH1aKov5kWDE6-MFnUF45utDG3ruOZVgznNW-KSHS3hqJ0DrUb6mjJyiY1wn8-9jd-TRy9uwDkJNYyi6aDKklh5SMcu-Z2TA8u7HzVqB0B1VclTLE_K6mtb1t8Xw23J4LIbcRSBiwW6qMXZuRRWsplNBqQJoRkoSng_IPPzdbC8X4tdGv1INzvn13vnb2xpnWZhm0S23EKQ6R6iNQMcR1tBSRmdIS2xu8OZu_75Tsm5oDbzrs9Cm-SAjfmMXBmBl7J9DbaseEEHhsY3EHXVLmLbrVSHdgy9y7a_ti1513eRVWPEbyGEdxjBANGcIcR3GMEa4xgjRFsMYKLEh_iFxgwgX_9-Nl9TvBL3GDiHvry5mD6-q1rlTdc4TNSuzxUkhP4G_sJl16SkYTn4LizCOJJ7ns0Z4ImKpQJFVT6mRcplUtJslxwT-Xg1d9Ho7Iq1QOEaa6oyCEs5b6KOCdcQIggaZxIP4-VlzxEr9pXmJ6aBivpX4326CoP76GbPSAfo1G9WKkn6IY4q4vl4qk1-286HXVB |
| 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=Randomized+counter-based+algorithms+for+frequency+estimation+over+data+streams+in+O+%28+log+%E2%81%A1+log+%E2%81%A1+N+%29+space&rft.jtitle=Theoretical+computer+science&rft.au=Kakimura%2C+Naonori&rft.au=Nitta%2C+Riku&rft.date=2024-02-12&rft.issn=0304-3975&rft.volume=984&rft.spage=114317&rft_id=info:doi/10.1016%2Fj.tcs.2023.114317&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2023_114317 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |