Emerging Graph Queries in Linked Data

作者: Arijit Khan , Yinghui Wu , Xifeng Yan

DOI: 10.1109/ICDE.2012.143

关键词: Graph databaseNearest neighbor searchComputer scienceGraphGraph (abstract data type)Information retrievalLinked dataShortest path problemReachabilityMinimum cutGeometric networksPattern matchingPower graph analysis

摘要: In a wide array of disciplines, data can be modeled as an interconnected network of entities, where various attributes could be associated with both the entities and the relations among …

参考文章(64)
Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, Tianyi Wu, PathSim Proceedings of the VLDB Endowment. ,vol. 4, pp. 992- 1003 ,(2011) , 10.14778/3402707.3402736
Christian Borgelt, Mathias Fiedler, Support Computation for Mining Frequent Subgraphs in a Single Graph. mining and learning with graphs. ,(2007)
Lei Zou, Lei Chen, M. Tamer Özsu, Dongyan Zhao, Dynamic skyline queries in large graphs database systems for advanced applications. pp. 62- 78 ,(2010) , 10.1007/978-3-642-12098-5_5
Björn Bringmann, Siegfried Nijssen, What is frequent in a single graph knowledge discovery and data mining. ,vol. 5012, pp. 858- 863 ,(2008) , 10.1007/978-3-540-68125-0_84
Wei Chen, Alex Collins, Rachel Cummings, Te Ke, Zhenming Liu, David Rincon, Xiaorui Sun, Yajun Wang, Wei Wei, Yifei Yuan, None, Influence maximization in social Networks when negative opinions may emerge and propagate siam international conference on data mining. pp. 379- 390 ,(2011)
Jon M. Kleinberg, Navigation in a small world Nature. ,vol. 406, pp. 845- 845 ,(2000) , 10.1038/35022643
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data european conference on principles of data mining and knowledge discovery. pp. 13- 23 ,(2000) , 10.1007/3-540-45372-5_2
Amarnath Gupta, M. Erdem Kurul, Li Chen, Stack-based algorithms for pattern matching on DAGs very large data bases. pp. 493- 504 ,(2005)
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Yinghui Wu, Adding regular expressions to graph reachability and pattern queries Frontiers of Computer Science. ,vol. 6, pp. 313- 338 ,(2012) , 10.1007/S11704-012-1312-Y
Kirk Schloegel, George Karypis, Vipin Kumar, Parallel static and dynamic multi‐constraint graph partitioning Concurrency and Computation: Practice and Experience. ,vol. 14, pp. 219- 240 ,(2002) , 10.1002/CPE.605