{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:57Z","timestamp":1750306797363,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>\n            <jats:bold>\n              The\n              <jats:italic>Communications<\/jats:italic>\n              Web site, http:\/\/cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of\n              <jats:italic>Communications<\/jats:italic>\n              , we'll publish selected posts or excerpts\n            <\/jats:bold>\n            .\n          <\/jats:p>\n          <jats:p>\n            <jats:bold>twitter<\/jats:bold>\n          <\/jats:p>\n          <jats:p>\n            <jats:bold>Follow us on Twitter at http:\/\/twitter.com\/blogCACM<\/jats:bold>\n          <\/jats:p>\n          <jats:p>\n            <jats:bold>http:\/\/cacm.acm.org\/blogs\/blog-cacm<\/jats:bold>\n          <\/jats:p>\n          <jats:p>Kate Matsudaira considers not only how to mine data from the Web, but what to do with it once you have it.<\/jats:p>","DOI":"10.1145\/2567664","type":"journal-article","created":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T13:07:08Z","timestamp":1393420028000},"page":"10-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Capturing and structuring data mined from the web"],"prefix":"10.1145","volume":"57","author":[{"given":"Kate","family":"Matsudaira","sequence":"first","affiliation":[{"name":"Decide.com"}]}],"member":"320","published-online":{"date-parts":[[2014,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Pant G. Srinivasan P. Menczer F. Crawling the Web Department of Management Sciences School of Library and Information Science The University of Iowa; School of Informatics Indiana University http:\/\/bit.ly\/1d7cCIl  Pant G. Srinivasan P. Menczer F. Crawling the Web Department of Management Sciences School of Library and Information Science The University of Iowa; School of Informatics Indiana University http:\/\/bit.ly\/1d7cCIl"},{"key":"e_1_2_1_2_1","unstructured":"Web Crawling and Indexes Cambridge University Press http:\/\/stanford.io\/1j7HDnX  Web Crawling and Indexes Cambridge University Press http:\/\/stanford.io\/1j7HDnX"},{"key":"e_1_2_1_3_1","unstructured":"Zhao B. Y. Huang L. Stribling J. Rhea S. C. Joseph A. D. Kubiatowicz J. D. Tapestry: A Resilient Global-Scale Overlay for Service Development IEEE Journal on Selected Areas in Communications http:\/\/bit.ly\/1iW0HTx   Zhao B. Y. Huang L. Stribling J. Rhea S. C. Joseph A. D. Kubiatowicz J. D. Tapestry: A Resilient Global-Scale Overlay for Service Development IEEE Journal on Selected Areas in Communications http:\/\/bit.ly\/1iW0HTx"},{"key":"e_1_2_1_4_1","unstructured":"DeCandia G. Hastorun D. Madan J. Kakulapati G. Lakshman A. Pilchin A. Sivasubramanian S. Vosshall P. Vogels W. Dynamo: Amazon's Highly Available Keyvalue Store Amazon.com http:\/\/bit.ly\/KjqGYl   DeCandia G. Hastorun D. Madan J. Kakulapati G. Lakshman A. Pilchin A. Sivasubramanian S. Vosshall P. Vogels W. Dynamo: Amazon's Highly Available Keyvalue Store Amazon.com http:\/\/bit.ly\/KjqGYl"},{"key":"e_1_2_1_5_1","unstructured":"Stoica I. Morris R. Karger D. Kaashoek M. F. Balakrishnan H. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications MIT Laboratory for Computer Science http:\/\/bit.ly\/1m6fgq1   Stoica I. Morris R. Karger D. Kaashoek M. F. Balakrishnan H. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications MIT Laboratory for Computer Science http:\/\/bit.ly\/1m6fgq1"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567664","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2567664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:39Z","timestamp":1750232079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1145\/2567664"],"URL":"https:\/\/doi.org\/10.1145\/2567664","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2014,3]]},"assertion":[{"value":"2014-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}