{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:31Z","timestamp":1750307611493,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,11,24]],"date-time":"2008-11-24T00:00:00Z","timestamp":1227484800000},"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":[[2008,11,24]]},"DOI":"10.1145\/1497308.1497391","type":"proceedings-article","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T17:33:43Z","timestamp":1254159223000},"page":"451-455","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Facilitating discovery on the private web using dataset digests"],"prefix":"10.1145","author":[{"given":"Peter","family":"Mork","sequence":"first","affiliation":[{"name":"The MITRE Corporation, McLean, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"Smith","sequence":"additional","affiliation":[{"name":"The MITRE Corporation, McLean, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Blaustein","sequence":"additional","affiliation":[{"name":"The MITRE Corporation, McLean, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Wolf","sequence":"additional","affiliation":[{"name":"The MITRE Corporation, McLean, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keri","family":"Sarver","sequence":"additional","affiliation":[{"name":"The MITRE Corporation, McLean, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,11,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"\"Neuroscience Information Framework \" http:\/\/neurogateway.org\/.  \"Neuroscience Information Framework \" http:\/\/neurogateway.org\/."},{"key":"e_1_3_2_1_2_1","first-page":"127","volume-title":"Kluwer Academic Publishers","author":"Callan J.","year":"2000","unstructured":"J. Callan , \" Distributed Information Retrieval ,\" in Advances in Information Retrieval , W. B. Croft , Ed.: Kluwer Academic Publishers , 2000 , pp. 127 -- 150 . J. Callan, \"Distributed Information Retrieval,\" in Advances in Information Retrieval, W. B. Croft, Ed.: Kluwer Academic Publishers, 2000, pp. 127--150."},{"key":"e_1_3_2_1_3_1","first-page":"1","volume":"39","author":"Dempster A. P.","year":"1977","unstructured":"A. P. Dempster , N. M. Laird , and D. B. Rubin , \"Maximum Likelihood from Incomplete Data via the EM algorithm,\" Journal of the Royal statistical Society , vol. 39 , pp. 1 -- 38 , 1977 . A. P. Dempster, N. M. Laird, and D. B. Rubin, \"Maximum Likelihood from Incomplete Data via the EM algorithm,\" Journal of the Royal statistical Society, vol. 39, pp. 1--38, 1977.","journal-title":"\"Maximum Likelihood from Incomplete Data via the EM algorithm,\" Journal of the Royal statistical Society"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1001\/jama.298.18.2196"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M. Y. Galperin \"The Molecular Biology Database Collection: 2008 update \" http:\/\/www3.oup.co.uk\/nar\/database\/c\/.  M. Y. Galperin \"The Molecular Biology Database Collection: 2008 update \" http:\/\/www3.oup.co.uk\/nar\/database\/c\/.","DOI":"10.1093\/nar\/gkl1008"},{"key":"e_1_3_2_1_6_1","first-page":"289","volume":"1","author":"Gardner D.","year":"2003","unstructured":"D. Gardner , A. W. Toga , G. Ascoli , J. Beatty , J. F. Brinkley , A. Dale , P. Fox , E. Gardner , J. George , N. Goddard , K. Harris , E. Herskovits , M. Hines , G. Jacobs , R. Jacobs , E. Jones , D. Kennedy , D. Kimberg , J. Mazziotta , P. Miller , S. Mori , D. Mountain , A. Reiss , G. Rosen , D. Rottenberg , G. Shepherd , N. Smalheiser , K. Smith , T. Strachan , D. Van Essen , R. Williams , and S. Wong , \"Towards Effective and Rewarding Data Sharing,\" NeuroInformatics , vol. 1 , pp. 289 -- 296 , 2003 . D. Gardner, A. W. Toga, G. Ascoli, J. Beatty, J. F. Brinkley, A. Dale, P. Fox, E. Gardner, J. George, N. Goddard, K. Harris, E. Herskovits, M. Hines, G. Jacobs, R. Jacobs, E. Jones, D. Kennedy, D. Kimberg, J. Mazziotta, P. Miller, S. Mori, D. Mountain, A. Reiss, G. Rosen, D. Rottenberg, G. Shepherd, N. Smalheiser, K. Smith, T. Strachan, D. Van Essen, R. Williams, and S. Wong, \"Towards Effective and Rewarding Data Sharing,\" NeuroInformatics, vol. 1, pp. 289--296, 2003.","journal-title":"\"Towards Effective and Rewarding Data Sharing,\" NeuroInformatics"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253299"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320252"},{"key":"e_1_3_2_1_9_1","unstructured":"N. Hamilton \"The Mechanics of a Deep Net Metasearch Engine \" http:\/\/turbo10.com\/papers\/deepnet.pdf.  N. Hamilton \"The Mechanics of a Deep Net Metasearch Engine \" http:\/\/turbo10.com\/papers\/deepnet.pdf."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1230819.1241670"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/119995.115835"},{"key":"e_1_3_2_1_12_1","first-page":"394","volume-title":"Hong Kong","author":"Ipeirotis P. G.","year":"2002","unstructured":"P. G. Ipeirotis and L. Gravano , \" Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection,\" in VLDB , Hong Kong , China , 2002 , pp. 394 -- 405 . P. G. Ipeirotis and L. Gravano, \"Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection,\" in VLDB, Hong Kong, China, 2002, pp. 394--405."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375671"},{"key":"e_1_3_2_1_14_1","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis: Wiley","author":"Kaufman L.","year":"1990","unstructured":"L. Kaufman and P. J. Rousseuw , Finding Groups in Data: An Introduction to Cluster Analysis: Wiley , 1990 . L. Kaufman and P. J. Rousseuw, Finding Groups in Data: An Introduction to Cluster Analysis: Wiley, 1990."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrn787"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/379437.379449"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"volume-title":"Congress, \"Search\/Retrieval via URL,\" http:\/\/www.loc.gov\/standards\/sru\/.","author":"Library","key":"e_1_3_2_1_18_1","unstructured":"Library of Congress, \"Search\/Retrieval via URL,\" http:\/\/www.loc.gov\/standards\/sru\/. Library of Congress, \"Search\/Retrieval via URL,\" http:\/\/www.loc.gov\/standards\/sru\/."},{"key":"e_1_3_2_1_19_1","first-page":"332","author":"Lin K.-I.","year":"2002","unstructured":"K.-I. Lin and H. Chen , \"Automatic Information Discovery from the \"Invisible Web\", \" in ITCC, Las Vegas, NV , 2002 , pp. 332 -- 337 . K.-I. Lin and H. Chen, \"Automatic Information Discovery from the \"Invisible Web\",\" in ITCC, Las Vegas, NV, 2002, pp. 332--337.","journal-title":"\" in ITCC, Las Vegas, NV"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1001\/jama.298.18.2164"},{"key":"e_1_3_2_1_22_1","unstructured":"NIH \"NIH Policy on data sharing \" http:\/\/grants2.nih.gov\/grants\/policy\/data_sharing.  NIH \"NIH Policy on data sharing \" http:\/\/grants2.nih.gov\/grants\/policy\/data_sharing."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065385.1065407"},{"key":"e_1_3_2_1_24_1","first-page":"79","volume-title":"International Workshop on Web and Databases,\" in WebDB","author":"Qiu J.","year":"2003","unstructured":"J. Qiu , F. Shao , M. Zatsman , and J. Shanmugasundaram , \" International Workshop on Web and Databases,\" in WebDB , San Diego, CA , 2003 , pp. 79 -- 86 . J. Qiu, F. Shao, M. Zatsman, and J. Shanmugasundaram, \"International Workshop on Web and Databases,\" in WebDB, San Diego, CA, 2003, pp. 79--86."},{"key":"e_1_3_2_1_25_1","first-page":"129","volume-title":"Roma","author":"Raghavan S.","year":"2001","unstructured":"S. Raghavan and H. Garcia-Molina , \" Crawling the Hidden Web,\" in VLDB , Roma , Italy , 2001 , pp. 129 -- 138 . S. Raghavan and H. Garcia-Molina, \"Crawling the Hidden Web,\" in VLDB, Roma, Italy, 2001, pp. 129--138."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"J. P. Stenbit \"Department of Defense Net-Centric Data Strategy \" http:\/\/www.defenselink.mil\/nii\/org\/cio\/doc\/Net-Centric-Data-Strategy-2003-05-092.pdf.  J. P. Stenbit \"Department of Defense Net-Centric Data Strategy \" http:\/\/www.defenselink.mil\/nii\/org\/cio\/doc\/Net-Centric-Data-Strategy-2003-05-092.pdf.","DOI":"10.21236\/ADA481710"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233324"},{"key":"e_1_3_2_1_30_1","volume-title":"Human Behavior and the Principle of Least Effort","author":"Zipf G. K.","year":"1949","unstructured":"G. K. Zipf , Human Behavior and the Principle of Least Effort . Reading, MA : Addison-Wesley , 1949 . G. K. Zipf, Human Behavior and the Principle of Least Effort. Reading, MA: Addison-Wesley, 1949."}],"event":{"name":"iiWAS08: 10th International Conference on Information Integration and Web-based Applications & Services","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Linz Austria","acronym":"iiWAS08"},"container-title":["Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1497308.1497391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1497308.1497391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:41Z","timestamp":1750250741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1497308.1497391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,24]]},"references-count":30,"alternative-id":["10.1145\/1497308.1497391","10.1145\/1497308"],"URL":"https:\/\/doi.org\/10.1145\/1497308.1497391","relation":{},"subject":[],"published":{"date-parts":[[2008,11,24]]},"assertion":[{"value":"2008-11-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}