Indexing for Dynamic Abstract Regions

for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Kenny Q. Zhu Microsoft Corporation One Microsoft Way Redmond, WA 98052, USA [e-mail] We propose a new main memory index structure for abstract regions (objects) which may heavily overlap, the RCtree. 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 nonoverlapping data sets.

• Type: Conference
• Year: 2006
• Where: ICDE
• Authors: Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
• Keywords: Database, Dynamic Abstract Regions, ICDE 2006, Minimum Bounding Rectangle, Overlapping Data Sets