{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:58:54Z","timestamp":1742947134281,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251573"},{"type":"electronic","value":"9783031251580"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25158-0_39","type":"book-chapter","created":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T21:37:20Z","timestamp":1676324240000},"page":"477-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LSM-Subgraph: Log-Structured Merge-Subgraph for\u00a0Temporal Graph Processing"],"prefix":"10.1007","author":[{"given":"Jingyuan","family":"Ma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1121","authenticated-orcid":false,"given":"Zhan","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Shang","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1746-7259","authenticated-orcid":false,"given":"Wang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yutong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Hu, H.: An adaptive packed-memory array. In: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 20\u201329. PODS (2006)","DOI":"10.1145\/1142351.1142355"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"De Leo, D., Boncz, P.: Packed memory arrays - rewired. In: 2019 IEEE 35th International Conference on Data Engineering, pp. 830\u2013841 (2019)","DOI":"10.1109\/ICDE.2019.00079"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Han, W., et al.: Chronos: a graph engine for temporal graph analysis. In: Proceedings of the Ninth European Conference on Computer Systems. EuroSys (2014)","DOI":"10.1145\/2592798.2592799"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Haubenschild, M., Then, M., Hong, S., Chafi, H.: Asgraph: a mutable multi-versioned graph container with high analytical performance. In: Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems, pp. 1\u20136 (2016)","DOI":"10.1145\/2960414.2960422"},{"issue":"3","key":"39_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Itai, A., Konheim, A.G., Rodeh, M.: A sparse table implementation of priority queues. In: Proceedings of the 8th Colloquium on Automata, Languages and Programming, pp. 417\u2013431 (1981)","DOI":"10.1007\/3-540-10843-2_34"},{"key":"39_CR7","unstructured":"Ju, X., Williams, D., Jamjoom, H., Shin, K.G.: Version traveler: fast and memory-efficient version switching in graph processing systems. In: 2016 $$\\{$$USENIX$$\\}$$ Annual Technical Conference ($$\\{$$USENIX$$\\}$$$$\\{$$ATC$$\\}$$ 2016), pp. 523\u2013536 (2016)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data (2013)","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"39_CR9","unstructured":"Kumar, P., Huang, H.H.: Graphone: a data store for real-time analytics on evolving graphs. ACM Trans. Storage (2020)"},{"key":"39_CR10","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a PC. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2012), pp. 31\u201346, October 2012"},{"key":"39_CR11","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Macko, P., Marathe, V.J., Margo, D.W., Seltzer, M.I.: Llama: efficient graph analytics using large multiversioned arrays. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 363\u2013374 (2015)","DOI":"10.1109\/ICDE.2015.7113298"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Mariappan, M., Vora, K.: Graphbolt: dependency-driven synchronous processing of streaming graphs. In: Proceedings of the Fourteenth EuroSys Conference 2019. EuroSys (2019)","DOI":"10.1145\/3302424.3303974"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Nilakant, K., Dalibard, V., Roy, A., Yoneki, E.: Prefedge: SSD prefetcher for large-scale graph traversal. In: Proceedings of International Conference on Systems and Storage, pp. 1\u201312. SYSTOR (2014)","DOI":"10.1145\/2611354.2611365"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Ren, C., Lo, E., Kao, B., Zhu, X., Cheng, R.: On querying historical evolving graph sequences. VLDB, 726\u2013737 (2011)","DOI":"10.14778\/3402707.3402713"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 135\u2013146 (2013)","DOI":"10.1145\/2442516.2442530"},{"issue":"3","key":"39_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s41019-020-00118-0","volume":"5","author":"LF Sikos","year":"2020","unstructured":"Sikos, L.F., Philp, D.: Provenance-aware knowledge representation: a survey of data models and contextualized knowledge graphs. Data Sci. Eng. 5(3), 293\u2013316 (2020)","journal-title":"Data Sci. Eng."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Then, M., Kersten, T., G\u00fcnnemann, S., Kemper, A., Neumann, T.: Automatic algorithm transformation for efficient multi-snapshot analytics on temporal graphs. VLDB, 877\u2013888 (2017)","DOI":"10.14778\/3090163.3090166"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Toss, J., Pahins, C.A.L., Raffin, B., Comba, J.L.D.: Packed-memory quadtree: a cache-oblivious data structure for visual exploration of streaming spatiotemporal big data. Comput. Graph. 76(NOV.), 117\u2013128 (2018)","DOI":"10.1016\/j.cag.2018.09.005"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Wu, H., Zhao, Y., Cheng, J., Yan, D.: Efficient processing of growing temporal graphs. In: DASFAA, pp. 387\u2013403 (2017)","DOI":"10.1007\/978-3-319-55699-4_24"},{"issue":"2","key":"39_CR21","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s41019-021-00154-4","volume":"6","author":"J Yang","year":"2021","unstructured":"Yang, J., Yao, W., Zhang, W.: Keyword search on large graphs: a survey. Data Sci. Eng. 6(2), 142\u2013162 (2021)","journal-title":"Data Sci. Eng."},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Ying, T., Chen, H., Jin, H.: Pensieve: skewness-aware version switching for efficient graph processing. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 699\u2013713 (2020)","DOI":"10.1145\/3318464.3380590"},{"key":"39_CR23","unstructured":"Zuckerberg, M.: Facebook (2004). http:\/\/www.facebook.com"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25158-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T19:10:36Z","timestamp":1689880236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25158-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251573","9783031251580"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25158-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}