{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:11:24Z","timestamp":1742962284070,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115375"},{"type":"electronic","value":"9783319115382"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11538-2_35","type":"book-chapter","created":{"date-parts":[[2014,10,9]],"date-time":"2014-10-09T10:20:23Z","timestamp":1412850023000},"page":"382-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Patent Storing Mechanism Based on SQLite on Hadoop Platform"],"prefix":"10.1007","author":[{"given":"Xuhua","family":"Rui","sequence":"first","affiliation":[]},{"given":"Baul","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Dugki","family":"Min","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"35_CR1","unstructured":"CNET News Internet & Media Twitter hits 400 million tweets per day, mostly. http:\/\/news.cnet.com\/8301-1023_3-57448388-93\/twitter-hits-400-million-tweets-per-day-mostly-mobile\/"},{"key":"35_CR2","unstructured":"Facebook is collecting your data - 500 terabytes a day. http:\/\/gigaom.com\/2012\/08\/22\/facebook-is-collecting-your-data-500-terabytes-a-day\/"},{"key":"35_CR3","unstructured":"Huang, L., Yuan, Y., Zhao, Z.: A study on the application of data mining in the patent information analysis for company. In: Second International Workshop on Education Technology and Computer Science (ETCS), Wuhan, vol. 1 (2010)"},{"issue":"4","key":"35_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0172-2190(97)00033-1","volume":"19","author":"MMS Karki","year":"1997","unstructured":"Karki, M.M.S.: Patent citation analysis: a policy analysis tool. World Patent Inf. 19(4), 269\u2013272 (1997)","journal-title":"World Patent Inf."},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Buck, J.B., Watkins, N., LeFevre, J., Ioannidou, K., Maltzahn, C., Polyzotis, N., Brandt, S.: SciHadoop: array-based query processing in hadoop. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, Seattle, p. 66 (2011)","DOI":"10.1145\/2063384.2063473"},{"issue":"5","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1016\/j.ipm.2006.11.011","volume":"43","author":"Y-H Tseng","year":"2007","unstructured":"Tseng, Y.-H., Lin, C.-J., Parker, D.S.: Text mining techniques for patent analysis. Inf. Proc. Manage. 43(5), 1216\u20131247 (2007)","journal-title":"Inf. Proc. Manage."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Yang, H.-C., Dasdan, A., Hsiao, R.-L., Parker, D. S.: Map-reduce-merge: simplified relational data processing on large clusters. In: ACM SIGMOD International Conference on Management of Data, Beijing, pp. 1029\u22121040 (2007)","DOI":"10.1145\/1247480.1247602"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Herodotou, H., Babu, S.: Profiling, what-if analysis, and cost-based optimization of MapReduce programs. In: Very Large Database Endowment, vol. 4, pp. 1111\u22121122 (2011)","DOI":"10.14778\/3402707.3402746"},{"issue":"10","key":"35_CR10","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1016\/j.peva.2013.08.013","volume":"70","author":"M Lin","year":"2013","unstructured":"Lin, M., Zhang, L., Wierman, A., Tan, J.: Joint optimization of overlapping phases in MapReduce. Perform. Eval. 70(10), 720\u2013735 (2013)","journal-title":"Perform. Eval."},{"key":"35_CR11","unstructured":"Java Database Connector for SQLite. https:\/\/bitbucket.org\/xerial\/sqlite-jdbc"},{"key":"35_CR12","unstructured":"USPTO Bulk Downloads: Patent Grant Full Text. http:\/\/www.google.com\/googlebooks\/uspto-patents-grants-text.html"},{"key":"35_CR13","unstructured":"The SQLite Database File Format. https:\/\/www.sqlite.org\/fileformat.html"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11538-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T02:51:02Z","timestamp":1675997462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11538-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115375","9783319115382"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11538-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}