{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:28Z","timestamp":1740122308000,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006234","name":"Sandia National Laboratories","doi-asserted-by":"publisher","award":["218336","222383"],"award-info":[{"award-number":["218336","222383"]}],"id":[{"id":"10.13039\/100006234","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10586-021-03463-5","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T17:02:39Z","timestamp":1643043759000},"page":"2893-2914","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using advanced data structures to enable responsive security monitoring"],"prefix":"10.1007","volume":"25","author":[{"given":"Janet","family":"Vorobyeva","sequence":"first","affiliation":[]},{"given":"Daniel R.","family":"Delayo","sequence":"additional","affiliation":[]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[]},{"given":"Mart\u00edn","family":"Farach-Colton","sequence":"additional","affiliation":[]},{"given":"Prashant","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Cynthia A.","family":"Phillips","sequence":"additional","affiliation":[]},{"given":"Shikha","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Eric D.","family":"Thomas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3218-6412","authenticated-orcid":false,"given":"Thomas M.","family":"Kroeger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"3463_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Fineman, J.T., Fogel, Y.R., Kuszmaul, B.C., Nelson, J.: Cache-oblivious streaming B-trees. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 81\u201392. ACM (2007)","DOI":"10.1145\/1248377.1248393"},{"issue":"5","key":"3463_CR2","first-page":"22","volume":"40","author":"MA Bender","year":"2015","unstructured":"Bender, M.A., Farach-Colton, M., Jannen, W., Johnson, R., Kuszmaul, B.C., Porter, D.E., Yuan, J., Zhan, Y.: An introduction to B$$^{\\epsilon}$$-trees and write-optimization. Login USENIX Mag. 40(5), 22\u201328 (2015)","journal-title":"Login USENIX Mag."},{"key":"3463_CR3","unstructured":"Berry, J.W., Porter, A.M.: Stateful streaming in distributed memory supercomputers. In: Slides from an Invited Talk at the Chesapeake Large-Scale Analytics Conference (CLSAC), October 2016. Slides archived at OSTI (2016). https:\/\/www.osti.gov\/servlets\/purl\/1406959. Accessed 3 April 2018"},{"issue":"7","key":"3463_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"3463_CR5","unstructured":"Brodal, G.S., Fagerberg, R.: Lower bounds for external memory dictionaries. In: Proceedings of the Fourteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 546\u2013554. Society for Industrial and Applied Mathematics (2003)"},{"key":"3463_CR6","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Demaine, E.D., Fineman, J.T., Iacono, J., Langerman, S., Munro, J.I.: Cache-oblivious dynamic dictionaries with update\/query tradeoffs. In: Proceedings of the Twenty-First Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 1448\u20131456. SIAM (2010)","DOI":"10.1137\/1.9781611973075.117"},{"issue":"2","key":"3463_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. ACM Trans. Comput. Syst. 26(2), 4 (2008)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3463_CR8","doi-asserted-by":"crossref","unstructured":"Claise, B., Bryant, S.: Specification of the IP Flow Information Export (IPFIX) Protocol for the Exchange of IP Traffic Flow Information. Technical Report, RFC 5101, January (2008)","DOI":"10.17487\/rfc5101"},{"key":"3463_CR9","unstructured":"Dean, J., Ghemawat, S.: LevelDB: a fast and lightweight key\/value database library by Google (2021). http:\/\/code.google.com\/p\/leveldb\/"},{"key":"3463_CR10","unstructured":"DHS Cybersecurity and Infrastructure Security Agency (CISA): Einstein (2021). https:\/\/www.cisa.gov\/einstein"},{"key":"3463_CR11","unstructured":"Facebook: RocksDB (2021). https:\/\/github.com\/facebook\/rocksdb"},{"issue":"2","key":"3463_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"12","key":"3463_CR13","doi-asserted-by":"publisher","first-page":"3217","DOI":"10.14778\/3415478.3415546","volume":"13","author":"Y Matsunobu","year":"2020","unstructured":"Matsunobu, Y., Dong, S., Lee, H.: MyRocks: LSM-tree database storage engine serving Facebook\u2019s social graph. Proc. VLDB Endow. 13(12), 3217\u20133230 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"3463_CR14","unstructured":"NetFlow, Cisco Systems Inc: Netflow Services Solutions Guide. Cisco System, Inc. (2007). http:\/\/www.cisco.com\/en\/US\/docs\/ios\/solutions_docs\/netflow\/nfwhite.html"},{"issue":"4","key":"3463_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (LSM-tree). Acta Inform. 33(4), 351\u2013385 (1996)","journal-title":"Acta Inform."},{"key":"3463_CR16","doi-asserted-by":"crossref","unstructured":"Pandey, P., Singh, S., Bender, M.A., Berry, J.W., Farach-Colton, M., Johnson, R., Kroeger, T.M., Phillips, C.A.: Timely reporting of heavy hitters using external memory. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 1431\u20131446 (2020)","DOI":"10.1145\/3318464.3380598"},{"issue":"23","key":"3463_CR17","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1016\/S1389-1286(99)00112-7","volume":"31","author":"V Paxson","year":"1999","unstructured":"Paxson, V.: Bro: a system for detecting network intruders in real-time. Comput. Netw. 31(23), 2435\u20132463 (1999)","journal-title":"Comput. Netw."},{"key":"3463_CR18","doi-asserted-by":"crossref","unstructured":"Sarkar, S., Papon, T.I., Staratzis, D., Athanassoulis, M.: Lethe: a tunable delete-aware LSM engine. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 893\u2013908 (2020)","DOI":"10.1145\/3318464.3389757"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03463-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-021-03463-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03463-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T11:30:56Z","timestamp":1657798256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-021-03463-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,24]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["3463"],"URL":"https:\/\/doi.org\/10.1007\/s10586-021-03463-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2022,1,24]]},"assertion":[{"value":"17 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}