Aggregated search in graph databases: Preliminary results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6658 LNCS, Issue , 2011, Pages 92-101

  Elghazel, Haytham ^a,b   Hacid, Mohand Said ^a,b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

aggregated search; graph databases; query processing

Indexed keywords

AGGREGATED SEARCH; AGGREGATION QUERIES; COMPUTATION COSTS; DATA SEMANTICS; GRAPH DATABASE; GRAPH DATABASES; IMAGE DATABASE; INFORMATION NEED; NP COMPLETE PROBLEMS; QUERY GRAPH; QUERY PROCESSING TECHNIQUES; SINGLE SOURCE; SUBGRAPH ISOMORPHISM;

COMPUTATIONAL COMPLEXITY; PATTERN RECOGNITION; QUERY PROCESSING; SEMANTICS; GRAPHIC METHODS;

DATABASE SYSTEMS;

EID: 79956298121     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20844-7_10     Document Type: Article

References (14)

1. Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: ACM SIGMOD International Conference on Management of Data, pp. 857-872 (2007) (Pubitemid 47630859)
2. Dreweke, A., Wörlein, M., Fischer, I., Schell, D., Meinl, T., Philippsen, M.: Graphbased procedural abstraction. In: Fifth International Symposium on Code Generation and Optimization (CGO), pp. 259-270 (2007)
3. Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: International Conference on Pattern Recognition, pp. 112-115 (2002) (Pubitemid 44844693)
4. Janez, K., Dusanka, J.: An improved branch and bound algorithm for the maximum clique problem. MATCH Communications in Mathematical and in Computer Chemistry 58, 569-590 (2007)
5. Kopliku, A., Pinel-Sauvagnat, K., Boughanem, M.: Aggregated search: potential, issues and evaluation. Technical Report RT2009-4FR, IRIT (2009), http://www.irit.fr/PERSONNEL/SIG/kopliku/
6. Raymond, J. W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design 16(7), 521-533 (2002) (Pubitemid 36013605)
7. Shang, H., Zhang, Y., Lin, X., Yu, J. X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: International Conference on Very Large Data Bases, pp. 364-375 (2008)
8. Shasha, D., Wang, J. T. L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 39-52 (2002) (Pubitemid 35009480)
9. Ullmann, J. R.: An algorithm for subgraph isomorphism. Journal of ACM 23(1), 31-42 (1976)
10. Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: International Conference on Data Mining, pp. 721-724 (2002)
11. Yan, X., Yu, P. S., Han, J.: Graph indexing: A frequent structure-based approach. In: ACM SIGMOD International Conference on Management of Data, pp. 335-346 (2004)
12. Yan, X., Yu, P. S., Han, J.: Substructure similarity search in graph databases. In: ACM SIGMOD International Conference on Management of Data, pp. 766-777 (2005) (Pubitemid 43038974)
13. Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: International Conference on Data Engineering, pp. 966-975 (2007) (Pubitemid 47422100)
14. Zhao, P., Yu, J. X., Yu, P. S.: Graph indexing: Tree + delta >= graph. In: International Conference on Very Large Data Bases, pp. 938-949 (2007)