Abstract
Systems such as proteins, chemical compounds, and the Internet are stored as graph structures in graph databases. A basic, common problem in graph related applications is to find graph data that contains a query. It is not possible to scan the whole data in graph databases since subgraph isomorphism testing is an NP-complete problem. In recent years, some effective graphs indexes have been proposed to first obtain a candidate answer set and then performing verification on each candidate by checking subgraph isomorphism. However, candidate verification is still inevitable and expensive when the size of the candidate answer set is large. In this paper, we propose a new Structural Graph Indexing, called GIRAS, based on RAre subGraphs (RGs) as the basic indexing feature. The idea is to have a single characteristic that can uniquely identify a graph in a database. Few substructures are ideal candidates since they are rare graphs, which means they occurs in only a small number of graphs in the database. Thus, in confronting a query using these indexes, the size of the candidate answer set is close to that of the exact answer set, and the number of subgraph isomorphism tests is small. Therefore, the time of the candidate verification step is reduced to a minimum.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
GIRAS is an acronym for Graph database Indexing based on the RAre Structures.
- 2.
Aids antiviral dataset used for igraph. http://urlm.co/www.igraph.or.kr.
- 3.
Graphgen: a synthetic graph data generator. http://www.cse.ust.hk/graphgen/.
References
Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151–158 (1971)
Giugno, R., Shasha, D.: GraphGrep: a fast and universal method for querying graphs. In: ICPR, pp. 112–115 (2002)
Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD, pp. 335–346 (2004)
Cheng, J., Ke, Y., Ng, W., Lu, A.: FG-index: towards verification-free query processing on graph databases. In: SIGMOD, pp. 857–872 (2007)
Lee, C.H., Chung, C.W.: Efficient search in graph databases using cross filtering. Inf. Sci. 286, 1–18 (2014)
Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: tree + delta \(<=\) graph. In: The VLDB Journal, pp. 938–949 (2007)
Zhang, S., Hu, M., Yang, J.: Treepi: a novel graph indexing method. In: ICDE, pp. 966–975 (2007)
Lin, Z., Bei, Y.: Graph indexing for large networks: a neighborhood tree-based approach. Knowl.-Based Syst. 72, 48–59 (2014)
Fan, Z., Peng, Y., Choi, B., Xu, J., Bhowmick, S.S.: Towards efficient authenticated subgraph query service in outsourced graph databases. IEEE Trans. Serv. Comput. 7(4), 696–713 (2014)
He, H., Singh, A.: Closure-tree: an index structure for graph queries. In: ICDE, pp. 38–49 (2006)
Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE, pp. 976–985 (2007)
Yuan, D., Mitra, P.: Lindex: a lattice-based index for graph databases. VLDB J. 22, 229–252 (2013)
Park, C.S., Lim, S.: Efficient processing of keyword queries over graph databases for finding effective answers. Inf. Process. Manage. 51(1), 42–57 (2015)
Katsarou, F., Ntarmos, N., Triantafillou, P.: Performance and scalability of indexed subgraph query processing methods. VLDB Endowment 8(12), 1566–1577 (2015)
Gani, A., Siddiqa, A., Shamshirband, S., Hanum, F.: A survey on indexing techniques for big data: taxonomy and performance evaluation. Knowl. Inf. Syst. 46(2), 1–44 (2015)
Zhao, X., Xiao, C., Lin, X., Wang, W., Ishikawa, Y.: Efficient processing of graph similarity queries with edit distance constraints. VLDB J. 22(6), 727–752 (2013)
Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: ICDM, pp. 721–724 (2002)
Azaouzi, M., Ben Romdhane, L.: A modified gSpan for computing rare substructures in graph databases. In: ICAI, Sousse, Tunisia, pp. 51–57, June 2013
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Azaouzi, M., Ben Romdhane, L. (2017). A Minimal Rare Substructures-Based Model for Graph Database Indexing. In: Madureira, A., Abraham, A., Gamboa, D., Novais, P. (eds) Intelligent Systems Design and Applications. ISDA 2016. Advances in Intelligent Systems and Computing, vol 557. Springer, Cham. https://doi.org/10.1007/978-3-319-53480-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-53480-0_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53479-4
Online ISBN: 978-3-319-53480-0
eBook Packages: EngineeringEngineering (R0)