Emerging Graph Queries in Linked Data
暂无分享,去创建一个
[1] Qing Zhang,et al. Assessing and ranking structural correlations in graphs , 2011, SIGMOD '11.
[2] Wenfei Fan,et al. Information preserving XML schema embedding , 2005, TODS.
[3] Jignesh M. Patel,et al. SAGA: a subgraph matching tool for biological graphs , 2007, Bioinform..
[4] Jianzhong Li,et al. Adding regular expressions to graph reachability and pattern queries , 2011, Frontiers of Computer Science.
[5] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[6] Christos Faloutsos,et al. Fast best-effort pattern matching in large attributed graphs , 2007, KDD '07.
[7] Mong-Li Lee,et al. NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs , 2006, KDD '06.
[8] Dimitrios Gunopulos,et al. Finding effectors in social networks , 2010, KDD.
[9] Vipin Kumar,et al. Parallel static and dynamic multi‐constraint graph partitioning , 2002, Concurr. Comput. Pract. Exp..
[10] Ying Wang,et al. Algorithms for Large, Sparse Network Alignment Problems , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[11] Jignesh M. Patel,et al. TALE: A Tool for Approximate Large Graph Matching , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[12] S. Sudarshan,et al. Keyword search on external memory data graphs , 2008, Proc. VLDB Endow..
[13] Philip S. Yu,et al. BLINKS: ranked keyword searches on graphs , 2007, SIGMOD '07.
[14] Dan Suciu,et al. Query containment for conjunctive queries with regular expressions , 1998, PODS.
[15] Wei Chen,et al. Efficient influence maximization in social networks , 2009, KDD.
[16] E. Prud hommeaux,et al. SPARQL query language for RDF , 2011 .
[17] Ambuj K. Singh,et al. Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).
[18] Aart J. C. Bik,et al. Pregel: a system for large-scale graph processing - "ABSTRACT" , 2009, PODC '09.
[19] Gerhard Weikum,et al. An Efficient and Versatile Query Engine for TopX Search , 2005, VLDB.
[20] Li Chen,et al. Stack-based Algorithms for Pattern Matching on DAGs , 2005, VLDB.
[21] Yifei Yuan,et al. Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate , 2011, SDM.
[22] Roded Sharan,et al. Sigma: a Set-Cover-Based Inexact Graph Matching Algorithm , 2010, J. Bioinform. Comput. Biol..
[23] Nan Li,et al. Neighborhood based fast graph search in large networks , 2011, SIGMOD '11.
[24] Siegfried Nijssen,et al. What Is Frequent in a Single Graph? , 2007, PAKDD.
[25] Philip S. Yu,et al. PathSim , 2011, Proc. VLDB Endow..
[26] Hanan Samet,et al. Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.
[27] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[28] Christian Borgelt,et al. Support Computation for Mining Frequent Subgraphs in a Single Graph , 2007, MLG.
[29] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[30] Carlos A. Hurtado,et al. Edinburgh Research Explorer Expressive Languages for Path Queries over Graph-Structured Data , 2012 .
[31] Jiawei Han,et al. Top-K aggregation queries over large networks , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[32] Philip S. Yu,et al. Graph OLAP: Towards Online Analytical Processing on Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[33] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[34] Donald Kossmann,et al. The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.
[35] Jiong Yang,et al. SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.
[36] Yizhou Sun,et al. Fast computation of SimRank for static and dynamic information networks , 2010, EDBT '10.
[37] Divesh Srivastava,et al. Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.
[38] Thomas W. Reps,et al. A categorized bibliography on incremental computation , 1993, POPL '93.
[39] Dan Suciu,et al. UnQL: a query language and algebra for semistructured data based on structural recursion , 2000, The VLDB Journal.
[40] Philip S. Yu,et al. Fast Graph Pattern Matching , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[41] S. Sudarshan,et al. Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.
[42] Andy Schürr,et al. Incremental Graph Pattern Matching , 2006 .
[43] Brian Gallagher,et al. Matching Structure and Semantics: A Survey on Graph-Based Pattern Matching , 2006, AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection.
[44] Philip S. Yu,et al. Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.
[45] Ulf Leser,et al. Fast and practical indexing and querying of very large graphs , 2007, SIGMOD '07.
[46] Jianzhong Li,et al. Graph homomorphism revisited for graph matching , 2010, Proc. VLDB Endow..
[47] S. Sudarshan,et al. Bidirectional Expansion For Keyword Search on Graph Databases , 2005, VLDB.
[48] Hanghang Tong,et al. Non-Negative Residual Matrix Factorization with Application to Graph Anomaly Detection , 2011, SDM.
[49] Lei Zou,et al. DistanceJoin: Pattern Match Query In a Large Graph Database , 2009, Proc. VLDB Endow..
[50] Kun-Lung Wu,et al. Towards proximity pattern mining in large graphs , 2010, SIGMOD Conference.
[51] George Karypis,et al. Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.
[52] Philip S. Yu,et al. Mining knowledge from databases: an information network analysis approach , 2010, SIGMOD Conference.
[53] Aart J. C. Bik,et al. Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.
[54] Jianzhong Li,et al. Graph pattern matching , 2010, Proc. VLDB Endow..
[55] Francesco Ranzato,et al. The Subgraph Similarity Problem , 2009, IEEE Transactions on Knowledge and Data Engineering.
[56] Jianxin Li,et al. Top-k keyword search over probabilistic XML data , 2011, 2011 IEEE 27th International Conference on Data Engineering.
[57] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[58] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[59] Jian Pei,et al. Efficiently indexing shortest paths by exploiting symmetry in graphs , 2009, EDBT '09.
[60] Jimeng Sun,et al. GBASE: a scalable and general graph management system , 2011, KDD.
[61] Jennifer Widom,et al. The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.
[62] Lei Zou,et al. Dynamic Skyline Queries in Large Graphs , 2010, DASFAA.
[63] Hisashi Kashima,et al. A Linear-Time Graph Kernel , 2009, 2009 Ninth IEEE International Conference on Data Mining.