An Efficient Indexing Technique for Processing of Spatio-temporal Data
- Authors
- 이동원; 오병우
- Issue Date
- 2017
- Publisher
- 한국정보기술학회
- Keywords
- spatio-temporal data; indexing; data structure; moving object
- Citation
- 한국정보기술학회 영문논문지, v.7, no.2, pp.65 - 71
- Journal Title
- 한국정보기술학회 영문논문지
- Volume
- 7
- Number
- 2
- Start Page
- 65
- End Page
- 71
- URI
- https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/1115
- DOI
- 10.14801/JAITC.2017.7.2.65
- ISSN
- 2234-1072
- Abstract
- The huge amount of data is created by smart devices these days. This data is collected in real-time at real world, and used in various fields very usefully. Seoul city used their citizens’ phone call statistics data and LTE usage statistics data to select the best midnight bus route. In this case, citizens are moving object and this information is objects’ data. Therefore, bus route selection’s neutrality and reliability were guaranteed by using statistics data. This case shows us positive side of these moving objects data. In this paper, we propose an efficient indexing technique for processing of spatio-temporal data. The proposed index has a structure that extends B+-tree. It can process two kinds of defined query: query of all objects located in space R at time T and query of all objects located in space R.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Electronic Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/1115)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.