{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:44Z","timestamp":1750307924602,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1247480.1247499","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["FICSR"],"prefix":"10.1145","author":[{"given":"Yan","family":"Qi","sequence":"first","affiliation":[{"name":"ASU, Tempe, AZ"}]},{"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[{"name":"ASU, Tempe, AZ"}]},{"given":"Maria Luisa","family":"Sapino","sequence":"additional","affiliation":[{"name":"U. of Torino, Torino, Italy"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274239"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065171"},{"key":"e_1_3_2_1_3_1","volume-title":"VLDB","author":"Banjelloun O.","year":"2006","unstructured":"O. Banjelloun , A. D. Sarma , A. Halevy , and J. Widom . ULDBs: Databases with uncertainty and lineage . In VLDB , 2006 . O. Banjelloun, A. D. Sarma, A. Halevy, and J. Widom. ULDBs: Databases with uncertainty and lineage. In VLDB, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147376.1147391"},{"key":"e_1_3_2_1_5_1","volume-title":"VLDB","author":"Bonifati A.","year":"2005","unstructured":"A. Bonifati , E. Chang , and L. Lakshmanan . Heptox: Marrying XML and heterogeneity in your P2P databases . In VLDB , 2005 . A. Bonifati, E. Chang, and L. Lakshmanan. Heptox: Marrying XML and heterogeneity in your P2P databases. In VLDB, 2005."},{"volume-title":"COWL: Contextualizing Ontologies. ISWC'03","author":"Bouquet P.","key":"e_1_3_2_1_6_1","unstructured":"P. Bouquet , F. Giunchiglia , F. van Harmelen , L. Serafini , and H. Stuckenschmidt . COWL: Contextualizing Ontologies. ISWC'03 . P. Bouquet, F. Giunchiglia, F. van Harmelen, L. Serafini, and H. Stuckenschmidt. COWL: Contextualizing Ontologies. ISWC'03."},{"key":"e_1_3_2_1_7_1","unstructured":"C. Boutilier R. I. Brafman and C. Geib. Structured Reachability Analysis for Markov Decision Processes. UAI'98.   C. Boutilier R. I. Brafman and C. Geib. Structured Reachability Analysis for Markov Decision Processes. UAI'98."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(96)00201-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-005-0230-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646100.758620"},{"key":"e_1_3_2_1_11_1","volume-title":"WebDB","author":"Doan A.","year":"2000","unstructured":"A. Doan , P. Domingos , and A. Y. Levy . Learning source description for data integration . In WebDB , 2000 . A. Doan, P. Domingos, and A. Y. Levy. Learning source description for data integration. In WebDB, 2000."},{"key":"e_1_3_2_1_12_1","volume-title":"A truth maintenance system. J. of Artificial Intelligence","author":"Doyle J.","year":"1979","unstructured":"J. Doyle . A truth maintenance system. J. of Artificial Intelligence , 1979 . J. Doyle. A truth maintenance system. J. of Artificial Intelligence, 1979."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237715"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. ICSLP","author":"Gelfond M.","year":"1988","unstructured":"M. Gelfond and V. Lifschitz . The stable model semantics for logic programming . In Proc. ICSLP , 1988 . M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. ICSLP, 1988."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260817"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_3_2_1_17_1","volume-title":"VLDB","author":"Jhingran A.","year":"2006","unstructured":"A. Jhingran . Enterprise information mashups: Integrating information, simply . In VLDB , 2006 . A. Jhingran. Enterprise information mashups: Integrating information, simply. In VLDB, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872798"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543644"},{"key":"e_1_3_2_1_20_1","first-page":"1777","article-title":"A data model for semistructured data with partial and inconsistent information","author":"Liu M.","year":"2000","unstructured":"M. Liu and T. W. Ling . A data model for semistructured data with partial and inconsistent information . In LNCS 1777 , 2000 . M. Liu and T. W. Ling. A data model for semistructured data with partial and inconsistent information. In LNCS 1777, 2000.","journal-title":"LNCS"},{"key":"e_1_3_2_1_21_1","volume-title":"VLDB","author":"Madhavan J.","year":"2001","unstructured":"J. Madhavan , P. A. Bernstein , and E. Rahm . Generic schema matching with cupid . In VLDB , 2001 . J. Madhavan, P. A. Bernstein, and E. Rahm. Generic schema matching with cupid. In VLDB, 2001."},{"key":"e_1_3_2_1_22_1","volume-title":"Answer Set Programming","author":"Mercer R.","year":"2003","unstructured":"R. Mercer and V. Risch . Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system . In Answer Set Programming , 2003 . R. Mercer and V. Risch. Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system. In Answer Set Programming, 2003."},{"key":"e_1_3_2_1_23_1","volume-title":"VLDB","author":"Miller R.","year":"2000","unstructured":"R. Miller , L. Haas , and M. Hernandez . Schema mapping as query discovery . In VLDB , 2000 . R. Miller, L. Haas, and M. Hernandez. Schema mapping as query discovery. In VLDB, 2000."},{"key":"e_1_3_2_1_24_1","volume-title":"VLDB","author":"Milo T.","year":"1998","unstructured":"T. Milo and S. Zohar . Using schema matching to simplify heterogeneous data translation . In VLDB , 1998 . T. Milo and S. Zohar. Using schema matching to simplify heterogeneous data translation. In VLDB, 1998."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645339.650198"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/288627.288671"},{"key":"e_1_3_2_1_27_1","volume-title":"French and Italian Operations Research Societies","author":"Pascoal M.","year":"2003","unstructured":"M. Pascoal and E. Martins . A new implementation of Yen's ranking loopless paths algorithm. 4OR -- Quarterly Journal of the Belgian , French and Italian Operations Research Societies , 2003 . M. Pascoal and E. Martins. A new implementation of Yen's ranking loopless paths algorithm. 4OR -- Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2003."},{"key":"e_1_3_2_1_28_1","volume-title":"SIGMOD Demos","author":"Qi Y.","year":"2007","unstructured":"Y. Qi , K. S. Candan , M. L. Sapino , and K. Kintigh . Using QUEST for integrating taxonomies in the presence of misalignments and conflicts . In SIGMOD Demos , 2007 . Y. Qi, K. S. Candan, M. L. Sapino, and K. Kintigh. Using QUEST for integrating taxonomies in the presence of misalignments and conflicts. In SIGMOD Demos, 2007."},{"key":"e_1_3_2_1_29_1","volume-title":"CleanDB","author":"Qi Y.","year":"2006","unstructured":"Y. Qi , K. S. Candan , M. L. Sapino , and K. Kintigh . QUEST: QUery-driven Exploration of Semistructured Data with ConflicTs and partial knowledge , CleanDB , 2006 . Y. Qi, K. S. Candan, M. L. Sapino, and K. Kintigh. QUEST: QUery-driven Exploration of Semistructured Data with ConflicTs and partial knowledge, CleanDB, 2006."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142476"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646041.678639"},{"key":"e_1_3_2_1_33_1","volume-title":"VLDBJ","author":"Vermeer M. W. W.","year":"1996","unstructured":"M. W. W. Vermeer and P. M. G. Apers . The role of integrity constraints in database interoperation . In VLDBJ , 1996 . M. W. W. Vermeer and P. M. G. Apers. The role of integrity constraints in database interoperation. In VLDBJ, 1996."},{"key":"e_1_3_2_1_34_1","volume-title":"Management Science","author":"Yen J. Y.","year":"1971","unstructured":"J. Y. Yen . Finding the k shortest loopless paths in a network . Management Science , 1971 . J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 1971."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321947"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3225-7_16"}],"event":{"name":"SIGMOD\/PODS07: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Beijing China","acronym":"SIGMOD\/PODS07"},"container-title":["Proceedings of the 2007 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247499","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1247480.1247499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:45Z","timestamp":1750258305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247499"}},"subtitle":["<i>f<\/i>\n            eedback-based\n            <i>i<\/i>\n            n\n            <i>c<\/i>\n            on\n            <i>s<\/i>\n            istency\n            <i>r<\/i>\n            esolution and query processing on misaligned data sources"],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":36,"alternative-id":["10.1145\/1247480.1247499","10.1145\/1247480"],"URL":"https:\/\/doi.org\/10.1145\/1247480.1247499","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}