{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:46:07Z","timestamp":1725882367625},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319556987"},{"type":"electronic","value":"9783319556994"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55699-4_41","type":"book-chapter","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:56:53Z","timestamp":1490068613000},"page":"649-660","source":"Crossref","is-referenced-by-count":0,"title":["Edge Influence Computation in Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Yongrui","family":"Qin","sequence":"first","affiliation":[]},{"given":"Quan Z.","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Parkinson","sequence":"additional","affiliation":[]},{"given":"Nickolas J. G.","family":"Falkner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Dyreson, C.E., Li, F., Tamer \u00d6zsu, M. (eds.) SIGMOD Conference 2014, Snowbird, UT, USA, pp. 1323\u20131334, 22-27 June 2014. doi: 10.1145\/2588555.2612181 . http:\/\/dl.acm.org\/citation.cfm?id=2588555","DOI":"10.1145\/2588555.2612181"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Cheng, J., et al.: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph. In: Proceedings of the International Conference on Management of Data. ACM (2013)","DOI":"10.1145\/2463676.2465286"},{"key":"41_CR3","unstructured":"Wang, H., et al.: Dual labeling: answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006. IEEE (2006)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases, vol. 18, no. 2. ACM (1989)","DOI":"10.1145\/66926.66950"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Jin, R., et al.: Efficiently answering reachability queries on very large directed graphs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM (2008)","DOI":"10.1145\/1376616.1376677"},{"issue":"4","key":"41_CR6","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/99935.99944","volume":"15","author":"HV Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. (TODS) 15(4), 558\u2013598 (1990)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"5","key":"41_CR7","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., et al.: Reachability, distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"41_CR8","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1109\/TKDE.2009.117","volume":"22","author":"R Bramandia","year":"2010","unstructured":"Bramandia, R., Choi, B., Ng, W.K.: Incremental maintenance of 2-hop labeling of large graphs. IEEE Trans. Knowl. Data Eng. 22(5), 682\u2013698 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"41_CR9","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Dagger: a scalable index for reachability queries in large dynamic graphs. arXiv preprint arXiv:1301.0977 (2013)"},{"key":"41_CR10","unstructured":"Leskovec, J.: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data\/index.html"},{"issue":"1","key":"41_CR11","first-page":"276","volume":"3","author":"H Yildirim","year":"2010","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: GRAIL: scalable reachability index for large graphs. PVLDB 3(1), 276\u2013284 (2010)","journal-title":"PVLDB"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD, pp. 913\u2013924 (2011)","DOI":"10.1145\/1989323.1989419"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S.J., Weikum, G.: Ferrari: flexible and efficient reachability range assignment for graph indexing. In: ICDE, pp. 1009\u20131020 (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In: ICDE, pp. 360\u2013371 (2005)","DOI":"10.1109\/ICDE.2005.57"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55699-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:49:55Z","timestamp":1568940595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55699-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319556987","9783319556994"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55699-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}