{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:19:58Z","timestamp":1758273598070,"version":"3.41.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"HKRGC","award":["GRF521012,GRF14200817,GRF15200715,GRF15204116"],"award-info":[{"award-number":["GRF521012,GRF14200817,GRF15200715,GRF15204116"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2019,3,31]]},"abstract":"<jats:p>\n            Many emerging applications are based on finding interesting subsequences from sequence data. Finding \u201cprominent streaks,\u201d a set of the longest contiguous subsequences with values all above (or below) a certain threshold, from sequence data is one of that kind that receives much attention. Motivated from real applications, we observe that prominent streaks alone are not insightful enough but require the discovery of something we coined as \u201chistoric moments\u201d as companions. In this article, we present an algorithm to efficiently compute historic moments from sequence data. The algorithm is\n            <jats:italic>incremental<\/jats:italic>\n            and\n            <jats:italic>space optimal<\/jats:italic>\n            , meaning that when facing new data arrival, it is able to efficiently refresh the results by keeping minimal information. Case studies show that historic moments can significantly improve the insights offered by prominent streaks alone. Furthermore, experiments show that our algorithm can outperform the baseline in both time and space.\n          <\/jats:p>","DOI":"10.1145\/3276975","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T13:16:22Z","timestamp":1548767782000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Historic Moments Discovery in Sequence Data"],"prefix":"10.1145","volume":"44","author":[{"given":"Ran","family":"Bai","sequence":"first","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University"}]},{"given":"Wing Kai","family":"Hon","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University"}]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chinese University of Hong Kong"}]},{"given":"Zhian","family":"He","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Hong Kong"}]},{"given":"Kenny","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University"}]}],"member":"320","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-015-9627-3"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1785\/0120050245"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_16"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"volume-title":"Intelligent Information Processing and Web Mining","author":"Chomicki Jan","key":"e_1_2_1_5_1","unstructured":"Jan Chomicki , Parke Godfrey , Jarek Gryz , and Dongming Liang . 2005. Skyline with presorting: Theory and optimizations . In Intelligent Information Processing and Web Mining . Springer , 595--604. Jan Chomicki, Parke Godfrey, Jarek Gryz, and Dongming Liang. 2005. Skyline with presorting: Theory and optimizations. In Intelligent Information Processing and Web Mining. Springer, 595--604."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001269.2001288"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733029"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020601"},{"key":"e_1_2_1_9_1","volume-title":"A survey of skyline query processing. arXiv preprint arXiv:1704.01788","author":"Kalyvas Christos","year":"2017","unstructured":"Christos Kalyvas and Theodoros Tzouramanis . 2017. A survey of skyline query processing. arXiv preprint arXiv:1704.01788 ( 2017 ). Christos Kalyvas and Theodoros Tzouramanis. 2017. A survey of skyline query processing. arXiv preprint arXiv:1704.01788 (2017)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287394"},{"key":"e_1_2_1_11_1","first-page":"69","article-title":"Efficient computation of group skyline queries on MapReduce","volume":"5","author":"Lin Ming-Yen","year":"2016","unstructured":"Ming-Yen Lin , Chao-Wen Yang , and Sue-Chen Hsueh . 2016 . Efficient computation of group skyline queries on MapReduce . GSTF Journal on Computing (JoC) 5 , 1 (2016), 69 -- 76 . Ming-Yen Lin, Chao-Wen Yang, and Sue-Chen Hsueh. 2016. Efficient computation of group skyline queries on MapReduce. GSTF Journal on Computing (JoC) 5, 1 (2016), 69--76.","journal-title":"GSTF Journal on Computing (JoC)"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872814"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816644"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645927.672217"},{"volume-title":"The Free Encyclopedia.","year":"2017","key":"e_1_2_1_16_1","unstructured":"Wikipedia. 2017. 2016 Taiwan earthquake \u2014 Wikipedia , The Free Encyclopedia. Retrieved from https:\/\/en.wikipedia.org\/w\/index.php?title&equals;2016_Taiwan_earthquake8oldid&equals;766638710 (accessed February 27, 2017 ). Wikipedia. 2017. 2016 Taiwan earthquake \u2014 Wikipedia, The Free Encyclopedia. Retrieved from https:\/\/en.wikipedia.org\/w\/index.php?title&equals;2016_Taiwan_earthquake8oldid&equals;766638710 (accessed February 27, 2017)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339762"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083623"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601439"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3276975","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3276975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:41Z","timestamp":1750208261000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3276975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3,31]]}},"alternative-id":["10.1145\/3276975"],"URL":"https:\/\/doi.org\/10.1145\/3276975","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"2017-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}