{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:31:21Z","timestamp":1725831081096},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252544"},{"type":"electronic","value":"9783319252551"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25255-1_46","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T05:39:46Z","timestamp":1443073186000},"page":"560-572","source":"Crossref","is-referenced-by-count":0,"title":["AILabel: A Fast Interval Labeling Approach for Reachability Query on Very Large Graphs"],"prefix":"10.1007","author":[{"given":"Feng","family":"Shuo","sequence":"first","affiliation":[]},{"given":"Xie","family":"Ning","sequence":"additional","affiliation":[]},{"given":"Shen","family":"de-Rong","sequence":"additional","affiliation":[]},{"given":"Li","family":"Nuo","sequence":"additional","affiliation":[]},{"given":"Kou","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,13]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and mining graph data","author":"C.C. Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Wang, H.: Managing and mining graph data. Springer, Heidelberg (2010)"},{"key":"46_CR2","first-page":"937","volume-title":"Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"E. Cohen","year":"2002","unstructured":"Cohen, E., Halperin, E., Kaplan, H., et al.: Reachability and distance queries via 2-hop labels. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937\u2013946. ACM Press, Philadelphia (2002)"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/11687238_56","volume-title":"Advances in Database Technology - EDBT 2006","author":"J. Cheng","year":"2006","unstructured":"Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In: Ioannidis, Y., et al. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 961\u2013979. Springer, Heidelberg (2006)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/1353343.1353370","volume-title":"Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology","author":"J. Cheng","year":"2008","unstructured":"Cheng, J., Yu, J.X., Lin, X., et al.: Fast computing reachability labelings for large graphs with high compression rate. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 193\u2013204. ACM Press, New York (2008)"},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1145\/1559845.1559930","volume-title":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data","author":"R. Jin","year":"2009","unstructured":"Jin, R., Xiang, Y., Ruan, N., et al.: 3-hop: a high-compression indexing scheme for reachability query. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 813\u2013826. ACM Press, New York (2009)"},{"key":"46_CR6","first-page":"122","volume-title":"Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing","author":"P.F. Dietz","year":"1982","unstructured":"Dietz, P.F.: Maintaining order in a linked list. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 122\u2013127. ACM Press, New York (1982)"},{"issue":"4","key":"46_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","volume":"21","author":"H. Y\u0131ld\u0131r\u0131m","year":"2012","unstructured":"Y\u0131ld\u0131r\u0131m, H., Chaoji, V., Zaki, M.J.: GRAIL: a scalable index for reachability queries in very large graphs. The VLDB Journal\u2014The International Journal on Very Large Data Bases\u00a021(4), 509\u2013534 (2012)","journal-title":"The VLDB Journal\u2014The International Journal on Very Large Data Bases"},{"key":"46_CR8","first-page":"75","volume-title":"Proceedings of the 22nd International Conference on Data Engineering","author":"H. Wang","year":"2006","unstructured":"Wang, H., He, H., Yang, J., et al.: Dual labeling: Answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering, pp. 75\u201375. IEEE, Washington, DC (2006)"},{"issue":"1-2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/1920841.1920879","volume":"3","author":"H. Yildirim","year":"2010","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: Scalable reachability index for large graphs. Proceedings of the VLDB Endowment\u00a03(1-2), 276\u2013284 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"46_CR10","first-page":"1009","volume-title":"Proceedings of the 2013 IEEE International Conference on Data Engineering","author":"S. Seufert","year":"2013","unstructured":"Seufert, S., Anand, A., Bedathur, S., et al.: Ferrari: Flexible and efficient reachability range assignment for graph indexing. In: Proceedings of the 2013 IEEE International Conference on Data Engineering, pp. 1009\u20131020. IEEE, Washington, DC (2013)"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/1247480.1247573","volume-title":"Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data","author":"S. Tri\u00dfl","year":"2007","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 845\u2013856. ACM Press, New York (2007)"},{"key":"46_CR12","unstructured":"Ning, X., De-Rong, S., Shuo, F., et al.: RIAIL: An Index Method for Reachability Query in Large Scale Graphs. Journal of Software\u00a025(Suppl. (2)), 213\u2013224 (2014)"},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1145\/2247596.2247651","volume-title":"Proceedings of the 15th International Conference on Extending Database Technology","author":"Z. Zhang","year":"2012","unstructured":"Zhang, Z., Yu, J.X., Qin, L., et al.: I\/O cost minimization: reachability queries processing over massive graphs. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 468\u2013479. ACM Press, New York (2012)"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/67544.66950","volume-title":"Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1989","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, pp. 253\u2013262. ACM Press, New York (1989)"},{"key":"46_CR15","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J., Dagger, Z.M.J.: A scalable index for reachability queries in large dynamic graphs[EB\/OL] (2014). http:\/\/arxiv.org\/abs\/1301.0977"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25255-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T05:40:03Z","timestamp":1653198003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25255-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252544","9783319252551"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25255-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}