Indexing non-uniform spatial data

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings of the International Database Engineering & Applications Symposium, IDEAS
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages289-298
Number of pages10
Publication statusPublished - 1 Dec 1997
Externally publishedYes
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

Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kanth, K. V. R., Agrawal, D., El Abbadi, A., & Singh, A. K. (1997). Indexing non-uniform spatial data. In Anon (Ed.), Proceedings of the International Database Engineering & Applications Symposium, IDEAS (pp. 289-298). Piscataway, NJ, United States: IEEE.

Indexing non-uniform spatial data. / Kanth, K. V Ravi; Agrawal, Divyakant; El Abbadi, Amr; Singh, Ambuj K.

Proceedings of the International Database Engineering & Applications Symposium, IDEAS. ed. / Anon. Piscataway, NJ, United States : IEEE, 1997. p. 289-298.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kanth, KVR, Agrawal, D, El Abbadi, A & Singh, AK 1997, Indexing non-uniform spatial data. in Anon (ed.), Proceedings of the International Database Engineering & Applications Symposium, IDEAS. IEEE, Piscataway, NJ, United States, pp. 289-298, Proceedings of the 1997 International Database Engineering & Applications Symposium, Montreal, Can, 25/8/97.
Kanth KVR, Agrawal D, El Abbadi A, Singh AK. Indexing non-uniform spatial data. In Anon, editor, Proceedings of the International Database Engineering & Applications Symposium, IDEAS. Piscataway, NJ, United States: IEEE. 1997. p. 289-298
Kanth, K. V Ravi ; Agrawal, Divyakant ; El Abbadi, Amr ; Singh, Ambuj K. / Indexing non-uniform spatial data. Proceedings of the International Database Engineering & Applications Symposium, IDEAS. editor / Anon. Piscataway, NJ, United States : IEEE, 1997. pp. 289-298
@inproceedings{aaa616399a8149c09e037672a92d057e,
title = "Indexing non-uniform spatial data",
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.",
author = "Kanth, {K. V Ravi} and Divyakant Agrawal and {El Abbadi}, Amr and Singh, {Ambuj K.}",
year = "1997",
month = "12",
day = "1",
language = "English",
pages = "289--298",
editor = "Anon",
booktitle = "Proceedings of the International Database Engineering & Applications Symposium, IDEAS",
publisher = "IEEE",

}

TY - GEN

T1 - Indexing non-uniform spatial data

AU - Kanth, K. V Ravi

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

AU - Singh, Ambuj K.

PY - 1997/12/1

Y1 - 1997/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031334203&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031334203&partnerID=8YFLogxK

M3 - Conference contribution

SP - 289

EP - 298

BT - Proceedings of the International Database Engineering & Applications Symposium, IDEAS

A2 - Anon, null

PB - IEEE

CY - Piscataway, NJ, United States

ER -