{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:36Z","timestamp":1750307496117,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,30]],"date-time":"2010-10-30T00:00:00Z","timestamp":1288396800000},"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":[[2010,10,30]]},"DOI":"10.1145\/1871929.1871939","type":"proceedings-article","created":{"date-parts":[[2010,11,1]],"date-time":"2010-11-01T13:32:23Z","timestamp":1288618343000},"page":"55-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards bipartite graph data management"],"prefix":"10.1145","author":[{"given":"Bin","family":"Zhao","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2010,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Http:\/\/hadoop.apache.org.  Http:\/\/hadoop.apache.org."},{"key":"e_1_3_2_1_2_1","first-page":"36","volume-title":"SODA","author":"Amilhastre J.","year":"1997","unstructured":"J. Amilhastre , P. Janssen , and M.-C. Vilarem . Computing a minimum biclique cover is polynomial for bipartite domino-free graphs . In SODA , pages 36 -- 42 , 1997 . J. Amilhastre, P. Janssen, and M.-C. Vilarem. Computing a minimum biclique cover is polynomial for bipartite domino-free graphs. In SODA, pages 36--42, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401995"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02279-1_41"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453947"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557051"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.147"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081879"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.26"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254916"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190660"},{"key":"e_1_3_2_1_14_1","volume-title":"SDM,pages 72--83","author":"Li J.","year":"2008","unstructured":"J. Li , K. Sim , G. Liu , and L. Wong . Maximal quasi-bicliques with balanced noise tolerance: Concepts and co-clustering applications . In SDM,pages 72--83 . SIAM , 2008 . J. Li, K. Sim, G. Liu, and L. Wong. Maximal quasi-bicliques with balanced noise tolerance: Concepts and co-clustering applications. In SDM,pages 72--83. SIAM, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367633"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.36"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.111"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117461"},{"key":"e_1_3_2_1_19_1","first-page":"704","volume-title":"SDM","author":"Tong H.","year":"2008","unstructured":"H. Tong , S. Papadimitriou , P. S. Yu , and C. Faloutsos . Proximity tracking on time-evolving bipartite graphs . In SDM , pages 704 -- 715 . SIAM , 2008 . H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704--715. SIAM, 2008."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.216"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526853"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150505"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","DOI":"10.2172\/816202","volume-title":"Bipartite graph partitioning and data clustering. CoRR, cs.IR\/0108018","author":"Zha H.","year":"2001","unstructured":"H. Zha , X. He , C. H. Q. Ding , M. Gu , and H. D. Simon . Bipartite graph partitioning and data clustering. CoRR, cs.IR\/0108018 , 2001 . H. Zha, X. He, C. H. Q. Ding, M. Gu, and H. D.Simon. Bipartite graph partitioning and data clustering. CoRR, cs.IR\/0108018, 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564485"},{"key":"e_1_3_2_1_25_1","volume-title":"HICSS, page 473","author":"Zhang Y.","year":"2008","unstructured":"Y. Zhang . Elissa j. chesler, michael a. langston: On finding bicliques in bipartite graphs: a novel algorithm with application to the integration of diverse biological data types . In HICSS, page 473 . IEEE Computer Society , 2008 . Y. Zhang. Elissa j. chesler, michael a. langston: On finding bicliques in bipartite graphs: a novel algorithm with application to the integration of diverse biological data types. In HICSS, page 473. IEEE Computer Society, 2008."}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Toronto ON Canada","acronym":"CIKM '10"},"container-title":["Proceedings of the second international workshop on Cloud data management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871929.1871939","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871929.1871939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:39Z","timestamp":1750249059000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871929.1871939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,30]]},"references-count":25,"alternative-id":["10.1145\/1871929.1871939","10.1145\/1871929"],"URL":"https:\/\/doi.org\/10.1145\/1871929.1871939","relation":{},"subject":[],"published":{"date-parts":[[2010,10,30]]},"assertion":[{"value":"2010-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}