MCPath: Effectively Query the Structure Data in the Multidimensional Moving Object Network

Aimed at the amount of aggregation graphs produced by the dimension which the user is interesting on the multidimensional moving object network. By introducing the idea of graph index, we put forward of the structure data query algorithm MCPath to solve the problem of querying the interesting structure data on specific dimension. MCPath algorithm decomposes the query structure to the shortest paths, and then joins those candidate paths, finally, generates the structural data which the user need to query. The algorithm changes the former method of query only one node once to the method of query one path once, reduces the times of querying structure data, and quickens the speed of querying the structural data.

[1]  Peng Tao,et al.  Semantic-Based Graph Index for Mobile Photo Search , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[2]  Bo Zhang,et al.  Euler index in uncertain graph , 2012, Appl. Math. Comput..

[3]  Jeffrey Xu Yu,et al.  Fast graph query processing with a low-cost index , 2011, The VLDB Journal.

[4]  Klemens Böhm,et al.  Mining Edge-Weighted Call Graphs to Localise Software Bugs , 2008, ECML/PKDD.

[5]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Brian Gallagher,et al.  Matching Structure and Semantics: A Survey on Graph-Based Pattern Matching , 2006, AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection.

[7]  Lawrence B. Holder,et al.  Mining Graph Data: Cook/Mining Graph Data , 2006 .

[8]  Lawrence B. Holder,et al.  Mining Graph Data , 2006 .

[9]  Jörg Sander,et al.  Analysis of SIGMOD's co-authorship graph , 2003, SGMD.

[10]  Ambuj K. Singh,et al.  Graphs-at-a-time: query language and access methods for graph databases , 2008, SIGMOD Conference.

[11]  Peter Willett,et al.  Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..