Gbase: An efficient analysis platform for large graphs

VLDB Journal

Volumn 21, Issue 5, 2012, Pages 637-650

  Kang, U ^a   Tong, Hanghang ^b   Sun, Jimeng ^b   Lin, Ching Yung ^b   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Compression; Distributed computing; Graph; Indexing

Indexed keywords

CITATION NETWORKS; COMPRESSION SCHEME; CYBER SECURITY; EFFICIENT ANALYSIS; EFFICIENT IMPLEMENTATION; GRAPH; GRAPH OPERATIONS; GRAPH QUERIES; INDEXING MECHANISMS; LARGE GRAPHS; MAP-REDUCE; PROTEIN NETWORK; QUERY RESPONSE; SOCIAL NETWORKS; SPACE AND TIME; STORAGE SPACES; SYNTHETIC GRAPHS;

COMPACTION; DISTRIBUTED COMPUTER SYSTEMS; INDEXING (OF INFORMATION); QUERY PROCESSING; SECURITY OF DATA;

GRAPHIC METHODS;

EID: 84866450568     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-012-0283-9     Document Type: Article

References (45)

1. Liu, C., Guo, F., Faloutsos, C.: BBM: Bayesian browsing model from petabyte-scale data. In: KDD (2009).
2. Dean, J., Ghemawatm, S.: MapReduce: simplified data processing on large clusters. In: OSDI (2004).
3. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web, Stanford Digital Library Technologies Project (1998).
4. Tong, H., Faloutsos, C., Pan, J.-Y.: Fast random walk with restart and its applications. In: ICDM (2006).
5. 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).
6. Kang, U., Tsourakakis, C. E., Faloutsos, C.: PEGASUS: a peta-scale graph mining system-implementation and observations. In: ICDM (2009).
7. Sun, J., Qu, H., Chakrabarti, D., Faloutsos, C.: Neighborhood formation and anomaly detection in bipartite graphs. In: ICDM (2005).
8. 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).
9. Akoglu, L., McGlohon, M., Faloutsos, C.: oddball: Spotting Anomalies in Weighted Graphs. In: PAKDD (2010).
10. Alvarez-Hamelin, I., Dall'Asta, L., Barrat, A., Vespignani, A.: k-core decompositions: a tool for the visualization of large scale networks, http://arxiv.org/abs/cs.NI/0504107.
11. Karypis, G., Kumar, V.: (1999) Multilevel k-way Hypergraph Partitioning In: DAC.
12. Papadimitriou, S. Sun, J.: DisCo: distributed co-clustering with map-reduce, ICDM (2008).
13. Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD (2009).
14. Kang, U., Faloutsos, C.: Beyond 'Caveman Communities': Hubs and spokes for graph compression and mining. In: ICDM (2011).
15. Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW (2004).
16. Chakrabarti, D., Papadimitriou, S., Modha, D. S., Faloutsos, C.: Fully automatic cross associations. In: KDD (2004).
17. Kang, U., Papadimitriou, S., Sun, J., Tong, H.: Centralities in large networks: algorithms and observations. In: SDM (2011).
18. Hadoop information, http://hadoop.apache.org/.
19. Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C.: Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In: PKDD (2005).
20. Erdos, P., Rényi, A.: On random graphs, Publicationes Mathematicae (1959).
21. Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD (2007).
22. Aggarwal, C. C., Xie, Y., Yu, P. S.: GConnect: a connectivity index for massive disk-resident graphs. In: PVLDB (2009).
23. Sarkar, P., Moore, A. W.: Fast nearest-neighbor search in disk-resident graphs. In: KDD (2010).
24. Maserrat, H., Pei, J.: Neighbor query friendly compression of social networks. In: KDD (2010).
25. Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB (2005).
26. Zhao, P., Yu, J. X., Yu, P. S.: Graph indexing: tree + delta > = graph. In: VLDB (2007).
27. Yan, X., Cheng, H., Han, J., Yu, P. S.: Mining significant graph patterns by leap search. In: SIGMOD (2008).
28. Bader, D. A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: WAW (2007).
29. Karypis, G., Kumar, V.: Parallel multilevel k-way partitioning for irregular graphs. In: SIAM Review (1999).
30. Andritsos, P., Miller Renée, J., Tsaparas, P.: Information-theoretic tools for mining database structure from large data sets. In: SIGMOD (2004).
31. Addario-Berry L., Kennedy W. S., King A. D., Li Z., Reed B. A.: Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7), 765-770 (2010).
32. Stonebraker, M., Abadi, D. J., Batkin, A., Chen, X., Cherniack, M., Ferreira, M., Lau, E., Lin, A., Madden, S., O'Neil, E. J., O'Neil, P. E., Rasin, A., Tran, N., Zdonik, S. B.: C-Store: a column-oriented DBMS. In: VLDB (2005).
33. Abadi, D. J., Madden, S., Hachem, N.: Column-stores vs. row-stores: how different are they really? In: SIGMOD (2008).
34. Abadi, D. J., Boncz, P. A., Harizopoulos, S.: Column oriented database systems. In: PVLDB (2009).
35. Ivanova, M., Kersten, M. L., Nes, N. J., Goncalves, R.: An architecture for recycling intermediates in a column-store. In: SIGMOD (2009).
36. Héman, S., Zukowski, M., Nes, N. J., Sidirourgos, L., Boncz, P. A.: Positional update handling in column stores. In: SIGMOD (2010).
37. Watson, W. R., Storaasli, O. O.: Application of NASA General-Purpose Solver to Large-Scale Computations in Aeroacoustics, NASA Langley Technical Report Server (1999).
38. Cudré-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).
39. 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).
40. 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).
41. Isard, M., Yu, Y.: Distributed data-parallel computing using a high-level programming language. In: SIGMOD (2009).
42. Olston, C., Reed, B., Srivastava, U., Kumar, R., Tomkins, A.: Pig latin: a not-so-foreign language for data processing. In: SIGMOD (2008).
43. Grossman, R. L., Gu, Y.: Data mining using high performance data clouds: experimental studies using sector and sphere. In: KDD (2008).
44. Pike R., Dorward S., Griesemer R., Quinlan S.: Interpreting the data: parallel analysis with Sawzall. Sci Program J. 13(4), 277-298 (2005).
45. Kang, U., Tong, H., Sun, J., Lin, C.-Y. Faloutsos, C.: Gbase: a scalable and general graph management system. In: KDD (2011).