Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database Systems for Advanced Applications

DASFAA 2012: Database Systems for Advanced Applications pp 33–47Cite as

A Relational-Based Approach for Aggregated Search in Graph Databases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7238))

Abstract

In this paper, we investigate the problem of assembling fragments from different graphs to build an answer to a user query. The goal is to be able to provide an answer, by aggregation, when a single graph cannot satisfy all the query constraints. We provide the underlying basic algorithms and a relational framework to support aggregated search in graph databases. Our objective is to provide a flexible framework for the integration of data whose structure is graph-based (e.g., RDF). The idea is that the user has not to specify a join operation between fragments. The way the fragments can be combined is a discovery process and rests on a specific algorithm. We also led some experiments on synthetic datasets to demonstrate the effectiveness of this approach.

Research partially supported by Agence Nationale de la Recherche-ANR (project AOC) and Rhone-Alpes region (project Web Intelligence).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balmin, A., Papakonstantinou, Y.: Storing and querying xml data using denormalized relational databases. The VLDB Journal 14(1), 30–49 (2005)

    Article  Google Scholar 

  2. Bonstrom, V., Hinze, A., Schweppe, H.: Storing rdf as a graph

    Google Scholar 

  3. Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community Mining from Multi-Relational Networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 445–452. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 857–872 (2007)

    Google Scholar 

  5. Dau, F.: RDF as Graph-Based, Diagrammatic Logic. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol. 4203, pp. 332–337. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Elghazel, H., Hacid, M.-S.: Aggregated Search in Graph Databases: Preliminary Results. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS (LNAI), vol. 6658, pp. 92–101. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: Proceedings of the International Conference on Pattern Recognition, pp. 112–115 (2002)

    Google Scholar 

  8. 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/

  9. Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics, Part B 35(3), 503–514 (2005)

    Article  Google Scholar 

  10. Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Information Sciences 177(1), 239–247 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Petrakis, E.G.M., Faloutsos, C.: Similarity searching in medical image databases. IEEE Transactions on Knowledge and Data Engineering 9(3), 435–447 (1997)

    Article  Google Scholar 

  12. Raymond, J.W., Gardiner, E.J., Willett, P.: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal 45, 631–644 (2002)

    Article  MATH  Google Scholar 

  13. Riesen, K., Jiang, X., Bunke, H.: Exact and inexact graph matching: Methodology and applications. In: Aggarwal, C.C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 217–247. Springer, US (2010)

    Google Scholar 

  14. Sakr, S.: Storing and Querying Graph Data using Efficient Relational Processing Techniques. In: Yang, J., Ginige, A., Mayr, H.C., Kutsche, R.-D. (eds.) Information Systems: Modeling, Development, and Integration. LNBIP, vol. 20, pp. 379–392. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Sakr, S., Al-Naymat, G.: Efficient relational techniques for processing graph queries. Journal of Computer Science and Technology 25(6), 1237–1255 (2010)

    Article  Google Scholar 

  16. Sakr, S., Awad, A.: A framework for querying graph-based business process models. In: Proceedings of the 19th International Conference on World Wide Web (WWW), pp. 1297–1300. ACM, New York (2010)

    Chapter  Google Scholar 

  17. Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: Proceedings of the International Conference on Very Large Data Bases, pp. 364–375 (2008)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Tatarinov, I., Viglas, S.D., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered xml using a relational database system. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 204–215 (2002)

    Google Scholar 

  20. Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of ACM 23(1), 31–42 (1976)

    Article  MathSciNet  Google Scholar 

  21. Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. Journal of Chemical Information and Computer Sciences 38(6), 983–996 (1998)

    Article  Google Scholar 

  22. Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 335–346 (2004)

    Google Scholar 

  23. Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 766–777 (2005)

    Google Scholar 

  24. Yang, Q., Sze, S.-H.: Path matching and graph matching in biological networks. Journal of Computational Biology 14(1), 56–67 (2007)

    Article  MathSciNet  Google Scholar 

  25. Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: Proceedings of the International Conference on Data Engineering, pp. 966–975 (2007)

    Google Scholar 

  26. Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta >= graph. In: Proceedings of the International Conference on Very Large Data Bases, pp. 938–949 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lyon, CNRS Université Lyon 1, LIRIS UMR 5205, F-69622, France

    Thanh-Huy Le & Mohand-Saíd Hacid

  2. Université de Lyon, Laboratoire GAMA, 69622, Villeurbanne, France

    Haytham Elghazel

Authors
  1. Thanh-Huy Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haytham Elghazel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohand-Saíd Hacid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, Gwanak-ro, Gwanak-gu, 151747, Seoul, South Korea

    Sang-goo Lee

  2. Computer School, Wuhan University, Luo-jia-shan, Wuchang, 430081, Wuhan, Hubei Province, China

    Zhiyong Peng

  3. School of Information Technology and Electrical Engineering, University of Queensland, QLD 4072, Brisbane, Australia

    Xiaofang Zhou

  4. Department of Computer Science, Kangwon National University, 192-1, Hyoja2-Dong, Chuncheon, 200701, Kangwon, South Korea

    Yang-Sae Moon

  5. Institute for Computer Science and Business Information, University of Duisburg-Essen, Schützenbahn 70, 45117, Essen, Germany

    Rainer Unland

  6. School of Information and Communication Engineering, Chungbuk National University, 52 Naesudong-ro, Heungdeok-gu, Cheongju, 4072, Chungbuk, South Korea

    Jaesoo Yoo

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le, TH., Elghazel, H., Hacid, MS. (2012). A Relational-Based Approach for Aggregated Search in Graph Databases. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29038-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29038-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29037-4

  • Online ISBN: 978-3-642-29038-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation