乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T06:03:55Z","timestamp":1732341835277,"version":"3.28.0"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1016\/j.ins.2024.121624","type":"journal-article","created":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T05:31:38Z","timestamp":1731130298000},"page":"121624","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["LSketch: A label-enabled graph stream sketch toward time-sensitive queries"],"prefix":"10.1016","volume":"691","author":[{"given":"Yiling","family":"Zeng","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8766-4023","authenticated-orcid":false,"given":"Chuanfeng","family":"Jian","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5715-5092","authenticated-orcid":false,"given":"Chunyao","family":"Song","sequence":"additional","affiliation":[]},{"given":"Tingjian","family":"Ge","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1324-5819","authenticated-orcid":false,"given":"Yuhan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yuqing","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2007","series-title":"Data Streams: Models and Algorithms, vol. 31","author":"Aggarwal","key":"10.1016\/j.ins.2024.121624_br0010"},{"key":"10.1016\/j.ins.2024.121624_br0020","series-title":"Social Network Data Analytics","first-page":"1","article-title":"An introduction to social network data analytics","author":"Aggarwal","year":"2011"},{"issue":"1-2","key":"10.1016\/j.ins.2024.121624_br0030","doi-asserted-by":"crossref","first-page":"975","DOI":"10.14778\/1920841.1920964","article-title":"On dense pattern mining in graph streams","volume":"3","author":"Aggarwal","year":"2010","journal-title":"Proc. VLDB Endow."},{"year":"2010","series-title":"Managing and Mining Graph Data, vol. 40","author":"Aggarwal","key":"10.1016\/j.ins.2024.121624_br0040"},{"issue":"1","key":"10.1016\/j.ins.2024.121624_br0050","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jcss.1997.1545","article-title":"The space complexity of approximating the frequency moments","volume":"58","author":"Alon","year":"1999","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ins.2024.121624_br0060","series-title":"SODA","first-page":"623","article-title":"Reductions in streaming algorithms, with an application to counting triangles in graphs","volume":"vol. 2","author":"Bar-Yossef","year":"2002"},{"key":"10.1016\/j.ins.2024.121624_br0070","series-title":"IEEE INFOCOM 2016-the 35th Annual IEEE International Conference on Computer Communications","first-page":"1","article-title":"Heavy hitters in streams and sliding windows","author":"Ben-Basat","year":"2016"},{"key":"10.1016\/j.ins.2024.121624_br0080","series-title":"Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","first-page":"253","article-title":"Counting triangles in data streams","author":"Buriol","year":"2006"},{"key":"10.1016\/j.ins.2024.121624_br0090","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"487","article-title":"Finding recent frequent itemsets adaptively over online data streams","author":"Chang","year":"2003"},{"issue":"1","key":"10.1016\/j.ins.2024.121624_br0100","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","article-title":"Finding frequent items in data streams","volume":"312","author":"Charikar","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2024.121624_br0110","series-title":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","first-page":"100","article-title":"Scube: efficient summarization for skewed graph streams","author":"Chen","year":"2022"},{"key":"10.1016\/j.ins.2024.121624_br0120","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","article-title":"An improved data stream summary: the count-min sketch and its applications","volume":"55","author":"Cormode","year":"2005","journal-title":"J. Algorithms"},{"key":"10.1016\/j.ins.2024.121624_br0130","series-title":"Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","first-page":"271","article-title":"Space efficient mining of multigraph streams","author":"Cormode","year":"2005"},{"key":"10.1016\/j.ins.2024.121624_br0140","series-title":"European Symposium on Algorithms","first-page":"337","article-title":"Dynamic graphs in the sliding-window model","author":"Crouch","year":"2013"},{"issue":"6","key":"10.1016\/j.ins.2024.121624_br0150","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1137\/S0097539701398363","article-title":"Maintaining stream statistics over sliding windows","volume":"31","author":"Datar","year":"2002","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.ins.2024.121624_br0160","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/859716.859719","article-title":"New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice","volume":"21","author":"Estan","year":"2003","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2\u20133","key":"10.1016\/j.ins.2024.121624_br0170","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","article-title":"On graph problems in a semi-streaming model","volume":"348","author":"Feigenbaum","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2024.121624_br0180","series-title":"International Symposium on Algorithms and Computation","first-page":"163","article-title":"On estimating path aggregates over streaming graphs","author":"Ganguly","year":"2006"},{"key":"10.1016\/j.ins.2024.121624_br0190","series-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE)","first-page":"1118","article-title":"Fast and accurate graph stream summarization","author":"Gou","year":"2019"},{"key":"10.1016\/j.ins.2024.121624_br0200","article-title":"Graph stream sketch: summarizing graph streams with high speed and accuracy","author":"Gou","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.121624_br0210","series-title":"Proceedings of the 30th International Conference on Scientific and Statistical Database Management","first-page":"1","article-title":"Sbg-sketch: a self-balanced sketch for labeled-graph stream summarization","author":"Hassan","year":"2018"},{"key":"10.1016\/j.ins.2024.121624_br0220","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2021.108403","article-title":"Dmatrix: toward fast and accurate queries in graph stream","volume":"198","author":"Hou","year":"2021","journal-title":"Comput. Netw."},{"key":"10.1016\/j.ins.2024.121624_br0230","series-title":"Latin American Symposium on Theoretical Informatics","first-page":"699","article-title":"Finding heavy hitters over the sliding window of a weighted data stream","author":"Hung","year":"2008"},{"issue":"6","key":"10.1016\/j.ins.2024.121624_br0240","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.14778\/3583140.3583154","article-title":"Auxo: a scalable and efficient graph stream summarization structure","volume":"16","author":"Jiang","year":"2023","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"10.1016\/j.ins.2024.121624_br0250","doi-asserted-by":"crossref","first-page":"301","DOI":"10.14778\/1453856.1453892","article-title":"Sliding-window top-k queries on uncertain streams","volume":"1","author":"Jin","year":"2008","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.121624_br0260","series-title":"2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","first-page":"130","article-title":"Query-friendly compression of graph streams","author":"Khan","year":"2016"},{"key":"10.1016\/j.ins.2024.121624_br0270","series-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"719","article-title":"Maintaining sliding-window neighborhood profiles in interaction networks","author":"Kumar","year":"2015"},{"author":"Leskovec","key":"10.1016\/j.ins.2024.121624_br0280"},{"issue":"225","key":"10.1016\/j.ins.2024.121624_br0290","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1090\/S0025-5718-99-00996-5","article-title":"Tables of linear congruential generators of different sizes and good lattice structure","volume":"68","author":"L'ecuyer","year":"1999","journal-title":"Math. Comput."},{"key":"10.1016\/j.ins.2024.121624_br0300","series-title":"VLDB'02: Proceedings of the 28th International Conference on Very Large Databases","first-page":"346","article-title":"Approximate frequency counts over data streams","author":"Manku","year":"2002"},{"issue":"1","key":"10.1016\/j.ins.2024.121624_br0310","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2627692.2627694","article-title":"Graph stream algorithms: a survey","volume":"43","author":"McGregor","year":"2014","journal-title":"ACM SIGMOD Rec."},{"issue":"3","key":"10.1016\/j.ins.2024.121624_br0320","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00778-015-0382-5","article-title":"Conditional heavy hitters: detecting interesting correlations in data streams","volume":"24","author":"Mirylenka","year":"2015","journal-title":"VLDB J."},{"issue":"10","key":"10.1016\/j.ins.2024.121624_br0330","doi-asserted-by":"crossref","DOI":"10.14778\/2336664.2336672","article-title":"Sketch-based querying of distributed sliding-window data streams","volume":"5","author":"Papapetrou","year":"2012","journal-title":"Proc. VLDB Endow."},{"issue":"14","key":"10.1016\/j.ins.2024.121624_br0340","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.14778\/2556549.2556569","article-title":"Counting and sampling triangles from a graph stream","volume":"6","author":"Pavan","year":"2013","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.121624_br0350","series-title":"Proceedings of the 2016 International Conference on Management of Data","first-page":"1449","article-title":"Augmented sketch: faster and more accurate stream processing","author":"Roy","year":"2016"},{"issue":"3","key":"10.1016\/j.ins.2024.121624_br0360","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970397","article-title":"Estimating pagerank on graph streams","volume":"58","author":"Sarma","year":"2011","journal-title":"J. ACM"},{"key":"10.1016\/j.ins.2024.121624_br0370","series-title":"2017 IEEE International Conference on Data Mining (ICDM)","first-page":"1087","article-title":"Wrs: waiting room sampling for accurate triangle counting in real graph streams","author":"Shin","year":"2017"},{"key":"10.1016\/j.ins.2024.121624_br0380","series-title":"Proceedings of the 2016 International Conference on Management of Data","first-page":"1417","article-title":"Time adaptive sketches (ada-sketches) for summarizing data streams","author":"Shrivastava","year":"2016"},{"key":"10.1016\/j.ins.2024.121624_br0390","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/j.ins.2019.07.019","article-title":"Labeled graph sketches: keeping up with real-time graph streams","volume":"503","author":"Song","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2024.121624_br0400","series-title":"Proceedings of the 2016 International Conference on Management of Data","article-title":"Graph stream summarization: from Big Bang to Big Crunch","author":"Tang","year":"2016"},{"issue":"2","key":"10.1016\/j.ins.2024.121624_br0410","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TKDE.2018.2884471","article-title":"Scalable dynamic graph summarization","volume":"32","author":"Tsalouchidou","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"10.1016\/j.ins.2024.121624_br0420","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.14778\/3137628.3137652","article-title":"Pyramid sketch: a sketch framework for frequency estimation of data streams","volume":"10","author":"Yang","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.121624_br0430","doi-asserted-by":"crossref","first-page":"193","DOI":"10.14778\/2078331.2078335","article-title":"gsketch: on query estimation in graph streams","volume":"5","author":"Zhao","year":"2011","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2024.121624_br0440","first-page":"16","article-title":"The ethical implications of dall-e: opportunities and challenges","volume":"2023","author":"Zhou","year":"2023","journal-title":"Mesop. J. Comput. Sci."},{"issue":"3","key":"10.1016\/j.ins.2024.121624_br0450","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3366699","article-title":"Generalized sketch families for network traffic measurement","volume":"3","author":"Zhou","year":"2019","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002552401538X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002552401538X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T02:58:17Z","timestamp":1732330697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002552401538X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":45,"alternative-id":["S002002552401538X"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2024.121624","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"LSketch: A label-enabled graph stream sketch toward time-sensitive queries","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2024.121624","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"121624"}}