Incremental maintenance of 2-Hop labeling of large graphs

IEEE Transactions on Knowledge and Data Engineering

Volumn 22, Issue 5, 2010, Pages 682-698

  Bramandia, Ramadhana ^a   Choi, Byron ^b   Ng, Wee Keong ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Indexing methods; Query processing; XML XSL RDF

Indexed keywords

AND/OR GRAPHS; EXPERIMENTAL EVALUATION; GRAPH CONNECTIVITY; INCREMENTAL MAINTENANCE; INDEXING METHODS; LABELINGS; LARGE GRAPHS; ORDERS OF MAGNITUDE; REACHABILITY TESTS; SET COVER; SPACE EFFICIENCIES; STRUCTURED DATABASE; WEB ONTOLOGY; XML/XSL/RDF;

INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); MAINTAINABILITY; ONTOLOGY; QUERY PROCESSING; SEMANTIC WEB;

LABELING;

EID: 77949917433     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2009.117     Document Type: Article

References (36)

1. R. Agrawal and H.V. Jagadish, "Hybrid Transitive Closure Algorithms," Proc. 16th Int'l Conf. Very Large Databases (VLDB '90), pp. 326-334, 1990.
2. R. Bar-Yehuda and D. Rawitz, "Approximating Element- Weighted Vertex Deletion Problems for the Complete K-Partite Property," J. Algorithms, vol.42, no.1, pp. 20-40, 2002.
3. V. Batagelj and A. Mrvar, "Pajek Datasets," http://vlado.fmf. uni-lj.si/pub/networks/data/, 2006.
4. R. Bramandia, J. Cheng, B. Choi, and J.X. Yu, "Optimizing Updates of Recursive XML Views of Relations," The VLDB J., vol.18, no.6, pp. 1313-1333, 2009.
5. R. Bramandia, B. Choi, and W.K. Ng, "On Incremental Maintenance of 2-Hop Labeling of Graphs," Proc. Conf. World Wide Web (WWW '08), pp. 845-854, 2008.
6. J. Cheng, Y. Ke, W. Ng, and A. Lu, "Fg-Index: Towards Verification-Free Query Processing on Graph Databases," Proc. ACM SIGMOD, pp. 857-872, 2007.
7. J. Cheng, J.X. Yu, X. Lin, H. Wang, and P.S. Yu, "Fast Computation of Reachability Labeling for Large Graphs," Proc. Int'l Conf. Extending Database Technology (EDBT '06), pp. 961-979, 2006.
8. J. Cheng, J.X. Yu, X. Lin, H. Wang, and P.S. Yu, "Fast Computing Reachability Labelings for Large Graphs with High Compression Rate," Proc. 11th Int'l Conf. Extending Database Technology (EDBT '08), pp. 193-204, 2008.
9. J. Cheng, J.X. Yu, and N. Tang, "Fast Reachability Query Processing," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA '06), pp. 674-688, 2006.
10. B. Choi, G. Cong, W. Fan, and S.D. Viglas, "Updating Recursive XML Views of Relations," Proc. Int'l Conf. Data Eng. (ICDE), pp. 766-775, 2007.
11. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, "Reachability and Distance Queries via 2-Hop Labels," SIAM J. Computing, vol.32, no.5, pp. 1338-1355, 2003.
12. E. Cohen, H. Kaplan, and T. Milo, "Labeling Dynamic Xml Trees," Proc. ACM Symp. Principles of Database Systems (PODS '02), pp. 271-281, 2002.
13. QuickGo: GO Browser. Web Interface, European Bioinformatics Inst, http://www.ebi.ac.uk/ego/, 2009.
14. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1990.
15. H. Jiang, H. Lu, W. Wang, and B. Ooi, "Xr-Tree: Indexing Xml Data for Efficient Structural Join," Proc. Int'l Conf. Data Eng. (ICDE), 2003.
16. R. Johnsonbaugh and M. Kalin, "A Graph Generation Software Package," Proc. SIGCSE, pp. 151-154, 1991.
17. Family of Multilevel Partitioning Algorithms, Karypis Lab, http:// glaros.dtc.umn.edu/gkhome/metis/metis/overview, 2009.
18. B. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell Systems Technical J., vol.49, no.1, pp. 291-307, 1970.
19. I. Keseler, J. Collado Vides, S. Gama-Castro, J. Ingraham, S. Paley, I. Paulsen, M. Peralta-Gil, and P. Karp, "Ecocyc: A Comprehensive Database Resource for Escherichia Coli," Nucleic Acids Research, vol.33, pp. D334-D337, 2005.
20. J.M. Kleinberg, "Authoritative Sources in a Hyperlinked Environment," J. ACM, vol.46, no.5, pp. 604-632, 1999.
21. J. Leskovec, J.M. Kleinberg, and C. Faloutsos, "Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations," Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 177-187, 2005.
22. G. Miklau UW XML Repository, http://www.cs.washington. edu/research/xmldatasets/, 2009.
23. R. Peeters, "The Maximum Edge Biclique Problem Is Np- Complete," Discrete Applied Math., vol.131, no.3, pp. 651-654, 2003.
24. R. Schenkel, A. Theobald, and G. Weikum, "Hopi: An Efficient Connection Index for Complex xml Document Collections," Proc. Int'l Conf. Extending Database Technology (EDBT '04), pp. 237-255, 2004.
25. R. Schenkel, A. Theobald, and G. Weikum, "Efficient Creation and Incremental Maintenance of the Hopi Index for Complex xml Document Collections," Proc. Int'l Conf. Data Eng. (ICDE '05), pp. 360-371, 2005.
26. M. Stoer and F. Wagner, "A Simple Min-Cut Algorithm," J. ACM, vol.44, no.4, pp. 585-591, 1997.
27. R. Tarjan, "Depth-First Search and Linear Graph Algorithms," SIAM J. Computing, vol.1, no.2, pp. 146-160, 1972.
28. "OWL Web Ontology Language Overview," W3C, http:// www.w3.org/TR/owl-features, 2009.
29. "Resource Description Framework (RDF)," W3C, http:// www.w3.org/RDF. 2009.
30. "Semantic Web Activity," http://www.w3.org/2001/sw/, 2007.
31. H. Wang, H. He2, J. Yang, P.S. Yu, and J.X. Yu, "Dual Labeling: Answering Graph Reachability Queries in Constant Time," Proc. Int'l Conf. Data Eng. (ICDE '06), p. 75, 2006.
32. G. Wu, K. Zhang, C. Liu, and J.-Z. Li, "Adapting Prime Number Labeling Scheme for Directed Acyclic Graphs," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA '06), pp. 787- 796, 2006.
33. X. Wu, M.L. Lee, and W. Hsu, "A Prime Number Labeling Scheme for Dynamic Ordered xml Trees," Proc. Int'l Conf. Data Eng. (ICDE), pp. 66-78, 2004.
34. X. Yan, P.S. Yu, and J. Han, "Graph Indexing Based on Discriminative Frequent Structure Analysis," ACM Trans. Database Systems, vol.30, no.4, pp. 960-993, 2005.
35. X. Yan, F. Zhu, P.S. Yu, and J. Han, "Feature-Based Similarity Search in Graph Structures," ACM Trans. Database Systems, vol.31, no.4, pp. 1418-1453, 2006.
36. C. Zhang, J.F. Naughton, D.J. DeWitt, Q. Luo, and G.M. Lohman, "On Supporting Containment Queries in Relational Database Management Systems," Proc. ACM SIGMOD, pp. 425-436, 2001.