Please use this identifier to cite or link to this item:
Title: Indexing for dynamic abstract regions
Authors: Jaffar, J. 
Yap, R.H.C. 
Zhu, K.Q.
Issue Date: 2006
Citation: Jaffar, J.,Yap, R.H.C.,Zhu, K.Q. (2006). Indexing for dynamic abstract regions. Proceedings - International Conference on Data Engineering 2006 : 12-. ScholarBank@NUS Repository.
Abstract: We propose a new main memory index structure for abstract regions (objects) which may heavily overlap, the RC-tree. These objects are "dynamic" and may have short life spans. The novelty is that rather than representing an object by its minimum bounding rectangle (MBR), possibly with pre-processed segmentation into many small MBRs, we use the actual shape of the object to maintain the index. This saves significant space for objects with large spatial extents since pre-segmentation is not needed. We show that the query performance of RC-tree is much better than many indexing schemes on synthetic overlapping data sets. The performance is also competitive on real-life GIS non-overlapping data sets. © 2006 IEEE.
Source Title: Proceedings - International Conference on Data Engineering
ISBN: 0769525709
ISSN: 10844627
DOI: 10.1109/ICDE.2006.81
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on May 22, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.