{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:26:42Z","timestamp":1726039602457},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030280604"},{"type":"electronic","value":"9783030280611"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-28061-1_21","type":"book-chapter","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:04:59Z","timestamp":1565082299000},"page":"199-211","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Query Associations Over Big Financial Knowledge Graph"],"prefix":"10.1007","author":[{"given":"Xiaofeng","family":"Ouyang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lujia","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,7]]},"reference":[{"key":"21_CR1","unstructured":"Bao, J.: How can knowledge graph help to realize intelligent finance. Gold Card Proj. (7), 45\u201349 (2016)"},{"key":"21_CR2","unstructured":"Chao, Y., Wang, H.: Developed Dijkstra shortest path search algorithm and simulation. In: International Conference on Computer Design and Applications, pp. V1-116\u2013V1-119. IEEE (2010)"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.503769","volume":"7","author":"JF Myoupo","year":"2002","unstructured":"Myoupo, J.F., Fabret, A.C.: A modular systolic linearization of the Warshall-Floyd algorithm. IEEE Trans. Parallel Distrib. Syst. 7(5), 449\u2013455 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"99","key":"21_CR4","first-page":"1","volume":"PP","author":"D Song","year":"1939","unstructured":"Song, D., Schilder, F., Hertz, S., et al.: Building and Querying an Enterprise Knowledge Graph. IEEE Trans. Serv. Comput. PP(99), 1 (1939)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Gao, J., Fu, X., Liang, Y., et al.: The construction of enterprise knowledge map based on business process. International Conference on Business Intelligence & Financial Engineering, pp. 285\u2013289. IEEE (2012)","DOI":"10.1109\/BIFE.2011.120"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Galkin, M., Auer, S., Scerri, S.: Enterprise knowledge graphs: a backbone of linked enterprise data. In: IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 497\u2013502. IEEE (2017)","DOI":"10.1109\/WI.2016.0083"},{"issue":"9","key":"21_CR7","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.3390\/su10093245","volume":"10","author":"T Wu","year":"2018","unstructured":"Wu, T., Qi, G., Li, C., et al.: A survey of techniques for constructing Chinese knowledge graphs and their applications. Sustainability 10(9), 3245 (2018)","journal-title":"Sustainability"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.websem.2009.07.002","volume":"7","author":"C Bizer","year":"2009","unstructured":"Bizer, C., et al.: Dbpedia-a crystallization point for the web of data. Web Seman.: Sci. Serv. Agents World Wide Web 7(3), 154\u2013165 (2009)","journal-title":"Web Seman.: Sci. Serv. Agents World Wide Web"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Balaji, J., Sunderraman, R.: Distributed graph path queries using spark. In: Computer Software and Applications Conference, pp. 326\u2013331. IEEE (2016)","DOI":"10.1109\/COMPSAC.2016.98"},{"issue":"18","key":"21_CR10","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1016\/j.artint.2011.07.003","volume":"175","author":"H Aljazzar","year":"2011","unstructured":"Aljazzar, H., Leue, S.: K*: a heuristic search algorithm for finding the k shortest paths. Artif. Intell. 175(18), 2129\u20132154 (2011)","journal-title":"Artif. Intell."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Yang, S., Han, F., Wu, Y., et al.: Fast top-k search in knowledge graphs. In: IEEE International Conference on Data Engineering, pp. 990\u20131001. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498307"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: a new algorithm and its implementation. ACM (2007)","DOI":"10.1145\/1290672.1290682"},{"issue":"11","key":"21_CR13","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the K shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."},{"issue":"3","key":"21_CR14","first-page":"42","volume":"18","author":"H Wang","year":"2004","unstructured":"Wang, H., Guoliu, H.: The role and efficiency of ownership structure in corporate governance-literature review and future research direction based on Chinese listed companies. J. Hunan Univ. (Soc. Sci. Ed.) 18(3), 42\u201347 (2004)","journal-title":"J. Hunan Univ. (Soc. Sci. Ed.)"},{"issue":"1","key":"21_CR15","first-page":"278","volume":"296","author":"E Nardelli","year":"2001","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding the most vital node of a shortest path. Theor. Comput. Sci. 296(1), 278\u2013287 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR16","unstructured":"Eppstein, D.: Finding the k shortest paths. In: Symposium on Foundations of Computer Science, pp. 154\u2013165. IEEE Computer Society (1994)"},{"issue":"37","key":"21_CR17","first-page":"28","volume":"4","author":"PE Hart","year":"1972","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(37), 28\u201329 (1972)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"2","key":"21_CR18","first-page":"121","volume":"1","author":"EQV Martins","year":"2003","unstructured":"Martins, E.Q.V., Pascoal, M.M.B.: A new implementation of Yens ranking loopless paths algorithm. Q. J. Belgian French Italian Oper. Res. Soc. 1(2), 121\u2013133 (2003)","journal-title":"Q. J. Belgian French Italian Oper. Res. Soc."},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-44867-5_14","volume-title":"Experimental and Efficient Algorithms","author":"VM Jim\u00e9nez","year":"2003","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: A lazy version of Eppstein\u2019s K shortest paths algorithm. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 179\u2013191. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/3-540-44867-5_14"}],"container-title":["Lecture Notes in Computer Science","Big Scientific Data Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28061-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:13:25Z","timestamp":1565082805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-28061-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030280604","9783030280611"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28061-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"7 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BigSDM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Scientific Data Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigsdm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bigsdm2018.csdata.org\/","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"24","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":"7","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":"28% - 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":"3","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)"}}]}}