Name
Title | ||
|---|---|---|
MCPath: Effectively Query the Structure Data in the Multidimensional Moving Object Network |
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/WISA.2013.27 | IEEE WISA |
Keywords | Field | DocType |
aggregation graphs,algorithm change,querying structure data,structure data query algorithm,structure data querying,former method,shortest paths,visual databases,algorithm mcpath,data structures,specific dimension,query structure,mcpath algorithm,structure query,query structure decomposition,structure data,multidimensional moving object network,structural data,graph index,graph theory,candidate paths,interesting structure data,object network,effectively query,network theory (graphs),query processing | Query optimization,Data mining,Query language,RDF query language,Query expansion,Computer science,Sargable,Web query classification,Theoretical computer science,Query by Example,Online aggregation | Conference |
ISBN | Citations | PageRank |
978-1-4799-3218-4 | 0 | 0.34 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kongfa Hu | 1 | 38 | 9.26 |
| Long Li | 2 | 0 | 0.34 |
| Xiangqian Xue | 3 | 0 | 0.34 |
| Ling Chen | 4 | 217 | 29.30 |