Optimal partitioning for efficient I/O in spatial databases

Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi

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

1 Citation (Scopus)

Abstract

It is desirable to design partitioning techniques that minimize the I/Oti me incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for different types of queries, and develop multi-disk allocation techniques that maximize the degree of I/Opa rallelism obtained during the retrieval. We show that hexagonal partitioning has optimal I/Ocost for circular queries compared to all possible non-overlapping partitioning techniques that use convex regions. For rectangular queries, we show that although for the special case when queries are rectilinear, rectangular grid partitioning gives superior performance, hexagonal partitioning has overall better I/O cost for a general class of range queries. We then discuss parallel storage and retrieval techniques for hexagonal partitioning using current techniques for rectangular grid partitioning.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages889-900
Number of pages12
Volume2150
ISBN (Print)3540424954, 9783540424956
Publication statusPublished - 2001
Externally publishedYes
Event7th European Conference on Parallel Computing, Euro-Par 2001 - Manchester, United Kingdom
Duration: 28 Aug 200131 Aug 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2150
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th European Conference on Parallel Computing, Euro-Par 2001
CountryUnited Kingdom
CityManchester
Period28/8/0131/8/01

Fingerprint

Spatial Database
Partitioning
Query
Costs
Hexagon
Retrieval
Grid
Range Query
Spatial Data
Maximise
Minimise

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ferhatosmanoglu, H., Agrawal, D., & El Abbadi, A. (2001). Optimal partitioning for efficient I/O in spatial databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 889-900). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2150). Springer Verlag.

Optimal partitioning for efficient I/O in spatial databases. / Ferhatosmanoglu, Hakan; Agrawal, Divyakant; El Abbadi, Amr.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2150 Springer Verlag, 2001. p. 889-900 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2150).

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

Ferhatosmanoglu, H, Agrawal, D & El Abbadi, A 2001, Optimal partitioning for efficient I/O in spatial databases. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2150, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2150, Springer Verlag, pp. 889-900, 7th European Conference on Parallel Computing, Euro-Par 2001, Manchester, United Kingdom, 28/8/01.
Ferhatosmanoglu H, Agrawal D, El Abbadi A. Optimal partitioning for efficient I/O in spatial databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2150. Springer Verlag. 2001. p. 889-900. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ferhatosmanoglu, Hakan ; Agrawal, Divyakant ; El Abbadi, Amr. / Optimal partitioning for efficient I/O in spatial databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2150 Springer Verlag, 2001. pp. 889-900 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{74693f4797a041d289d032c564fcb9cd,
title = "Optimal partitioning for efficient I/O in spatial databases",
abstract = "It is desirable to design partitioning techniques that minimize the I/Oti me incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for different types of queries, and develop multi-disk allocation techniques that maximize the degree of I/Opa rallelism obtained during the retrieval. We show that hexagonal partitioning has optimal I/Ocost for circular queries compared to all possible non-overlapping partitioning techniques that use convex regions. For rectangular queries, we show that although for the special case when queries are rectilinear, rectangular grid partitioning gives superior performance, hexagonal partitioning has overall better I/O cost for a general class of range queries. We then discuss parallel storage and retrieval techniques for hexagonal partitioning using current techniques for rectangular grid partitioning.",
author = "Hakan Ferhatosmanoglu and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2001",
language = "English",
isbn = "3540424954",
volume = "2150",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "889--900",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Optimal partitioning for efficient I/O in spatial databases

AU - Ferhatosmanoglu, Hakan

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2001

Y1 - 2001

N2 - It is desirable to design partitioning techniques that minimize the I/Oti me incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for different types of queries, and develop multi-disk allocation techniques that maximize the degree of I/Opa rallelism obtained during the retrieval. We show that hexagonal partitioning has optimal I/Ocost for circular queries compared to all possible non-overlapping partitioning techniques that use convex regions. For rectangular queries, we show that although for the special case when queries are rectilinear, rectangular grid partitioning gives superior performance, hexagonal partitioning has overall better I/O cost for a general class of range queries. We then discuss parallel storage and retrieval techniques for hexagonal partitioning using current techniques for rectangular grid partitioning.

AB - It is desirable to design partitioning techniques that minimize the I/Oti me incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for different types of queries, and develop multi-disk allocation techniques that maximize the degree of I/Opa rallelism obtained during the retrieval. We show that hexagonal partitioning has optimal I/Ocost for circular queries compared to all possible non-overlapping partitioning techniques that use convex regions. For rectangular queries, we show that although for the special case when queries are rectilinear, rectangular grid partitioning gives superior performance, hexagonal partitioning has overall better I/O cost for a general class of range queries. We then discuss parallel storage and retrieval techniques for hexagonal partitioning using current techniques for rectangular grid partitioning.

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

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

M3 - Conference contribution

SN - 3540424954

SN - 9783540424956

VL - 2150

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 889

EP - 900

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -