Graph OLAP: A multi-dimensional framework for graph data analysis

Knowledge and Information Systems

Volumn 21, Issue 1, 2009, Pages 41-63

  Chen, Chen ^a   Yan, Xifeng ^b   Zhu, Feida ^a   Han, Jiawei ^a   Yu, Philip S ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b University of California   (United States)

^c 1120 Science and Engineering Offices   (United States)

Author keywords

Discovery driven analysis; Efficient computation; Graph OLAP; Multi dimensional model

Indexed keywords

COMPLEX NETWORKS; DATA WAREHOUSES; GEOMETRY; GRAPHIC METHODS; INFORMATION ANALYSIS; SEA ICE; SEMANTICS;

DISCOVERY-DRIVEN ANALYSIS; EFFICIENT COMPUTATION; GRAPH OLAP; INTERCONNECTING STRUCTURES; KNOWLEDGE DISCOVERY PROCESS; MULTI-DIMENSIONAL ANALYSIS; MULTI-DIMENSIONAL MODEL; ON-LINE ANALYTICAL PROCESSING;

GRAPH STRUCTURES;

EID: 70349972757     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-009-0228-9     Document Type: Article

References (31)

1. Archambault D, Munzner T, Auber D (2007) Topolayout: Multilevel graph layout by topological features. IEEE Trans Vis Comput Graph 13(2):305-317
2. Beyer KS, Ramakrishnan R (1999) Bottom-up computation of sparse and iceberg cubes. In: SIGMOD Conference, pp 359-370
3. Boldi P, Vigna S (2004) The WebGraph framework I: Compression techniques. In: WWW, pp 595-602
4. Chakrabarti D, Faloutsos C (2006) Graph mining: Laws, generators, and algorithms. ACM Comput Surv 38(1)
5. Chan J, Bailey J, Leckie C (2008) Discovering correlated spatio-temporal changes in evolving graphs. Knowl Inf Syst 16(1):53-96
6. Chandola V, Kumar V (2007) Summarization - compressing data into an informative representation. Knowl Inf Syst 12(3):355-378
7. Chaudhuri S, Dayal U (1997) An overview of data warehousing and olap technology. SIGMOD Record 26(1):65-74
8. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge
9. Fang M, Shivakumar N, Garcia-Molina H, Motwani R, Ullman JD (1998) Computing iceberg queries efficiently. In: VLDB, pp 299-310
10. Gibson D, Kumar R, Tomkins A (2005) Discovering large dense subgraphs in massive graphs. In: VLDB, pp 721-732
11. Gray J, Chaudhuri S, Bosworth A, Layman A, Reichart D, Venkatrao M, Pellow F, Pirahesh H (1997) Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Min Knowl Discov 1(1):29-53
12. Gupta A, Mumick IS (1999) Materialized Views: Techniques, Implementations, and Applications. MIT Press
13. Herman I, Melanãon G, Marshall MS (2000) Graph visualization and navigation in information visualization: A survey. IEEE Trans Vis Comput Graph 6(1):24-43
14. Jeh G, Widom J (2004) Mining the space of graph properties. In: KDD, pp 187-196
15. Kossinets G, Kleinberg JM, Watts DJ (2008) The structure of information pathways in a social communication network. In: KDD, pp 435-443
16. Leskovec J, Kleinberg JM, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, pp 177-187
17. Li X, Han J, Gonzalez H (2004) High-dimensional olap: A minimal cubing approach. In: VLDB, pp 528-539
18. Lu W, Janssen JCM, Milios EE, Japkowicz N, Zhang Y (2007) Node similarity in the citation graph. Knowl Inf Syst 11(1):105-129
19. Navlakha S, Rastogi R, Shrivastava N (2008) Graph summarization with bounded error. In: SIGMOD conference, pp 419-432
20. Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: Analysis and an algorithm. In: NIPS, pp 849-856
21. Ng RT, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained association rules. In: SIGMOD Conference, pp 13-24
22. Raghavan S, Garcia-Molina H (2003) Representing web graphs. In: ICDE, pp 405-416
23. Sarawagi S, Agrawal R, Megiddo N (1998) Discovery-driven exploration of olap data cubes. In: EDBT, pp 168-182
24. Sen P, Namata GM, Bilgic M, Getoor L, Gallagher B, Eliassi-Rad T (2008) Collective classification in network data. CS-TR-4905, University of Maryland, College Park
25. Stephenson K, Zelen M (1989) Rethinking centrality: Methods and examples. Soc Netw 11(1):1-37
26. Sun Y, Han J, Zhao P, Yin Z, Cheng H, Wu T (2009) Rankclus: Integrating clustering with ranking for heterogeneous information network analysis. In: EDBT, pp 565-576
27. Tian Y, Hankins RA, Patel JM (2008) Efficient aggregation for graph summarization. In: SIGMOD conference, pp 567-580
28. Wang N, Parthasarathy S, Tan K-L, Tung AKH (2008) Csv: Visualizing and mining cohesive subgraphs. In: SIGMOD conference, pp 445-458
29. Wu AY, Garland M, Han J (2004) Mining scale-free networks using geodesic clustering. In: KDD, pp 719-724
30. Wu X, Kumar V, Quinlan JR, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng AFM, Liu B, Yu PS, Zhou Z-H, Steinbach M, Hand DJ, Steinberg D (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14(1):1-37
31. Zhao Y, Deshpande P, Naughton JF (1997) An array-based algorithm for simultaneous multidimensional aggregates. In: SIGMOD conference, pp 159-170