{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:51:06Z","timestamp":1755838266736},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,6,16]],"date-time":"2012-06-16T00:00:00Z","timestamp":1339804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00778-012-0283-9","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T13:11:20Z","timestamp":1340025080000},"page":"637-650","source":"Crossref","is-referenced-by-count":62,"title":["gbase: an efficient analysis platform for large graphs"],"prefix":"10.1007","volume":"21","author":[{"given":"U","family":"Kang","sequence":"first","affiliation":[]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Jimeng","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Ching-Yung","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,16]]},"reference":[{"key":"283_CR1","doi-asserted-by":"crossref","unstructured":"Liu, C., Guo, F., Faloutsos, C.: BBM: Bayesian browsing model from petabyte-scale data. In: KDD (2009)","DOI":"10.1145\/1557019.1557081"},{"key":"283_CR2","unstructured":"Dean, J., Ghemawatm, S.: MapReduce: simplified data processing on large clusters. In: OSDI (2004)"},{"key":"283_CR3","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web, Stanford Digital Library Technologies Project (1998)"},{"key":"283_CR4","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.-Y.: Fast random walk with restart and its applications. In: ICDM (2006)","DOI":"10.1109\/ICDM.2006.70"},{"key":"283_CR5","doi-asserted-by":"crossref","unstructured":"Lin, C.-Y., Cao N., Liu, S., Papadimitriou, S., Sun, J., Yan, X.: smallblue: social network analysis for expertise search and collective intelligence. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.140"},{"key":"283_CR6","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: a peta-scale graph mining system\u2014implementation and observations. In: ICDM (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"283_CR7","doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, H., Chakrabarti, D., Faloutsos, C.: Neighborhood formation and anomaly detection in bipartite graphs. In: ICDM (2005)","DOI":"10.1145\/1117454.1117461"},{"key":"283_CR8","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourak, Appelakis, C.E., Appel, A.P., Faloutsos, C., Leskovec J.: Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations. In: SDM (2010)","DOI":"10.1137\/1.9781611972801.48"},{"key":"283_CR9","doi-asserted-by":"crossref","unstructured":"Akoglu, L., McGlohon, M., Faloutsos, C.: oddball: Spotting Anomalies in Weighted Graphs. In: PAKDD (2010)","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"283_CR10","unstructured":"Alvarez-Hamelin, I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: k-core decompositions: a tool for the visualization of large scale networks, http:\/\/arxiv.org\/abs\/cs.NI\/0504107"},{"key":"283_CR11","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: (1999) Multilevel k-way Hypergraph Partitioning In: DAC","DOI":"10.1109\/DAC.1999.781339"},{"key":"283_CR12","unstructured":"Papadimitriou, S. Sun, J.: DisCo: distributed co-clustering with map-reduce, ICDM (2008)"},{"key":"283_CR13","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD (2009)","DOI":"10.1145\/1557019.1557049"},{"key":"283_CR14","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond \u2018Caveman Communities\u2019: Hubs and spokes for graph compression and mining. In: ICDM (2011)","DOI":"10.1109\/ICDM.2011.26"},{"key":"283_CR15","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW (2004)","DOI":"10.1145\/988672.988752"},{"key":"283_CR16","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully automatic cross associations. In: KDD (2004)","DOI":"10.1145\/1014052.1014064"},{"key":"283_CR17","doi-asserted-by":"crossref","unstructured":"Kang, U., Papadimitriou, S., Sun, J., Tong, H.: Centralities in large networks: algorithms and observations. In: SDM (2011)","DOI":"10.1137\/1.9781611972818.11"},{"key":"283_CR18","unstructured":"Hadoop information, http:\/\/hadoop.apache.org\/"},{"key":"283_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J.M., Faloutsos, C.: Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In: PKDD (2005)","DOI":"10.1007\/11564126_17"},{"key":"283_CR20","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs, Publicationes Mathematicae (1959)"},{"key":"283_CR21","doi-asserted-by":"crossref","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"283_CR22","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Xie, Y., Yu, P.S.: GConnect: a connectivity index for massive disk-resident graphs. In: PVLDB (2009)","DOI":"10.14778\/1687627.1687725"},{"key":"283_CR23","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: KDD (2010)","DOI":"10.1145\/1835804.1835871"},{"key":"283_CR24","doi-asserted-by":"crossref","unstructured":"Maserrat, H., Pei, J.: Neighbor query friendly compression of social networks. In: KDD (2010)","DOI":"10.1145\/1835804.1835873"},{"key":"283_CR25","unstructured":"Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB (2005)"},{"key":"283_CR26","unstructured":"Zhao, P., Yu, J.X. Yu, P.S.: Graph indexing: tree + delta >\u00a0= graph. In: VLDB (2007)"},{"key":"283_CR27","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"283_CR28","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: WAW (2007)","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"283_CR29","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel k-way partitioning for irregular graphs. In: SIAM Review (1999)","DOI":"10.1145\/309847.309954"},{"key":"283_CR30","doi-asserted-by":"crossref","unstructured":"Andritsos, P., Miller Ren\u00e9e, J., Tsaparas, P.: Information-theoretic tools for mining database structure from large data sets. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007650"},{"issue":"7","key":"283_CR31","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.dam.2008.08.020","volume":"158","author":"L. Addario-Berry","year":"2010","unstructured":"Addario-Berry L., Kennedy W.S., King A.D., LiZ. Reed B.A.: Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7), 765\u2013770 (2010)","journal-title":"Discret. Appl. Math."},{"key":"283_CR32","unstructured":"Stonebraker, M., Abadi, D.J., Batkin, A., Chen, X., Cherniack, M., Ferreira, M., Lau, E., Lin, A., Madden, S., O\u2019Neil, E.J., O\u2019Neil, P.E., Rasin, A., Tran, N., Zdonik, S.B.: C-Store: a column-oriented DBMS. In: VLDB (2005)"},{"key":"283_CR33","doi-asserted-by":"crossref","unstructured":"Abadi, D.J., Madden, S., Hachem, N.: Column-stores vs. row-stores: how different are they really? In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376712"},{"key":"283_CR34","doi-asserted-by":"crossref","unstructured":"Abadi, D.J., Boncz, P.A., Harizopoulos, S.: Column oriented database systems. In: PVLDB (2009)","DOI":"10.14778\/1687553.1687625"},{"key":"283_CR35","doi-asserted-by":"crossref","unstructured":"Ivanova, M., Kersten, M.L., Nes, N.J., Goncalves, R.: An architecture for recycling intermediates in a column-store. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559879"},{"key":"283_CR36","doi-asserted-by":"crossref","unstructured":"H\u00e9man, S., Zukowski, M., Nes, N.J., Sidirourgos, L., Boncz, P.A.: Positional update handling in column stores. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807227"},{"key":"283_CR37","doi-asserted-by":"crossref","unstructured":"Watson, W.R., Storaasli, O.O.: Application of NASA General-Purpose Solver to Large-Scale Computations in Aeroacoustics, NASA Langley Technical Report Server (1999)","DOI":"10.1016\/S0965-9978(00)00015-6"},{"key":"283_CR38","doi-asserted-by":"crossref","unstructured":"Cudr\u00e9-Mauroux, P., Kimura, H., Lim, K.-T., Rogers, J., Simakov, R., Soroush, E., Velikhov, P., Wang, D.L., Balazinska, M., Becla, J., DeWitt, D.J., Heath, B., Maier, D., Madden, S., Patel, J.M., Stonebraker, M., Zdonik, S.B.: A demonstration of SciDB: a science-oriented DBMS, PVLDB 2:2 (2009)","DOI":"10.14778\/1687553.1687584"},{"key":"283_CR39","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C. Horn, I. Leiser, N. Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"283_CR40","doi-asserted-by":"crossref","unstructured":"Chaiken, R., Jenkins, B., Larson, P.-A., Ramsey, B., Shakib, D., Weaver, S., Zhou, J.: SCOPE: easy and efficient parallel processing of massive data sets. In: VLDB (2008)","DOI":"10.14778\/1454159.1454166"},{"key":"283_CR41","doi-asserted-by":"crossref","unstructured":"Isard, M., Yu, Y.: Distributed data-parallel computing using a high-level programming language. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559962"},{"key":"283_CR42","doi-asserted-by":"crossref","unstructured":"Olston, C., Reed, B., Srivastava, U., Kumar, R., Tomkins, A.: Pig latin: a not-so-foreign language for data processing. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376726"},{"key":"283_CR43","doi-asserted-by":"crossref","unstructured":"Grossman, R.L., Gu, Y.: Data mining using high performance data clouds: experimental studies using sector and sphere. In: KDD (2008)","DOI":"10.1145\/1401890.1402000"},{"issue":"4","key":"283_CR44","first-page":"277","volume":"13","author":"R. Pike","year":"2005","unstructured":"Pike R., Dorward S., Griesemer R., Quinlan S.: Interpreting the data: parallel analysis with Sawzall. Sci Program J. 13(4), 277\u2013298 (2005)","journal-title":"Sci Program J."},{"key":"283_CR45","doi-asserted-by":"crossref","unstructured":"Kang, U., Tong, H., Sun, J., Lin, C.-Y. Faloutsos, C.: Gbase: a scalable and general graph management system. In: KDD (2011)","DOI":"10.1145\/2020408.2020580"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0283-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-012-0283-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0283-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T15:12:27Z","timestamp":1687533147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-012-0283-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,16]]},"references-count":45,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s00778-012-0283-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,16]]}}}