{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:40:17Z","timestamp":1743090017509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319682815"},{"type":"electronic","value":"9783319682822"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68282-2_2","type":"book-chapter","created":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T02:04:40Z","timestamp":1506996280000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Injective Mapping Between Relations in Astrophysics Databases"],"prefix":"10.1007","author":[{"given":"Nicu-Razvan","family":"Stancioiu","sequence":"first","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Petit","sequence":"additional","affiliation":[]},{"given":"Vasile-Marian","family":"Scuturici","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Fouchez","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Gangler","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Gris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,4]]},"reference":[{"key":"2_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Upper Saddle River (1993)"},{"key":"2_CR2","unstructured":"Bertsekas, D.P.: A distributed algorithm for the assignment problem (1979)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Origins of the simplex method. In: Dantzig, G.B. (ed.) A History of Scientific Computing, pp. 141\u2013151. ACM, New York (1990)","DOI":"10.1145\/87252.88081"},{"key":"2_CR4","unstructured":"Dawes, M.: The optimal assignment problem (2012)"},{"key":"2_CR5","unstructured":"Diallo, T., Petit, J.-M., Servigne, S.: Discovering editing rules for data cleaning. In: 10th International Workshop on Quality in Databases in Conjunction with VLDB (Very Large Databases), pp. 1\u20138, August 2012"},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/TKDE.2010.154","volume":"23","author":"W Fan","year":"2011","unstructured":"Fan, W., Geerts, F., Li, J., Xiong, M.: Discovering conditional functional dependencies. IEEE Trans. Knowl. Data Eng. 23(5), 683\u2013698 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00778-011-0253-7","volume":"21","author":"W Fan","year":"2012","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Yu, W.: Towards certain fixes with editing rules and master data. VLDB J. 21(2), 213\u2013238 (2012)","journal-title":"VLDB J."},{"key":"2_CR8","unstructured":"Golin, M.J.: Bipartite matching and the Hungarian method (2006)"},{"key":"2_CR9","unstructured":"Khuller, S.: Design and analysis of algorithms: Course notes (1998)"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M Klein","year":"1967","unstructured":"Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manage. Sci. 14(3), 205\u2013220 (1967)","journal-title":"Manage. Sci."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nav.3800030404","volume":"3","author":"HW Kuhn","year":"1956","unstructured":"Kuhn, H.W.: Variants of the Hungarian method for assignment problems. Naval Res. Logist. Q. 3, 253\u2013258 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"2_CR13","volume-title":"Combinatorial Optimization: Networks and Matroids. Dover Books on Mathematics Series Mineola","author":"E Lawler","year":"2001","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Dover Books on Mathematics Series Mineola. Dover Publications, Mineola (2001)"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-349-7","volume-title":"A Guided Tour of Relational Databases and Beyond","author":"M Levene","year":"1999","unstructured":"Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, London (1999). doi: 10.1007\/978-0-85729-349-7"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45876-X_30","volume-title":"Advances in Database Technology \u2014 EDBT 2002","author":"F Marchi","year":"2002","unstructured":"Marchi, F., Lopes, S., Petit, J.-M.: Efficient algorithms for mining inclusion dependencies. In: Jensen, C.S., \u0160altenis, S., Jeffery, K.G., Pokorny, J., Bertino, E., B\u00f6hn, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 464\u2013476. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45876-X_30"},{"issue":"12","key":"2_CR16","first-page":"1860","volume":"8","author":"T Papenbrock","year":"2015","unstructured":"Papenbrock, T., Bergmann, T., Finke, M., Zwiener, J., Naumann, F.: Data profiling with metanome. PVLDB 8(12), 1860\u20131863 (2015)","journal-title":"PVLDB"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1145\/22952.22956","volume":"12","author":"RT Snodgrass","year":"1987","unstructured":"Snodgrass, R.T.: The temporal query language TQUEL. ACM Trans. Database Syst. 12(2), 247\u2013298 (1987)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Communications in Computer and Information Science","Information Search, Integration, and Personlization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68282-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,18]],"date-time":"2020-10-18T16:16:14Z","timestamp":1603037774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68282-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319682815","9783319682822"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68282-2_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"4 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}