QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements
The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient ϵ-approximate synopsis algorithms select all frequent elements but may overestimate them depending on ϵ (user-def...
Saved in:
| Published in | Journal of parallel and distributed computing Vol. 204; p. 105134 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.10.2025
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient ϵ-approximate synopsis algorithms select all frequent elements but may overestimate them depending on ϵ (user-defined parameter). Evolving applications demand performance only achievable by parallelization. However, algorithmic guarantees concerning concurrent updates and queries have been overlooked. We propose Query and Parallelism Optimized Space-Saving (QPOPSS ), providing concurrency guarantees. A cornerstone of the design is a new approach for the main data structure for the Space-Saving algorithm, enabling support of very fast queries. QPOPSS combines minimal overlap with concurrent updates, distributing work and using fine-grained thread synchronization to achieve high throughput, accuracy, and low memory use. Our analysis shows space and approximation bounds under various concurrency and data distribution conditions. Our empirical evaluation relative to representative state-of-the-art methods reveals that QPOPSS 's multithreaded throughput scales linearly while maintaining the highest accuracy, with orders of magnitude smaller memory footprint.
•QPOPSS: a memory-efficient parallel algorithm for frequent element detection in data streams.•QOSS: a query-optimized variant of Space-Saving with improved top-k query performance.•Open-source implementation with comprehensive evaluation on real and synthetic datasets.•QPOPSS outperforms state-of-the-art in accuracy and memory efficiency under tight constraints.•Strong scalability and robustness on skewed data and large query workloads. |
|---|---|
| AbstractList | The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient ϵ-approximate synopsis algorithms select all frequent elements but may overestimate them depending on ϵ (user-defined parameter). Evolving applications demand performance only achievable by parallelization. However, algorithmic guarantees concerning concurrent updates and queries have been overlooked. We propose Query and Parallelism Optimized Space-Saving (QPOPSS ), providing concurrency guarantees. A cornerstone of the design is a new approach for the main data structure for the Space-Saving algorithm, enabling support of very fast queries. QPOPSS combines minimal overlap with concurrent updates, distributing work and using fine-grained thread synchronization to achieve high throughput, accuracy, and low memory use. Our analysis shows space and approximation bounds under various concurrency and data distribution conditions. Our empirical evaluation relative to representative state-of-the-art methods reveals that QPOPSS 's multithreaded throughput scales linearly while maintaining the highest accuracy, with orders of magnitude smaller memory footprint. The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient ϵ-approximate synopsis algorithms select all frequent elements but may overestimate them depending on ϵ (user-defined parameter). Evolving applications demand performance only achievable by parallelization. However, algorithmic guarantees concerning concurrent updates and queries have been overlooked. We propose Query and Parallelism Optimized Space-Saving (QPOPSS ), providing concurrency guarantees. A cornerstone of the design is a new approach for the main data structure for the Space-Saving algorithm, enabling support of very fast queries. QPOPSS combines minimal overlap with concurrent updates, distributing work and using fine-grained thread synchronization to achieve high throughput, accuracy, and low memory use. Our analysis shows space and approximation bounds under various concurrency and data distribution conditions. Our empirical evaluation relative to representative state-of-the-art methods reveals that QPOPSS 's multithreaded throughput scales linearly while maintaining the highest accuracy, with orders of magnitude smaller memory footprint. •QPOPSS: a memory-efficient parallel algorithm for frequent element detection in data streams.•QOSS: a query-optimized variant of Space-Saving with improved top-k query performance.•Open-source implementation with comprehensive evaluation on real and synthetic datasets.•QPOPSS outperforms state-of-the-art in accuracy and memory efficiency under tight constraints.•Strong scalability and robustness on skewed data and large query workloads. |
| ArticleNumber | 105134 |
| Author | Stylianopoulos, Charalampos Jarlow, Victor Papatriantafilou, Marina |
| Author_xml | – sequence: 1 givenname: Victor orcidid: 0009-0001-6661-5783 surname: Jarlow fullname: Jarlow, Victor email: victor.jarlow@ri.se, victor.jarlow@outlook.com organization: Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden – sequence: 2 givenname: Charalampos orcidid: 0000-0002-6845-9163 surname: Stylianopoulos fullname: Stylianopoulos, Charalampos email: charalampos.stylianopoulos@gmail.com organization: Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden – sequence: 3 givenname: Marina orcidid: 0000-0001-9094-8871 surname: Papatriantafilou fullname: Papatriantafilou, Marina email: ptrianta@chalmers.se organization: Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden |
| BackLink | https://gup.ub.gu.se/publication/352301$$DView record from Swedish Publication Index https://research.chalmers.se/publication/547212$$DView record from Swedish Publication Index |
| BookMark | eNp9kctuFDEQRb0IEkngB1j5B3rwu23EBkU8IkWaiRoWrEoed3niUb-wu4PC19OTQexgVVVX955F3StyMYwDEvKGsw1n3Lw9bo5TGzaCCb0Kmkt1QS5ZrWRVS65fkqtSjoxxrmt7Sb7f77a7pnlH7xfMT9QPLd357LsOu1R6up3m1Kdf2NJm8gGrxj-m4UDjmGlMQ_u8Z_yx4DDTMmf0PcUO-_Usr8iL6LuCr__Ma_Lt08evN1-qu-3n25sPd1VQnM9VW1uLkjETa6Wj1Toax6JRMkYlpa5RSW72XIq9CIwFy61z0hnnEF10zMpr0py55SdOyx6mnHqfn2D0CTIW9Dk8QHjwXY-5QEHQpg7a1QoktgaUEHuwJnJA6Y3QVmph3Eqt_kk9LBOs0mE50Va7ZHz1i7M_5LGUjPFvgjM41QJHONUCp1rgXMsaen8O4fqfx4QZSkg4BGxTxjBDO6b_xX8DlfmY7w |
| Cites_doi | 10.1109/JSSC.2005.864128 10.1016/S0304-3975(03)00400-6 10.14778/2367502.2367508 10.1145/3584699 10.1002/cpe.3182 10.1016/0167-6423(82)90012-0 10.1109/TNET.2021.3132385 10.1016/j.ins.2015.09.003 10.14778/1687627.1687653 10.1145/762471.762473 10.1145/3516431.3516433 10.1016/j.jalgor.2003.12.001 10.1145/1166074.1166084 10.14778/1454159.1454225 10.1016/j.datak.2008.11.001 10.1145/859716.859719 10.14778/3514061.3514068 10.1145/6617.6621 |
| ContentType | Journal Article |
| Copyright | 2025 The Author(s) |
| Copyright_xml | – notice: 2025 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION ADTPV AOWAS F1U F1S |
| DOI | 10.1016/j.jpdc.2025.105134 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef SwePub SwePub Articles SWEPUB Göteborgs universitet SWEPUB Chalmers tekniska högskola |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | oai_research_chalmers_se_567c5974_3ed6_422b_86f1_e3a625835269 oai_gup_ub_gu_se_352301 10_1016_j_jpdc_2025_105134 S0743731525001017 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 6I. 7-5 71M 8P~ 9JN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO ABBOA ABDPE ABEFU ABFNM ABFSI ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADFGL ADHUB ADJOM ADMUD ADNMO ADTZH ADVLN AEBSH AECPX AEIPS AEKER AENEX AEUPX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNPGV CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFKBS EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- AAYXX CITATION ADTPV AOWAS F1U F1S |
| ID | FETCH-LOGICAL-c411t-d788e3006f745f855f690f643ff43357e4316b132b2c00c8189939699ee9f9083 |
| IEDL.DBID | .~1 |
| ISSN | 0743-7315 1096-0848 |
| IngestDate | Thu Aug 21 06:52:28 EDT 2025 Wed Aug 27 03:57:15 EDT 2025 Tue Aug 05 12:11:47 EDT 2025 Sat Aug 09 17:30:59 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c411t-d788e3006f745f855f690f643ff43357e4316b132b2c00c8189939699ee9f9083 |
| ORCID | 0000-0001-9094-8871 0000-0002-6845-9163 0009-0001-6661-5783 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0743731525001017 |
| ParticipantIDs | swepub_primary_oai_research_chalmers_se_567c5974_3ed6_422b_86f1_e3a625835269 swepub_primary_oai_gup_ub_gu_se_352301 crossref_primary_10_1016_j_jpdc_2025_105134 elsevier_sciencedirect_doi_10_1016_j_jpdc_2025_105134 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-10-01 |
| PublicationDateYYYYMMDD | 2025-10-01 |
| PublicationDate_xml | – month: 10 year: 2025 text: 2025-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2025 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Hernandez, Xiao, Tudor (br0240) 2020 Ngo, Papatriantafilou (br0470) 2025; 18 Gong, Yang, Zhang, Li, Uhlig, Chen, Uden, Li (br0210) 2018 Estan, Varghese (br0190) 2003; 21 Demaine, López-Ortiz, Munro (br0180) 2002; vol. 2461 Cormode (br0120) 2022; 50 Ben-Basat, Einziger, Friedman, Kassner (br0060) 2016; 35 Cafaro, Pulimeno, Tempesta (br0090) 2016; 329 Rinberg, Keidar (br0370) 2020; 179 Anderson, Bevan, Lang, Liberty, Rhodes, Thaler (br0040) 2017 Afek, Bremler-Barr, Cohen, Feibish, Shagam (br0020) 2016 Manku, Motwani (br0310) 2012; 5 Misra, Gries (br0340) 1982; 2 Charikar, Chen, Farach-Colton (br0100) 2004; 312 Zhang, Sun, Zhang, Xu, Wu (br0440) 2014; 26 Al-Fares, Radhakrishnan, Raghavan, Huang, Vahdat (br0030) 2010; vol. 7(1) Stich, Cordonnier, Jaggi (br0420) 2018; 31 Brualdi (br0080) 2010 Manerikar, Palpanas (br0300) 2009; 68 Rinberg, Keidar (br0380) 2023; 70 Stylianopoulos, Walulya, Almgren, Landsiedel, Papatriantafilou (br0430) 2020; 15 Hsu, Indyk, Katabi, Vakilian (br0250) 2019 Pagiamtzis, Sheikholeslami (br0360) 2006; 41 May, Duh, Van Durme, Lall (br0320) 2017 Github (br0260) 2025 Nikolakopoulos, Gidenstam, Papatriantafilou, Tsigas (br0350) 2015 Cormode (br0110) 2018 Cormode, Hadjieleftheriou (br0140) 2008; 1 Ben Basat, Einziger, Keslassy, Orda, Vargaftik, Waisbard (br0070) 2022; 30 Henzinger, Kirsch, Payer, Sezgin, Sokolova (br0230) jan 2013; 48 Zhao, Agrawal, El Abbadi, Metwally (br0450) 2022; 15 Cormode, Muthukrishnan (br0150) 2005; 55 Mandal, Jiang, Shrivastava, Sarkar (br0290) 2018; 32 Karp, Shenker, Papadimitriou (br0270) 2003; 28 Atkinson, Sack, Santoro, Strothotte (br0050) 1986; 29 Harrison, Cai, Gupta, Rexford (br0220) 2018 Das, Antony, Agrawal, El Abbadi (br0170) 2009; 2 Metwally, Agrawal, El Abbadi (br0330) 2006; 31 (br0390) 2003 Kumar, Sung, Xu, Wang (br0280) 2004 Roy, Khan, Alonso (br0400) 2016 Das, Antony, Agrawal, El Abbadi (br0160) 2009; 25 br0010 Garofalakis, Gehrke, Rastogi (br0200) 2016 Zipf (br0460) 1949 Cormode, Hadjieleftheriou (br0130) 2005 Sivaraman, Narayana, Rottenstreich, Muthukrishnan, Rexford (br0410) 2017 Zipf (10.1016/j.jpdc.2025.105134_br0460) 1949 Das (10.1016/j.jpdc.2025.105134_br0170) 2009; 2 Cormode (10.1016/j.jpdc.2025.105134_br0150) 2005; 55 Zhang (10.1016/j.jpdc.2025.105134_br0440) 2014; 26 Al-Fares (10.1016/j.jpdc.2025.105134_br0030) 2010; vol. 7(1) Cormode (10.1016/j.jpdc.2025.105134_br0140) 2008; 1 Cormode (10.1016/j.jpdc.2025.105134_br0130) Demaine (10.1016/j.jpdc.2025.105134_br0180) 2002; vol. 2461 Estan (10.1016/j.jpdc.2025.105134_br0190) 2003; 21 Hernandez (10.1016/j.jpdc.2025.105134_br0240) 2020 Rinberg (10.1016/j.jpdc.2025.105134_br0380) 2023; 70 Roy (10.1016/j.jpdc.2025.105134_br0400) 2016 Cormode (10.1016/j.jpdc.2025.105134_br0110) 2018 Garofalakis (10.1016/j.jpdc.2025.105134_br0200) 2016 Ngo (10.1016/j.jpdc.2025.105134_br0470) 2025; 18 Github (10.1016/j.jpdc.2025.105134_br0260) (10.1016/j.jpdc.2025.105134_br0390) 2003 Ben-Basat (10.1016/j.jpdc.2025.105134_br0060) 2016; 35 Misra (10.1016/j.jpdc.2025.105134_br0340) 1982; 2 Hsu (10.1016/j.jpdc.2025.105134_br0250) 2019 Zhao (10.1016/j.jpdc.2025.105134_br0450) 2022; 15 Rinberg (10.1016/j.jpdc.2025.105134_br0370) 2020; 179 Sivaraman (10.1016/j.jpdc.2025.105134_br0410) 2017 Henzinger (10.1016/j.jpdc.2025.105134_br0230) 2013; 48 Stylianopoulos (10.1016/j.jpdc.2025.105134_br0430) 2020; 15 Das (10.1016/j.jpdc.2025.105134_br0160) 2009; 25 Harrison (10.1016/j.jpdc.2025.105134_br0220) 2018 Metwally (10.1016/j.jpdc.2025.105134_br0330) 2006; 31 Nikolakopoulos (10.1016/j.jpdc.2025.105134_br0350) 2015 Mandal (10.1016/j.jpdc.2025.105134_br0290) 2018; 32 Stich (10.1016/j.jpdc.2025.105134_br0420) 2018; 31 Manku (10.1016/j.jpdc.2025.105134_br0310) 2012; 5 Ben Basat (10.1016/j.jpdc.2025.105134_br0070) 2022; 30 Afek (10.1016/j.jpdc.2025.105134_br0020) Pagiamtzis (10.1016/j.jpdc.2025.105134_br0360) 2006; 41 Atkinson (10.1016/j.jpdc.2025.105134_br0050) 1986; 29 Kumar (10.1016/j.jpdc.2025.105134_br0280) 2004 Charikar (10.1016/j.jpdc.2025.105134_br0100) 2004; 312 May (10.1016/j.jpdc.2025.105134_br0320) 2017 Cormode (10.1016/j.jpdc.2025.105134_br0120) 2022; 50 Gong (10.1016/j.jpdc.2025.105134_br0210) 2018 Anderson (10.1016/j.jpdc.2025.105134_br0040) 2017 Brualdi (10.1016/j.jpdc.2025.105134_br0080) 2010 Manerikar (10.1016/j.jpdc.2025.105134_br0300) 2009; 68 Cafaro (10.1016/j.jpdc.2025.105134_br0090) 2016; 329 Karp (10.1016/j.jpdc.2025.105134_br0270) 2003; 28 |
| References_xml | – start-page: 177 year: 2004 end-page: 188 ident: br0280 article-title: Data streaming algorithms for efficient and accurate estimation of flow size distribution publication-title: Proceedings of the Joint ACM International Conference on Measurement and Modeling of Computer Systems – start-page: 909 year: 2018 end-page: 921 ident: br0210 article-title: HeavyKeeper: an accurate algorithm for finding top-k elephant flows publication-title: USENIX Annual Technical Conference – volume: 35 start-page: 1 year: 2016 end-page: 9 ident: br0060 article-title: Heavy Hitters in streams and sliding windows publication-title: IEEE Int. Conf. Comput. Commun. – volume: 2 start-page: 143 year: 1982 end-page: 152 ident: br0340 article-title: Finding repeated elements publication-title: Sci. Comput. Program. – volume: 18 year: 2025 ident: br0470 article-title: Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing publication-title: Proc. VLDB Endow. – year: 2017 ident: br0320 article-title: Streaming word embeddings with the space-saving algorithm – volume: 329 start-page: 1 year: 2016 end-page: 19 ident: br0090 article-title: A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution publication-title: Inf. Sci. – start-page: 167 year: 2018 end-page: 168 ident: br0110 article-title: Data summarization and distributed computation publication-title: Proceedings of the ACM Symposium on Principles of Distributed Computing – start-page: 1 year: 2018 end-page: 7 ident: br0220 article-title: Network-wide heavy hitter detection with commodity switches publication-title: Proceedings of the Symposium on SDN Research – volume: 32 start-page: 10921 year: 2018 end-page: 10931 ident: br0290 article-title: Topkapi: parallel and fast sketches for finding top-k frequent elements publication-title: Proc. Int. Conf. Neural Inf. Process. Syst. – start-page: 164 year: 2017 end-page: 176 ident: br0410 article-title: Heavy-hitter detection entirely in the data plane publication-title: Proceedings of the ACM Symposium on SDN Research – volume: 179 start-page: 2:1 year: 2020 end-page: 2:17 ident: br0370 article-title: Intermediate value linearizability: a quantitative correctness criterion publication-title: International Symposium on Distributed Computing – volume: vol. 2461 start-page: 348 year: 2002 end-page: 360 ident: br0180 article-title: Frequency Estimation of Internet Packet Streams with Limited Space publication-title: Algorithms — ESA 2002 – volume: 5 start-page: 346 year: 2012 end-page: 357 ident: br0310 article-title: Approximate frequency counts over data streams publication-title: Proc. VLDB Endow. – volume: 25 start-page: 1323 year: 2009 end-page: 1326 ident: br0160 article-title: CoTS: a scalable framework for parallelizing frequency counting over data streams publication-title: IEEE Int. Conf. Data Eng. – volume: 1 start-page: 1530 year: 2008 end-page: 1541 ident: br0140 article-title: Finding frequent items in data streams publication-title: VLDB Endow. – volume: 15 start-page: 1215 year: 2022 end-page: 1227 ident: br0450 article-title: Spacesaving±: an optimal algorithm for frequency estimation and frequent items in the bounded-deletion model publication-title: Proc. VLDB Endow. – volume: 68 start-page: 415 year: 2009 end-page: 430 ident: br0300 article-title: Frequent items in streaming data: an experimental evaluation of the state-of-the-art publication-title: Data Knowl. Eng. – volume: 70 year: 2023 ident: br0380 article-title: Intermediate value linearizability: a quantitative correctness criterion publication-title: J. ACM – ident: br0010 article-title: Anonymized Internet traces 2019 – year: 2025 ident: br0260 – volume: 2 start-page: 217 year: 2009 end-page: 228 ident: br0170 article-title: Thread cooperation in multicore architectures for frequency counting over multiple data streams publication-title: Proc. VLDB Endow. – volume: 48 start-page: 317 year: jan 2013 end-page: 328 ident: br0230 article-title: Quantitative relaxation of concurrent data structures – volume: 30 start-page: 1440 year: 2022 end-page: 1453 ident: br0070 article-title: Memento: making sliding windows efficient for heavy Hitters publication-title: IEEE/ACM Trans. Netw. – start-page: 1 year: 2020 end-page: 9 ident: br0240 article-title: Eraia-enabling intelligence data pipelines for iot-based application systems publication-title: IEEE International Conference on Pervasive Computing and Communications – volume: 29 start-page: 996 year: 1986 end-page: 1000 ident: br0050 article-title: Min-max heaps and generalized priority queues publication-title: Commun. ACM – volume: 15 start-page: 1 year: 2020 end-page: 16 ident: br0430 article-title: : a parallel design with support for fast and accurate concurrent operations publication-title: Eur. Conf. Comput. Syst. – volume: 55 start-page: 58 year: 2005 end-page: 75 ident: br0150 article-title: An improved data stream summary: the count-min sketch and its applications publication-title: J. Algorithms – year: 1949 ident: br0460 article-title: Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology – year: 2010 ident: br0080 article-title: Introductory Combinatorics – volume: 312 start-page: 3 year: 2004 end-page: 15 ident: br0100 article-title: Finding frequent items in data streams publication-title: Theor. Comput. Sci. – start-page: 1 year: 2016 end-page: 9 ident: br0200 article-title: Data Stream Management: A Brave New World – volume: 21 start-page: 270 year: 2003 end-page: 313 ident: br0190 article-title: New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice publication-title: ACM Trans. Comput. Syst. – volume: 26 start-page: 2856 year: 2014 end-page: 2879 ident: br0440 article-title: An efficient framework for parallel and continuous frequent item monitoring publication-title: Concurr. Comput., Pract. Exp. – volume: 28 start-page: 51 year: 2003 end-page: 55 ident: br0270 article-title: A simple algorithm for finding frequent elements in streams and bags publication-title: ACM Trans. Database Syst. – year: 2019 ident: br0250 article-title: Learning-based frequency estimation algorithms publication-title: International Conference on Learning Representations – volume: 31 start-page: 4452 year: 2018 end-page: 4463 ident: br0420 article-title: Sparsified sgd with memory publication-title: Adv. Neural Inf. Process. Syst. – volume: vol. 7(1) start-page: 281 year: 2010 end-page: 296 ident: br0030 article-title: Hedera: dynamic flow scheduling for data center networks publication-title: USENIX Conference on Networked Systems Design and Implementation – year: 2003 ident: br0390 publication-title: Unix Systems Programming: Communication, Concurrency, and Threads – start-page: 268 year: 2017 end-page: 282 ident: br0040 article-title: A high-performance algorithm for identifying frequent items in data streams publication-title: Proceedings of the 2017 Internet Measurement Conference – volume: 50 start-page: 6 year: 2022 end-page: 15 ident: br0120 article-title: Current trends in data summaries publication-title: SIGMOD Rec. – start-page: 239 year: 2015 end-page: 248 ident: br0350 article-title: A consistency framework for iteration operations in concurrent data structures publication-title: IEEE International Parallel and Distributed Processing Symposium – start-page: 1449 year: 2016 end-page: 1463 ident: br0400 article-title: Augmented sketch: faster and more accurate stream processing publication-title: ACM International Conference on Management of Data – year: 2005 ident: br0130 article-title: Finding frequent items website – volume: 31 start-page: 1095 year: 2006 end-page: 1133 ident: br0330 article-title: An integrated efficient solution for computing frequent and top- publication-title: ACM Trans. Database Syst. – year: 2016 ident: br0020 article-title: Efficient distinct heavy Hitters for DNS DDoS attack detection – volume: 41 start-page: 712 year: 2006 end-page: 727 ident: br0360 article-title: Content-Addressable Memory (CAM) circuits and architectures: a tutorial and survey publication-title: IEEE J. Solid-State Circuits – volume: 35 start-page: 1 year: 2016 ident: 10.1016/j.jpdc.2025.105134_br0060 article-title: Heavy Hitters in streams and sliding windows publication-title: IEEE Int. Conf. Comput. Commun. – volume: 41 start-page: 712 issue: 3 year: 2006 ident: 10.1016/j.jpdc.2025.105134_br0360 article-title: Content-Addressable Memory (CAM) circuits and architectures: a tutorial and survey publication-title: IEEE J. Solid-State Circuits doi: 10.1109/JSSC.2005.864128 – volume: 312 start-page: 3 issue: 1 year: 2004 ident: 10.1016/j.jpdc.2025.105134_br0100 article-title: Finding frequent items in data streams publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(03)00400-6 – start-page: 1 year: 2018 ident: 10.1016/j.jpdc.2025.105134_br0220 article-title: Network-wide heavy hitter detection with commodity switches – volume: 5 start-page: 346 year: 2012 ident: 10.1016/j.jpdc.2025.105134_br0310 article-title: Approximate frequency counts over data streams publication-title: Proc. VLDB Endow. doi: 10.14778/2367502.2367508 – volume: 25 start-page: 1323 issue: 1 year: 2009 ident: 10.1016/j.jpdc.2025.105134_br0160 article-title: CoTS: a scalable framework for parallelizing frequency counting over data streams publication-title: IEEE Int. Conf. Data Eng. – start-page: 909 year: 2018 ident: 10.1016/j.jpdc.2025.105134_br0210 article-title: HeavyKeeper: an accurate algorithm for finding top-k elephant flows – volume: 32 start-page: 10921 year: 2018 ident: 10.1016/j.jpdc.2025.105134_br0290 article-title: Topkapi: parallel and fast sketches for finding top-k frequent elements publication-title: Proc. Int. Conf. Neural Inf. Process. Syst. – volume: 70 issue: 2 year: 2023 ident: 10.1016/j.jpdc.2025.105134_br0380 article-title: Intermediate value linearizability: a quantitative correctness criterion publication-title: J. ACM doi: 10.1145/3584699 – volume: 26 start-page: 2856 year: 2014 ident: 10.1016/j.jpdc.2025.105134_br0440 article-title: An efficient framework for parallel and continuous frequent item monitoring publication-title: Concurr. Comput., Pract. Exp. doi: 10.1002/cpe.3182 – volume: vol. 7(1) start-page: 281 year: 2010 ident: 10.1016/j.jpdc.2025.105134_br0030 article-title: Hedera: dynamic flow scheduling for data center networks – year: 2019 ident: 10.1016/j.jpdc.2025.105134_br0250 article-title: Learning-based frequency estimation algorithms – volume: 2 start-page: 143 issue: 2 year: 1982 ident: 10.1016/j.jpdc.2025.105134_br0340 article-title: Finding repeated elements publication-title: Sci. Comput. Program. doi: 10.1016/0167-6423(82)90012-0 – start-page: 1 year: 2016 ident: 10.1016/j.jpdc.2025.105134_br0200 – start-page: 1449 year: 2016 ident: 10.1016/j.jpdc.2025.105134_br0400 article-title: Augmented sketch: faster and more accurate stream processing – volume: 30 start-page: 1440 issue: 4 year: 2022 ident: 10.1016/j.jpdc.2025.105134_br0070 article-title: Memento: making sliding windows efficient for heavy Hitters publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2021.3132385 – volume: 31 start-page: 4452 year: 2018 ident: 10.1016/j.jpdc.2025.105134_br0420 article-title: Sparsified sgd with memory publication-title: Adv. Neural Inf. Process. Syst. – year: 2010 ident: 10.1016/j.jpdc.2025.105134_br0080 – volume: 329 start-page: 1 year: 2016 ident: 10.1016/j.jpdc.2025.105134_br0090 article-title: A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution publication-title: Inf. Sci. doi: 10.1016/j.ins.2015.09.003 – ident: 10.1016/j.jpdc.2025.105134_br0130 – volume: 179 start-page: 2:1 year: 2020 ident: 10.1016/j.jpdc.2025.105134_br0370 article-title: Intermediate value linearizability: a quantitative correctness criterion publication-title: International Symposium on Distributed Computing – volume: 2 start-page: 217 issue: 1 year: 2009 ident: 10.1016/j.jpdc.2025.105134_br0170 article-title: Thread cooperation in multicore architectures for frequency counting over multiple data streams publication-title: Proc. VLDB Endow. doi: 10.14778/1687627.1687653 – volume: 15 start-page: 1 year: 2020 ident: 10.1016/j.jpdc.2025.105134_br0430 article-title: Delegation sketch: a parallel design with support for fast and accurate concurrent operations publication-title: Eur. Conf. Comput. Syst. – year: 1949 ident: 10.1016/j.jpdc.2025.105134_br0460 – volume: 28 start-page: 51 issue: 1 year: 2003 ident: 10.1016/j.jpdc.2025.105134_br0270 article-title: A simple algorithm for finding frequent elements in streams and bags publication-title: ACM Trans. Database Syst. doi: 10.1145/762471.762473 – start-page: 239 year: 2015 ident: 10.1016/j.jpdc.2025.105134_br0350 article-title: A consistency framework for iteration operations in concurrent data structures – start-page: 164 year: 2017 ident: 10.1016/j.jpdc.2025.105134_br0410 article-title: Heavy-hitter detection entirely in the data plane – volume: 50 start-page: 6 issue: 4 year: 2022 ident: 10.1016/j.jpdc.2025.105134_br0120 article-title: Current trends in data summaries publication-title: SIGMOD Rec. doi: 10.1145/3516431.3516433 – volume: 55 start-page: 58 issue: 1 year: 2005 ident: 10.1016/j.jpdc.2025.105134_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 – ident: 10.1016/j.jpdc.2025.105134_br0020 – volume: 31 start-page: 1095 issue: 3 year: 2006 ident: 10.1016/j.jpdc.2025.105134_br0330 article-title: An integrated efficient solution for computing frequent and top- k elements in data streams publication-title: ACM Trans. Database Syst. doi: 10.1145/1166074.1166084 – start-page: 268 year: 2017 ident: 10.1016/j.jpdc.2025.105134_br0040 article-title: A high-performance algorithm for identifying frequent items in data streams – volume: 1 start-page: 1530 issue: 2 year: 2008 ident: 10.1016/j.jpdc.2025.105134_br0140 article-title: Finding frequent items in data streams publication-title: VLDB Endow. doi: 10.14778/1454159.1454225 – volume: 18 issue: 9 year: 2025 ident: 10.1016/j.jpdc.2025.105134_br0470 article-title: Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing publication-title: Proc. VLDB Endow. – start-page: 167 year: 2018 ident: 10.1016/j.jpdc.2025.105134_br0110 article-title: Data summarization and distributed computation – start-page: 177 year: 2004 ident: 10.1016/j.jpdc.2025.105134_br0280 article-title: Data streaming algorithms for efficient and accurate estimation of flow size distribution – ident: 10.1016/j.jpdc.2025.105134_br0260 – volume: vol. 2461 start-page: 348 year: 2002 ident: 10.1016/j.jpdc.2025.105134_br0180 article-title: Frequency Estimation of Internet Packet Streams with Limited Space – volume: 68 start-page: 415 issue: 4 year: 2009 ident: 10.1016/j.jpdc.2025.105134_br0300 article-title: Frequent items in streaming data: an experimental evaluation of the state-of-the-art publication-title: Data Knowl. Eng. doi: 10.1016/j.datak.2008.11.001 – volume: 48 start-page: 317 issue: 1 year: 2013 ident: 10.1016/j.jpdc.2025.105134_br0230 article-title: Quantitative relaxation of concurrent data structures – volume: 21 start-page: 270 issue: 3 year: 2003 ident: 10.1016/j.jpdc.2025.105134_br0190 article-title: New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice publication-title: ACM Trans. Comput. Syst. doi: 10.1145/859716.859719 – year: 2017 ident: 10.1016/j.jpdc.2025.105134_br0320 – start-page: 1 year: 2020 ident: 10.1016/j.jpdc.2025.105134_br0240 article-title: Eraia-enabling intelligence data pipelines for iot-based application systems – year: 2003 ident: 10.1016/j.jpdc.2025.105134_br0390 – volume: 15 start-page: 1215 issue: 6 year: 2022 ident: 10.1016/j.jpdc.2025.105134_br0450 article-title: Spacesaving±: an optimal algorithm for frequency estimation and frequent items in the bounded-deletion model publication-title: Proc. VLDB Endow. doi: 10.14778/3514061.3514068 – volume: 29 start-page: 996 issue: 10 year: 1986 ident: 10.1016/j.jpdc.2025.105134_br0050 article-title: Min-max heaps and generalized priority queues publication-title: Commun. ACM doi: 10.1145/6617.6621 |
| SSID | ssj0011578 |
| Score | 2.4245262 |
| Snippet | The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified... |
| SourceID | swepub crossref elsevier |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 105134 |
| SubjectTerms | Computer and Information Sciences Data- och informationsvetenskap (Datateknik) |
| Title | QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements |
| URI | https://dx.doi.org/10.1016/j.jpdc.2025.105134 https://gup.ub.gu.se/publication/352301 https://research.chalmers.se/publication/547212 |
| Volume | 204 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwELYQvXDpi6JuC8gHxKVKdxM_EveGUNG2vBalSPRk2c4YFnWX1T4O5dDf3pk8UCvRHrgllq1YY3sezsz3MbbnQYBRhU5iyEIiq5wwIDON5yqk0VeFjjUZzOmZHl7Kr1fqao0ddrUwlFbZ6v5Gp9faum3pt9Lsz8bjfknGLxfE31MDpVFFuZQ57fKPvx7SPAhLpuigOKl3WzjT5HjdziqCMcwU0d2mQv7TOP2JIlpbnqOX7HnrMvKDZlav2BpMX7MXHR0Db0_nJvt-MTofleUnfrGC-U_uphUfuTlxpfwYLyb8HJXDZHwPFS8xToakdHSXwNFp5fWPa3qe14nVS04VJG7CocktX7xhl0efvx0Ok5Y5IQkyTZdJhYEtCDxQMZcqFkpFDIIjOh8xSiFUDlQA7zEQ9VkYDAIabXRTjDYGwESDXtkWW5_eTeEt406G3EQ_cK6Q0qmBlwG80WnIK8Lez3rsQycyO2sAMmyXOXZrScCWBGwbAfeY6qRq_1pmixr8v-P2myV4-AbBYl-vZhabrld2AVbQ_XbaYyePdGyBk25suKlZaRY0QOk8UDhlBVTayizzFrdmakE4DArJM9Xm3RPn-55t0FuT9bfN1pfzFeyg97L0u_X23GXPDr4cD89-A8yV7Z8 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKOcCFN2J5-gBcUNiNX4mROCCg2tJtu1VaqZyM49jtVt3tarMrVA78Kf4gM4lTgQQckHqLnDixPtvzcGa-IeR56bnXMldJcMwlosqQA5Ip2FcuDWWVq9AUg9neUcMD8elQHq6RH10uDIZVRtnfyvRGWseWfkSzP59M-gUqv4xj_Z6GKC2LkZVb_vwr-G31280PMMkvGNv4uP9-mMTSAokTabpMKvD8PIcVFzIhQy5lAC8xgHYOQXAuM48Z4iV4aiVzg4EDrQZ6XCutvddBg9kC771CrgoQF1g24fX3i7gSJK_JO-5PHF7M1GmDyk7mFfImMon1dVMu_qoNf6UtbVTdxi1yI9qo9F0Lw22y5md3yM2u_gON4uAu-bw33h0XxRu6t_KLc2pnFR3bBRZnOZ3UU7oL0mg6-eYrWoBj7pPC4uEFBSuZNn_K8XrRRHIvKaas2Cn1bTB7fY8cXAqe98n67GzmHxBqhct0KAfW5kJYOSiF86VWqcsqJPtnPfKqg8zMW0YO04WqnRgE2CDApgW4R2SHqvltXRlQGf_s97KdgotvIA_30WpuoOloZWpvOB6opz0y-sODkanp2LjjpgxOjR2kyhz6b4b7ShnBWGlgL6TGcwteKJrCSj_8z_E-I9eG-9sjM9rc2XpEruOdNuTwMVlfLlb-CZhOy_Jps1Qp-XLZe-Mn59AmbA |
| 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=QPOPSS%3A+Query+and+Parallelism+Optimized+Space-Saving+for+finding+frequent+stream+elements&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Jarlow%2C+Victor&rft.au=Stylianopoulos%2C+Charalampos&rft.au=Papatriantafilou%2C+Marina&rft.date=2025-10-01&rft.issn=1096-0848&rft.volume=204&rft_id=info:doi/10.1016%2Fj.jpdc.2025.105134&rft.externalDocID=oai_research_chalmers_se_567c5974_3ed6_422b_86f1_e3a625835269 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |