{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:41:17Z","timestamp":1743118877165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319210230"},{"type":"electronic","value":"9783319210247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21024-7_15","type":"book-chapter","created":{"date-parts":[[2015,6,30]],"date-time":"2015-06-30T13:17:17Z","timestamp":1435670237000},"page":"217-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing the Data-Process Relationship for Fast Mining of Frequent Itemsets in MapReduce"],"prefix":"10.1007","author":[{"given":"Saber","family":"Salah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Akbarinia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Masseglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,1]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.2307\/41703503","volume":"36","author":"C Hsinchun","year":"2012","unstructured":"Hsinchun, C., Chiang, R.H.L., Storey, V.C.: Business intelligence and analytics: from big data to big impact. MIS Q 36(4), 1165\u20131188 (2012)","journal-title":"MIS Q"},{"key":"15_CR2","volume-title":"Mining of Massive Datasets","author":"R Anand","year":"2012","unstructured":"Anand, R.: Mining of Massive Datasets. Cambridge University Press, Cambridge (2012)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Goethals, B.: Memory issues in frequent itemset mining. In: Haddad, H., Omicini, A., Wainwright, R.L., Liebrock, L.M.(eds.) Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14\u201317, 2004, pp. 530\u2013534. ACM (2004)","DOI":"10.1145\/967900.968012"},{"key":"15_CR4","volume-title":"Hadoop : The Definitive Guide","author":"T White","year":"2012","unstructured":"White, T.: Hadoop : The Definitive Guide. O\u2019Reilly, Beijing (2012)"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2094114.2094129","volume":"40","author":"C Bizer","year":"2011","unstructured":"Bizer, C., Boncz, P.A., Brodie, M.L., Erling, O.: The meaningful use of big data: four perspectives - four challenges. SIGMOD Rec. 40(4), 56\u201360 (2011)","journal-title":"SIGMOD Rec."},{"issue":"1","key":"15_CR6","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":"15_CR7","unstructured":"Hadoop (2014). http:\/\/hadoop.apache.org"},{"key":"15_CR8","first-page":"487","volume-title":"Proceedings of International Conference on Very Large Data Bases (VLDB)","author":"R Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 487\u2013499. Chile, Santiago de Chile (1994)"},{"key":"15_CR9","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 432\u2013444 (1995)"},{"issue":"1\u20134","key":"15_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ins.2003.08.013","volume":"160","author":"Y-J Tsay","year":"2004","unstructured":"Tsay, Y.-J., Chang-Chien, Y.-W.: An efficient cluster and decomposition algorithm for mining association rules. Inf. Sci 160(1\u20134), 161\u2013171 (2004)","journal-title":"Inf. Sci"},{"key":"15_CR11","volume-title":"Graph Algorithms","author":"S Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, Potomac (1979)"},{"key":"15_CR12","unstructured":"Patoh (2011). http:\/\/bmi.osu.edu\/ umit\/PaToH\/manual.pdf"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: Pfp: parallel fp-growth for query recommendation. In: Pu, P., Bridge, D.G., Mobasher, B., Ricci, F.(eds.) Proceedings of the ACM Conference on Recommender Systems (RecSys) Lausanne, Switzerland, pp. 107\u2013114. ACM (2008)","DOI":"10.1145\/1454008.1454027"},{"key":"15_CR14","volume-title":"Mahout in Action","author":"S Owen","year":"2012","unstructured":"Owen, S.: Mahout in Action. Manning Publications Co, Shelter Island, N.Y. (2012)"},{"key":"15_CR15","unstructured":"Grid5000. https:\/\/www.grid5000.fr\/mediawiki\/index.php\/Grid5000:Home"},{"key":"15_CR16","unstructured":"English wikipedia articles. http:\/\/dumps.wikimedia.org\/enwiki\/latest"},{"key":"15_CR17","unstructured":"The clueweb09 dataset (2009). http:\/\/www.lemurproject.org\/clueweb09.php\/"},{"issue":"6","key":"15_CR18","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song, W., Yang, B., Zhangyan, X.: Index-bittablefi: an improved algorithm for mining frequent itemsets. Knowl.-Based Syst. 21(6), 507\u2013513 (2008)","journal-title":"Knowl.-Based Syst."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1016\/j.proeng.2012.06.181","volume":"38","author":"N Jayalakshmi","year":"2012","unstructured":"Jayalakshmi, N., Vidhya, V., Krishnamurthy, M., Kannan, A.: Frequent itemset generation using double hashing technique. Procedia Eng. 38, 1467\u20131478 (2012)","journal-title":"Procedia Eng."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. SIGMODREC: ACM SIGMOD Record, 29 (2000)","DOI":"10.1145\/335191.335372"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Riondato, M., DeBrabant, J.A., Fonseca, R., Upfal, E.: Parma: a parallel randomized algorithm for approximate association rules mining in mapreduce. In: 21st ACM International Conference on Information and Knowledge Management (CIKM), Maui, HI, USA, pp. 85\u201394. ACM (2012)","DOI":"10.1145\/2396761.2396776"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-45315-1_5","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems XII","author":"M Liroz-Gistau","year":"2013","unstructured":"Liroz-Gistau, M., Akbarinia, R., Pacitti, E., Porto, F., Valduriez, P.: Dynamic workload-based partitioning algorithms for continuously growing databases. In: Hameurlain, A., K\u00fcng, J., Wagner, R. (eds.) TLDKS XII. LNCS, vol. 8320, pp. 105\u2013128. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21024-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:29:01Z","timestamp":1674228541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21024-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319210230","9783319210247"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21024-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}