MONET: Modeling and Querying Moving Objects in Spatial Networks

被引:0
|
作者
Qi, Lin [1 ]
Schneider, Markus [1 ]
机构
[1] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL 32611 USA
基金
美国国家科学基金会;
关键词
Moving Objects; Spatial Networks; Modeling; Querying;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data about moving objects is being collected in many different application domains with the help of sensor networks, and GPS-enabled devices. In most cases, the moving objects are not free to move, they are usually restricted by some spatial constraints such as Spatial Networks. Spatial networks are ubiquitous and have been widely used in transportation, traffic planning, navigation as well as in Geographical Information System (GIS) applications. In most scenarios, moving objects such as vehicles move along predefined spatial networks like transportation networks. Unfortunately, the concepts for modeling and querying objects in unconstrained spaces like an outdoor space cannot be transferred to constrained spaces like a road network due to the different features of the environments in which the spatial objects move. Further, modern positioning devices as well as mobile and sensor technology have led to large volumes of moving objects in spatial networks. Therefore, we need a database-friendly data model to explicitly model spatial networks and, more importantly, describe relative movements in these networks. In this paper, we propose a new two-layered data model called MONET (Moving Objects in NETworks) model. The lower layer is a data model for spatial networks. This data model is the prerequisite for the upper model that represents moving objects in these networks. This layered model fits well to formulate relationships between moving objects and a network in queries. A query language, called MONET QL (MONET Query Language), allows a clear description of and access to moving objects in spatial networks and to provides high-level operations on them.
引用
收藏
页码:48 / 57
页数:10
相关论文
共 50 条
  • [41] Moving objects databases based on dynamic transportation networks: Modeling, indexing, and implementation
    Institute of Software, Chinese Academy of Sciences, South-Fourth-Street 4, Zhong-Guan-Cun
    Beijing
    100080, China
    Lect. Notes Comput. Sci.,
  • [42] Indexing and Querying Techniques for Moving Objects in Both Euclidean Space and Road Network
    Heendaliya, L.
    Wisely, M.
    Lin, D.
    Sarvestani, S. Sedigh
    Hurson, A.
    ADVANCES IN COMPUTERS, VOL 102, 2016, 102 : 111 - 170
  • [43] A new signature-based indexing scheme for trajectories of moving objects on spatial networks
    Chang, Jaewoo
    Um, Jungho
    Kim, Youngjin
    COMPUTATIONAL SCIENCE - ICCS 2008, PT 1, 2008, 5101 : 731 - 740
  • [44] Search continuous spatial keyword range queries over moving objects in road networks
    Li, Yanhong, 2015, Binary Information Press (11):
  • [45] Continuous queries within an architecture for querying XML-represented moving objects
    Brinkhoff, T
    Weitkämper, J
    ADVANCES IN SPATIAL AND TEMPORAL DATABASES, PROCEEDINGS, 2001, 2121 : 136 - 154
  • [46] QUERYING AND REASONING WITH PRODUCT ENGINEERING ONTOLOGIES - MOVING PAST MODELING
    Zhu, Lijuan
    Jayaram, Uma
    Jayaram, Sankar
    Kim, OkJoon
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, DETC 2010, VOL 3, A AND B, 2010, : 549 - 561
  • [47] Spatial Range Querying for Gaussian-Based Imprecise Query Objects
    Ishikawa, Yoshiharu
    Iijima, Yuichi
    Yu, Jeffrey Xu
    ICDE: 2009 IEEE 25TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2009, : 676 - +
  • [48] Indexing the trajectories of moving objects in networks
    de Almeida, V
    Güting, RH
    GEOINFORMATICA, 2005, 9 (01) : 33 - 60
  • [49] Indexing the Trajectories of Moving Objects in Networks*
    Victor Teixeira de Almeida
    Ralf Hartmut Güting
    GeoInformatica, 2005, 9 : 33 - 60
  • [50] Indexing objects moving on fixed networks
    Frentzos, E
    ADVANCES IN SPATIAL AND TEMPORAL DATABASES, PROCEEDINGS, 2003, 2750 : 289 - 305