Indexing non-uniform spatial data

K. V.Ravi Kanth, Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh

Research output: Contribution to conferencePaper

5 Citations (Scopus)

Abstract

Non-uniformity in data extents is a general characteristic of spatial data. Indexing such non-uniform data using conventional spatial index structures such as R*-trees is inefficient for two reasons: (1) The non-uniformity increases the likelihood of overlapping index entries, and, (2) clustering of non-uniform data is likely to index more dead space than clustering of uniform data. To reduce the impact of these anomalies, we propose a new scheme that promotes data objects to higher levels in tree-based index structures. We examine two criteria for promotion of data objects and evaluate their relative merits using an R*-tree. In experiments on cartographic data, we observe that our promotion criteria yield up to 45% improvement in query performance for an R*-tree.

Original languageEnglish
Pages289-298
Number of pages10
Publication statusPublished - 1 Dec 1997
EventProceedings of the 1997 International Database Engineering & Applications Symposium - Montreal, Can
Duration: 25 Aug 199727 Aug 1997

Other

OtherProceedings of the 1997 International Database Engineering & Applications Symposium
CityMontreal, Can
Period25/8/9727/8/97

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Kanth, K. V. R., Agrawal, D., El Abbadi, A., & Singh, A. K. (1997). Indexing non-uniform spatial data. 289-298. Paper presented at Proceedings of the 1997 International Database Engineering & Applications Symposium, Montreal, Can, .