GSMNet: A Hierarchical Graph Model for Moving Objects in Networks

Abstract

Abstract:Existing data models for moving objects in networks are often limited by flexibly controlling the granularity of representing networks and the cost of location updates and do not encompass semantic information, such as traffic states, traffic restrictions and social relationships. In this paper, we aim to fill the gap of traditional network-constrained models and propose a hierarchical graph model called the Geo-Social-Moving model for moving objects in Networks (GSMNet) that adopts four graph structures, RouteGraph, SegmentGraph, ObjectGraph and MoveGraph, to represent the underlying networks, trajectories and semantic information in an integrated manner. The bulk of user-defined data types and corresponding operators is proposed to handle moving objects and answer a new class of queries supporting three kinds of conditions: spatial, temporal and semantic information. Then, we develop a prototype system with the native graph database system Neo4Jto implement the proposed GSMNet model. In the experiment, we conduct the performance evaluation using simulated trajectories generated from the BerlinMOD (Berlin Moving Objects Database) benchmark and compare with the mature MOD system Secondo. The results of 17 benchmark queries demonstrate that our proposed GSMNet model has strong potential to reduce time-consuming table join operations an d shows remarkable advantages with regard to representing semantic information and controlling the cost of location updates.

Development and investigation of methods of graphic-functional modeling of distributed systems

“…1 0 0 01 0 0 0 0 0 0 1 0 using the formulas (8) and (13) it has the following form: As can be seen from the expressions obtained, for the graph, any pair of adjacent vertices of which merely connects an edge, the corresponding vectors θ θ ij ji ≠ contain only single or zero elements in each position. For the more general case of a mixed graph (Fig.…”

“…For the above example, the expressions of the parametric-topological matrices based on the adjacency matrix according to the formulas (8), (12) and (8), (13) have the following form: To reproduce distributed systems or large dimension objects by using the developed method, a method of direct sums, which was used for the parametric-topological matrices based on the adjacency matrices in the paper [15], should be used. However, the elucidation of the specifics of its application for the parametric-topological matrices based on the adjacency matrices requires a separate thorough research.…”

“…A similar problem is solved in the study given in the paper [13]. Unlike the work [12], it uses the distributed status of moving objects traffic instead of its point density as the basis for it.…”

“…Either way, it is necessary to generalize the methods, models and means of graph-analytical modeling of distributed technological systems and objects, set forth in the writings [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. In the aspect of the application of these categories in order to research the work and automated design of information management systems, one can distinguish such general limitations and disadvantages:…”

“…It should be noted that the matrices formed on the basis of the basic valence (positive or negative) by the formulas (8)- (13) are asymmetric. This follows directly from the properties of the adjacency of the graph elements provided that the edges are oriented between the corresponding vertices.…”