GConnect: A connectivity index for massive disk-resident graphs

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 862-873

  Aggarwal, Charu ^a   Xie, Yan ^b   Yu, Philip S ^b  

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

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

CONNECTIVITY INDICES; INDEX STRUCTURE; LARGE GRAPHS; MASSIVE GRAPH; MAXIMUM FLOW PROBLEMS; RANDOM ACCESS; THREE ORDERS OF MAGNITUDE; UNDERLYING GRAPHS;

FLOW GRAPHS;

EID: 77956260197     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687725     Document Type: Article

References (20)

1. C. Aggarwal, N. Ta, J. Feng, J. Wang, M. J. Zaki. XProj: A Framework for Projected Structural Clustering of XML Documents, KDD Conference, pages 46-55, 2007.
2. R. Ahuja, J. Orlin, T. Magnanti, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1992.
3. B. Cherassky, A. Goldberg, On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica, 19(4): 390-410, 1997.
4. D. Cook, L. Holder, Mining Graph Data, John Wiley & Sons Inc, 2007.
5. M. Faloutsos, P. Faloutsos, C. Faloutsos, On Power Law Relationships of the Internet Topology. SIGCOMM Conference, pages 251-262, 1999.
6. D. Gibson, R. Kumar, A. Tomkins, Discovering Large Dense Subgraphs in Massive Graphs, VLDB Conference, pages 721-732, 2005.
7. R. Kumar, P Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal. The Web as a Graph. ACM PODS Conference, pages 1-10, 2000.
8. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. WWW Conference, pages 1481-1493, 1999.
9. S. Navlakha, R. Rastogi, N. Shrivastava, Graph summarization with bounded error. SIGMOD Conference, pages 419-432, 2008.
10. N. Polyzotis, M. Garofalakis. Xsketch synopses for XML data graphs. ACM TODS Journal, 31(3):1014-1063, 2006.
11. S. Raghavan, H. Garcia-Molina. Representing web graphs. ICDE Conference, pages 405-416, 2003.
12. T. Suel, J Yuan. Compressing the graph structure of the web, Data Compression Conference, pages 213-222, 2001.
13. A. A. Tsay, W. S. Lovejoy, David R. Karger, Random Sampling in Cut, Flow, and Network Design Problems, Mathematics of Operations Research, 24(2):383-413, 1999.
14. H. Wang, H. He, J. Yang, J. Xu-Yu, P. Yu. Dual Labeling: Answering Graph Reachability Queries in Constant Time. ICDE Conference, pages 75, 2006.
15. X. Yan, J. Han. CloseGraph: Mining Closed Frequent Graph Patterns, ACM KDD Conference, pages 286-295, 2003.
16. X. Yan, H. Cheng, J. Han, and P. S. Yu, Mining Significant Graph Patterns by Scalable Leap Search, SIGMOD Conference, pages 433-444, 2008.
17. X. Yan, P. S. Yu, and J. Han, Graph Indexing Based on Discriminative Frequent Structure Analysis, ACM Transactions on Database Systems (TODS), pages 960-993, December 2005.
18. X. Yan, P. S. Yu, and J Han, Substructure Similarity Search in Graph Databases, SIGMOD Conference, pages 766-777, 2005.
19. M. J. Zaki, C. C. Aggarwal. XRules: An Effective Structural Classifier for XML Data, KDD Conference, pages 316-325, 2003.
20. http://avglab.com/andrew/soft.html