Hardware Acceleration for Spatial Selections and Joins

Chengyu Sun, Divyakant Agrawal, Amr El Abbadi

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

37 Citations (Scopus)

Abstract

Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects, and in the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. In this paper, we propose a novel approach to address this problem using efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and it applies to both intersection and distance predicates. Our experiments with real world datasets show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGMOD International Conference on Management of Data
EditorsA.Y. Halevy, Z.G. Ives, A.H. Doan
Pages455-466
Number of pages12
Publication statusPublished - 2003
Externally publishedYes
Event2003 ACM SIGMOD International Conference on Management of Data - San Diego, CA, United States
Duration: 9 Jun 200312 Jun 2003

Other

Other2003 ACM SIGMOD International Conference on Management of Data
CountryUnited States
CitySan Diego, CA
Period9/6/0312/6/03

Fingerprint

Hardware
Geometry
Costs
Computational geometry
Program processors
Processing
Experiments

Keywords

  • Hardware acceleration
  • Spatial join
  • Spatial selection

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Sun, C., Agrawal, D., & El Abbadi, A. (2003). Hardware Acceleration for Spatial Selections and Joins. In A. Y. Halevy, Z. G. Ives, & A. H. Doan (Eds.), Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 455-466)

Hardware Acceleration for Spatial Selections and Joins. / Sun, Chengyu; Agrawal, Divyakant; El Abbadi, Amr.

Proceedings of the ACM SIGMOD International Conference on Management of Data. ed. / A.Y. Halevy; Z.G. Ives; A.H. Doan. 2003. p. 455-466.

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

Sun, C, Agrawal, D & El Abbadi, A 2003, Hardware Acceleration for Spatial Selections and Joins. in AY Halevy, ZG Ives & AH Doan (eds), Proceedings of the ACM SIGMOD International Conference on Management of Data. pp. 455-466, 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA, United States, 9/6/03.
Sun C, Agrawal D, El Abbadi A. Hardware Acceleration for Spatial Selections and Joins. In Halevy AY, Ives ZG, Doan AH, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data. 2003. p. 455-466
Sun, Chengyu ; Agrawal, Divyakant ; El Abbadi, Amr. / Hardware Acceleration for Spatial Selections and Joins. Proceedings of the ACM SIGMOD International Conference on Management of Data. editor / A.Y. Halevy ; Z.G. Ives ; A.H. Doan. 2003. pp. 455-466
@inproceedings{93ebb9015b79457d88edc8f02673a9b2,
title = "Hardware Acceleration for Spatial Selections and Joins",
abstract = "Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects, and in the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. In this paper, we propose a novel approach to address this problem using efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and it applies to both intersection and distance predicates. Our experiments with real world datasets show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins.",
keywords = "Hardware acceleration, Spatial join, Spatial selection",
author = "Chengyu Sun and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2003",
language = "English",
pages = "455--466",
editor = "A.Y. Halevy and Z.G. Ives and A.H. Doan",
booktitle = "Proceedings of the ACM SIGMOD International Conference on Management of Data",

}

TY - GEN

T1 - Hardware Acceleration for Spatial Selections and Joins

AU - Sun, Chengyu

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2003

Y1 - 2003

N2 - Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects, and in the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. In this paper, we propose a novel approach to address this problem using efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and it applies to both intersection and distance predicates. Our experiments with real world datasets show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins.

AB - Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects, and in the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. In this paper, we propose a novel approach to address this problem using efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and it applies to both intersection and distance predicates. Our experiments with real world datasets show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins.

KW - Hardware acceleration

KW - Spatial join

KW - Spatial selection

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

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

M3 - Conference contribution

AN - SCOPUS:1142267340

SP - 455

EP - 466

BT - Proceedings of the ACM SIGMOD International Conference on Management of Data

A2 - Halevy, A.Y.

A2 - Ives, Z.G.

A2 - Doan, A.H.

ER -