• DocumentCode
    1654975
  • Title

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

  • Author

    Kongfa Hu ; Long Li ; Xiangqian Xue ; Ling Chen

  • Author_Institution
    Coll. of Inf. Eng., Yangzhou Univ., Yangzhou, China
  • fYear
    2013
  • Firstpage
    97
  • Lastpage
    100
  • Abstract
    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.
  • Keywords
    data structures; graph theory; network theory (graphs); query processing; visual databases; MCPath algorithm; aggregation graphs; candidate paths; graph index; multidimensional moving object network; query structure decomposition; shortest paths; structure data query algorithm; structure data querying; Algorithm design and analysis; Educational institutions; Indexes; Mobile communication; Mobile computing; Query processing; Software; multidimensional moving object network; shortest paths; structure query;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Web Information System and Application Conference (WISA), 2013 10th
  • Conference_Location
    Yangzhou
  • Print_ISBN
    978-1-4799-3218-4
  • Type

    conf

  • DOI
    10.1109/WISA.2013.27
  • Filename
    6778618