{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T23:16:13Z","timestamp":1792797373102,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,23]],"date-time":"2008-10-23T00:00:00Z","timestamp":1224720000000},"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,10,23]]},"DOI":"10.1145\/1454008.1454027","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"107-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":345,"title":["Pfp"],"prefix":"10.1145","author":[{"given":"Haoyuan","family":"Li","sequence":"first","affiliation":[{"name":"Google Beijing Research, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[{"name":"Google Beijing Research, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Google Beijing Research, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward Y.","family":"Chang","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","author":"Aouad Lamine M.","year":"2007","unstructured":"Lamine M. Aouad , Nhien-An Le-Khac , and Tahar M. Kechadi . Distributed frequent itemsets mining in heterogeneous platforms. Engineering , Computing and Archtecture , 1 , 2007 . Lamine M. Aouad, Nhien-An Le-Khac, and Tahar M. Kechadi. Distributed frequent itemsets mining in heterogeneous platforms. Engineering, Computing and Archtecture, 1, 2007.","journal-title":"Computing and Archtecture"},{"key":"e_1_3_2_1_2_1","first-page":"509","volume":"286","author":"Barab\u00e1si A.-L.","year":"1999","unstructured":"A.-L. Barab\u00e1si and R. Albert . Emergence of scaling in random networks. Science , 286 : 509 -- 512 , 1999 . A.-L. Barab\u00e1si and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.","journal-title":"Emergence of scaling in random networks. Science"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229432"},{"key":"e_1_3_2_1_4_1","first-page":"137","volume-title":"OSDI","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . Mapreduce : Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2006.77"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_7_1","volume-title":"VLDB","author":"Liu Li","year":"2007","unstructured":"Li Liu , Eric Li , Yimin Zhang , and Zhizhong Tang . Optimization of frequent itemset mining on multiple-core processor . In VLDB , 2007 . Li Liu, Eric Li, Yimin Zhang, and Zhizhong Tang. Optimization of frequent itemset mining on multiple-core processor. In VLDB, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760894.1760956"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases, VLDB","author":"Rakesh Agrawal","year":"1994","unstructured":"Agrawal Rakesh and Ramakrishnan Srikant . Fast algorithms for mining association rules . In Proc. 20th Int. Conf. Very Large Data Bases, VLDB , 1994 . Agrawal Rakesh and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB, 1994."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989600"}],"event":{"name":"RecSys08: ACM Conference on Recommender Systems","location":"Lausanne Switzerland","acronym":"RecSys08","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval","SIGCHI ACM Special Interest Group on Computer-Human Interaction"]},"container-title":["Proceedings of the 2008 ACM conference on Recommender systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454008.1454027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1454008.1454027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:39Z","timestamp":1750253379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454008.1454027"}},"subtitle":["parallel fp-growth for query recommendation"],"short-title":[],"issued":{"date-parts":[[2008,10,23]]},"references-count":10,"alternative-id":["10.1145\/1454008.1454027","10.1145\/1454008"],"URL":"https:\/\/doi.org\/10.1145\/1454008.1454027","relation":{},"subject":[],"published":{"date-parts":[[2008,10,23]]},"assertion":[{"value":"2008-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}