Index based on Constraint Network for Spatio-Temporal Aggregation of Trajectory in Spatial Data Warehouse

• Published in: 멀티미디어학회논문지 Vol. 9; no. 12; pp. 1529 - 1541
• Main Authors: Li Jing Jing, Lee Dong-Wook, You Byeong-Seob, Oh Young-Hwan, Bae Hae-Young
• Format: Journal Article
• Language: Korean
• Published: 한국멀티미디어학회 01.12.2006
• Subjects: 전자/정보통신공학; Spatio-temporal Data Warehouse; Trajectory Aggregation; Constraint Network
• ISSN: 1229-7771; 2384-0102

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.