Probabilistic subgraph matching on huge social networks

Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011

Volumn , Issue , 2011, Pages 271-278

  Bröcheler, Matthias ^a   Pugliese, Andrea ^b   Subrahmanian, V S ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; GRAPH DATABASE; RDF DATABASE; SOCIAL NETWORKS; SUBGRAPH MATCHING; SUBGRAPHS;

QUERY LANGUAGES; QUERY PROCESSING;

SOCIAL NETWORKING (ONLINE);

EID: 80052767465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2011.78     Document Type: Conference Paper

References (17)

1. M. Bröcheler, A. Pugliese, and V. S. Subrahmanian, "DOGMA: A diskoriented graph matching algorithm for RDF databases," in International Semantic Web Conf., 2009, pp. 97-113.
2. J. Broekstra, A. Kampman, and F. van Harmelen, "Sesame: An architecture for storinf and querying rdf data and schema information," in Spinning the Semantic Web, 2003, pp. 197-222.
3. T. Neumann and G. Weikum, "The rdf-3x engine for scalable management of rdf data," VLDB J., vol. 19, no. 1, pp. 91-113, 2010.
4. K. Wilkinson, C. Sayers, H. A. Kuno, and D. Reynolds, "Efficient RDF storage and retrieval in jena2," in SWDB Work., 2003, pp. 131-150.
5. M. Stocker, A. Seaborne, A. Bernstein, C. Kiefer, and D. Reynolds, "SPARQL basic graph pattern optimization using selectivity estimation," in WWW Conf., 2008, pp. 595-604.
6. A. Mislove, M. Marcon, P. K. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Internet Measurement Conf., 2007, pp. 29-42.
7. R. Wetzker, C. Zimmermann, and C. Bauckhage, "Analyzing social bookmarking systems: A del. icio. us cookbook," in Mining Social Data Work., 2008, pp. 26-30.
8. N. Nilsson, Principles of artificial intelligence. Tioga, 1980.
9. A. Sanfeliu and K. S. Fu, "Distance measure between attributed relational graphs for pattern recognition." IEEE Trans. Sys. Man Cyber., vol. 13, no. 3, pp. 353-362, 1983. (Pubitemid 13591176)
10. X. Yan, P. S. Yu, and J. Han, "Substructure similarity search in graph databases," in SIGMOD Conf., 2005, pp. 766-777. (Pubitemid 43038974)
11. Y. Tian, R. C. McEachin, C. Santos, D. J. States, and J. M. Patel, "Saga: a subgraph matching tool for biological graphs," Bioinformatics, vol. 23, no. 2, pp. 232-239, 2007. (Pubitemid 46189614)
12. Y. Tian and J. M. Patel, "TALE: A tool for approximate large graph matching," in ICDE, 2008, pp. 963-972.
13. R. Myers, R. C. Wilson, and E. R. Hancock, "Bayesian graph edit distance," IEEE TPAMI, vol. 22, no. 6, pp. 628-635, 2000.
14. R. Wilson and E. Hancock, "Bayesian compatibility model for graph matching," Pattern Recognition Letters, vol. 17, pp. 263-276, 1996.
15. M. Bröcheler, A. Pugliese, and V. S. Subrahmanian, "COSI: Cloud oriented subgraph identification in massive social networks," in ASONAM, 2010, pp. 248-255.
16. -, "A budget-based algorithm for efficient subgraph matching on huge networks," in ICDE Workshops, 2011.
17. S. Chaudhuri, "An overview of query optimization in relational systems," in PODS Symp. ACM Press, 1998, pp. 34-43.