download0 view933
twitter facebook

공공누리This item is licensed Korea Open Government License

dc.contributor.author
정영진
dc.contributor.author
류근호
dc.contributor.author
신문선
dc.date.accessioned
2019-08-28T07:40:53Z
dc.date.available
2019-08-28T07:40:53Z
dc.date.issued
2010-08-30
dc.identifier.issn
0164-1212
dc.identifier.uri
https://repository.kisti.re.kr/handle/10580/13864
dc.identifier.uri
http://www.ndsl.kr/ndsl/search/detail/article/articleSearchResultDetail.do?cn=NART53425761
dc.description.abstract
A major issue in LBS (Location Based Service) is the handling of numerous historical moving object data, affecting query performance and service quality in application systems. In order to store and search lots of data rapidly, an effective index structure is required for improving not only the insertion method, but also the search performance.

In order to improve the performance of both applications, we propose the GIP+ (Group Insertion tree with Projection Plus) for historical data manageme
dc.language
eng
dc.relation.ispartofseries
The Journal of systems and software
dc.title
Historical index structure for reducing insertion and search cost in LBS
dc.citation.endPage
1511
dc.citation.number
1
dc.citation.startPage
1500
dc.citation.volume
83
dc.subject.keyword
Moving object index
dc.subject.keyword
Separated buffer node
dc.subject.keyword
Projection storage
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
Files in This Item:
There are no files associated with this item.

Browse