International Conference on Database Systems for Advanced Applications

DASFAA 2011: Database Systems for Adanced Applications pp 2-13

Towards Efficient Subgraph Search in Cloud Computing Environments

  • Yifeng Luo
  • Jihong Guan
  • Shuigeng Zhou
Conference paper

DOI: 10.1007/978-3-642-20244-5_2

Volume 6637 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Luo Y., Guan J., Zhou S. (2011) Towards Efficient Subgraph Search in Cloud Computing Environments. In: Xu J., Yu G., Zhou S., Unland R. (eds) Database Systems for Adanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6637. Springer, Berlin, Heidelberg

Abstract

This paper proposes an efficient approach to subgraph search over a large graph database under the MapReduce framework. The main idea is first to build inverted edge indexes for graphs in the database, and then to retrieve data only related to the query subgraph by using the built indexes to answer the query. Experimental results show that the proposed approach has good performance and scalability.

Keywords

Graph database Subgraph search Cloud computing MapReduce Inverted index 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yifeng Luo
    • 1
    • 2
  • Jihong Guan
    • 3
  • Shuigeng Zhou
    • 1
    • 2
  1. 1.School of Computer ScienceFudan UniversityShanghaiChina
  2. 2.Shanghai Key Lab of Intelligent Information ProcessingFudan UniversityShanghaiChina
  3. 3.Dept. of Computer Science & TechnologyTongji UniversityShanghaiChina