BFSI-B: An improved K-hop graph reachability queries for cyber-physical systems

A compound-index method which uses the special index is proposed.This method can decrease the k-hop reachability query time and improve pruning efficiency.The method is a refined online-search method, consisting of two stages: index and query. Cyber-physical systems, encompass the real physical space and virtual cyber space for providing advanced service for humans, which together, are also namely Internet of Things. The complex and large scale relationships among nodes contain the potential information of user, which is required and essential for providing high quality personalized service. Graph is used to represent, make fusion and process the relationships data, which has been used in many domains with traditional small data sets. K-hop reachability query answering in graphs is seeing a growing number of applications, such as ranked keyword search in databases, social networking, ontology reasoning and bioinformatics. Currently, techniques for efficient evaluation of such queries are based on vertex-cover technology. These methods suffer from a lack of scalability; that is, they cannot be applied to very large graphs. To solve these problems, we propose the compound-index method, namely BFSI-B, which uses the special index to decrease the k-hop reachability query time and improve pruning efficiency. The theoretical analysis and experiment results demonstrate that our method has a smaller index size and a faster query time than the k-reach method, in both dense graphs and very large graphs.

[1]  Roland Geraerts,et al.  Towards social behavior in virtual-agent navigation , 2016, Science China Information Sciences.

[2]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[3]  Jeffrey Xu Yu,et al.  SCARAB: scaling reachability computation on large graphs , 2012, SIGMOD Conference.

[4]  Hong Cheng,et al.  Efficient processing of $$k$$k-hop reachability queries , 2013, The VLDB Journal.

[5]  Ulf Leser,et al.  Fast and practical indexing and querying of very large graphs , 2007, SIGMOD '07.

[6]  Fang Wei-Kleiner,et al.  Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs , 2016, J. Comput. Syst. Sci..

[7]  Loïc Cerf,et al.  Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach , 2014, EDBT.

[8]  Yangjun Chen,et al.  Decomposing DAGs into spanning trees: A new way to compress transitive closures , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[9]  Yang Xiang,et al.  3-HOP: a high-compression indexing scheme for reachability query , 2009, SIGMOD Conference.

[10]  Mohammed J. Zaki,et al.  GRAIL: a scalable index for reachability queries in very large graphs , 2011, The VLDB Journal.

[11]  Laurence T. Yang,et al.  A Tensor-Based Big Service Framework for Enhanced Living Environments , 2016, IEEE Cloud Computing.

[12]  Yang Xiang,et al.  A highway-centric labeling approach for answering distance queries on large sparse graphs , 2012, SIGMOD Conference.

[13]  Hong Cheng,et al.  K-Reach: Who is in Your Small World , 2012, Proc. VLDB Endow..

[14]  Tak-Lam Wong.  Answering Reachability Queries on Incrementally Updated Graphs by Hierarchical Labeling Schema , 2016, Journal of Computer Science and Technology.

[15]  Yang Xiang,et al.  Efficiently answering reachability queries on very large directed graphs , 2008, SIGMOD Conference.

[16]  Takuya Akiba,et al.  Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.

[17]  Yangjun Chen,et al.  An Efficient Algorithm for Answering Graph Reachability Queries , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[18]  Oege de Moor,et al.  A memory efficient reachability data structure through bit vector compression , 2011, SIGMOD '11.

[19]  Hong Cheng,et al.  Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme , 2012, 2012 IEEE 28th International Conference on Data Engineering.