{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:07:18Z","timestamp":1742972838759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319942889"},{"type":"electronic","value":"9783319942896"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94289-6_28","type":"book-chapter","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T11:30:15Z","timestamp":1529321415000},"page":"437-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Min-Forest: Fast Reachability Indexing Approach for Large-Scale Graphs on Spark Platform"],"prefix":"10.1007","author":[{"given":"Liu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongyong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhigang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifang","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/MCOM.2017.1600309","volume":"55","author":"B Cheng","year":"2017","unstructured":"Cheng, B., Zhai, Z., Zhao, S., Chen, J.: LSMP: a lightweight services mashup platform for ordinary-users. IEEE Commun. Mag. 55(4), 116\u2013122 (2017)","journal-title":"IEEE Commun. Mag."},{"issue":"5","key":"28_CR2","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1109\/TKDE.2016.2645769","volume":"29","author":"B Cheng","year":"2017","unstructured":"Cheng, B., Li, C., Chen, J.: A web services discovery approach based on interface underlying semantics mining. IEEE Trans. Knowl. Data Eng. 29(5), 950\u2013962 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3886-01","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-1-4471-3886-01","edition":"2"},{"key":"28_CR4","unstructured":"Linking Open Data (2018). http:\/\/www.w3.org\/wiki\/SweoIG\/TaskFores\/CommunityProjects\/Lin-kingOpenData. Accessed 8 Mar 2018"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","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. 15(4), 558\u2013598 (1990)","journal-title":"ACM Trans. Database Syst."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: 24th ICDE Proceedings, pp. 893\u2013902. IEEE, New York (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/66926.66950","volume":"18","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: ACM SIGMOD Proceedings, pp. 253\u2013262. ACM, New York (1989)","journal-title":"ACM SIGMOD Record"},{"key":"28_CR8","unstructured":"Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: answering graph reachability queries in constant time. In: 22th ICDE Proceedings, pp. 1\u201312. IEEE, New York (2006)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: 8th SIGMOD Proceedings, pp. 595\u2013608. ACM, New York (2008)","DOI":"10.1145\/1376616.1376677"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/1929934.1929941","volume":"36","author":"R Jin","year":"2011","unstructured":"Jin, R., Ruan, N., Xiang, Y., Wang, H.: Path-tree: an efficient reachability indexing scheme for large directed graphs. ACM Trans. Database Syst. 36(1), 73\u201384 (2011)","journal-title":"ACM Trans. Database Syst."},{"issue":"5","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: 9th ACM SIGMOD Proceedings, pp. 813\u2013826. ACM, New York (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Cai, J., Poon, C.K.: Path-hop: efficiently indexing large graphs for reachability queries. In: 10th CIKM Proceedings, pp. 119\u2013128. ACM, New York (2010)","DOI":"10.1145\/1871437.1871457"},{"issue":"4","key":"28_CR14","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","volume":"21","author":"H Yildirim","year":"2012","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: GRAIL: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509\u2013534 (2012)","journal-title":"VLDB J."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S., Weikum, G.: FERRARI: flexible and efficient reachability range assignment for graph indexing. In: 13th ICDE Proceedings, pp. 1009\u20131020. IEEE, New York (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Jin, R., Ruan, N., Dey, S., Xu, J.Y.: SCARAB: scaling reachability computation on large graphs. In: 12th SIGMOD Proceedings, pp. 169\u2013180. ACM, New York (2012)","DOI":"10.1145\/2213836.2213856"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/TKDE.2016.2631160","volume":"29","author":"J Su","year":"2017","unstructured":"Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29(3), 683\u2013697 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR18","unstructured":"Spark GraphX Homepage. http:\/\/spark.apache.org\/graphx\/. Accessed 12 Dec 2017"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-319-48740-3_29","volume-title":"Web Information Systems Engineering \u2013 WISE 2016","author":"L Yang","year":"2016","unstructured":"Yang, L., Yang, L., Niu, J., Hu, Z., Long, J., Zheng, M.: A semantic data parallel query method based on hadoop. In: Cellary, W., Mokbel, Mohamed F., Wang, J., Wang, H., Zhou, R., Zhang, Y. (eds.) WISE 2016. LNCS, vol. 10041, pp. 396\u2013404. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48740-3_29"}],"container-title":["Lecture Notes in Computer Science","Web Services \u2013 ICWS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94289-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:36:23Z","timestamp":1710243383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94289-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319942889","9783319942896"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94289-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"19 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICWS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icws2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icws.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"www.confhub.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","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":"31","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":"1","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":"27% - 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":"4","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}