본문 바로가기

Optimal Index Partitioning of Main-Memory Based TPR∗-Tree for Real-Time Tactical Moving Objects

문서 유형
연구출판물 · 학술대회 발표논문
등재
Scopus
피인용
Scopus 2
FWCI (Scopus)
0.43

저자

  1. 이지완제1저자Dept. of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
  2. 홍봉희Dept. of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
  3. 홍재기Dept. of Electrical and Computer Engineering, Pusan National University, Busan, South Korea
  4. Kim, ChumsooAgency for Defense Development, South Korea
  5. Kim, Woo ChanAgency for Defense Development, South Korea

초록

The main-memory based TPR∗-tree for real-time tactical moving objects is most effective for real-time prediction query processing. The target objects collected from radar are mixed with high-speed objects of aviation in addition to the low-speed objects in the sea, and there is a problem that the overlap area of the MBR increases in the main-memory based TPR∗-tree. This paper proposes an optimal index partitioning to minimize the overlap of MBR in main-memory based TPR∗-tree. An optimization partitioning algorithm is proposed in which both the cost of space-time prediction query processing is minimized and the cost of combining processing of divided indexes is minimized.

키워드

Index PartitioningRange Query ProcessingSpatio-Temporal IndexTactical Moving Objects

식별자

Scopus EID
2-s2.0-85048477110