Exploring spatial datasets with histograms

Chengyu Sun, Divyakant Agrawal, Amr El Abbadi

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

27 Citations (Scopus)

Abstract

As online spatial datasets grow both in number and sophistication, it becomes increasingly difficult for users to decide whether a dataset is suitable for their tasks, especially when they do not have prior knowledge of the dataset. The GeoBrowsing service developed for the ADL project provides users an effective and efficient way to explore the content of a spatial dataset. In this paper, we identify a set of spatial relations that need to be supported in browsing applications, namely, the contains, contained and the over-lap relations. We prove a storage lower bound to answer queries about the contains relation accurately at a given grid resolution. We then present three storage-efficient approximation algorithms which we believe to be the first to estimate query selectivities about these spatial relations. Experimental results show that these algorithms provide highly accurate estimates in real time for a wide range of datasets with various characteristics.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
EditorsR Agrawal, K Dittrich, A Ngu
Pages93-102
Number of pages10
Publication statusPublished - 1 Jan 2002
Externally publishedYes
Event18th International Conference on Data Engineering - San Jose, CA, United States
Duration: 26 Feb 20021 Mar 2002

Other

Other18th International Conference on Data Engineering
CountryUnited States
CitySan Jose, CA
Period26/2/021/3/02

Fingerprint

Approximation algorithms

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Sun, C., Agrawal, D., & El Abbadi, A. (2002). Exploring spatial datasets with histograms. In R. Agrawal, K. Dittrich, & A. Ngu (Eds.), Proceedings - International Conference on Data Engineering (pp. 93-102)

Exploring spatial datasets with histograms. / Sun, Chengyu; Agrawal, Divyakant; El Abbadi, Amr.

Proceedings - International Conference on Data Engineering. ed. / R Agrawal; K Dittrich; A Ngu. 2002. p. 93-102.

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

Sun, C, Agrawal, D & El Abbadi, A 2002, Exploring spatial datasets with histograms. in R Agrawal, K Dittrich & A Ngu (eds), Proceedings - International Conference on Data Engineering. pp. 93-102, 18th International Conference on Data Engineering, San Jose, CA, United States, 26/2/02.
Sun C, Agrawal D, El Abbadi A. Exploring spatial datasets with histograms. In Agrawal R, Dittrich K, Ngu A, editors, Proceedings - International Conference on Data Engineering. 2002. p. 93-102
Sun, Chengyu ; Agrawal, Divyakant ; El Abbadi, Amr. / Exploring spatial datasets with histograms. Proceedings - International Conference on Data Engineering. editor / R Agrawal ; K Dittrich ; A Ngu. 2002. pp. 93-102
@inproceedings{6308e7ac647e4899b6ee1eceda6b6bca,
title = "Exploring spatial datasets with histograms",
abstract = "As online spatial datasets grow both in number and sophistication, it becomes increasingly difficult for users to decide whether a dataset is suitable for their tasks, especially when they do not have prior knowledge of the dataset. The GeoBrowsing service developed for the ADL project provides users an effective and efficient way to explore the content of a spatial dataset. In this paper, we identify a set of spatial relations that need to be supported in browsing applications, namely, the contains, contained and the over-lap relations. We prove a storage lower bound to answer queries about the contains relation accurately at a given grid resolution. We then present three storage-efficient approximation algorithms which we believe to be the first to estimate query selectivities about these spatial relations. Experimental results show that these algorithms provide highly accurate estimates in real time for a wide range of datasets with various characteristics.",
author = "Chengyu Sun and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2002",
month = "1",
day = "1",
language = "English",
pages = "93--102",
editor = "R Agrawal and K Dittrich and A Ngu",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - Exploring spatial datasets with histograms

AU - Sun, Chengyu

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2002/1/1

Y1 - 2002/1/1

N2 - As online spatial datasets grow both in number and sophistication, it becomes increasingly difficult for users to decide whether a dataset is suitable for their tasks, especially when they do not have prior knowledge of the dataset. The GeoBrowsing service developed for the ADL project provides users an effective and efficient way to explore the content of a spatial dataset. In this paper, we identify a set of spatial relations that need to be supported in browsing applications, namely, the contains, contained and the over-lap relations. We prove a storage lower bound to answer queries about the contains relation accurately at a given grid resolution. We then present three storage-efficient approximation algorithms which we believe to be the first to estimate query selectivities about these spatial relations. Experimental results show that these algorithms provide highly accurate estimates in real time for a wide range of datasets with various characteristics.

AB - As online spatial datasets grow both in number and sophistication, it becomes increasingly difficult for users to decide whether a dataset is suitable for their tasks, especially when they do not have prior knowledge of the dataset. The GeoBrowsing service developed for the ADL project provides users an effective and efficient way to explore the content of a spatial dataset. In this paper, we identify a set of spatial relations that need to be supported in browsing applications, namely, the contains, contained and the over-lap relations. We prove a storage lower bound to answer queries about the contains relation accurately at a given grid resolution. We then present three storage-efficient approximation algorithms which we believe to be the first to estimate query selectivities about these spatial relations. Experimental results show that these algorithms provide highly accurate estimates in real time for a wide range of datasets with various characteristics.

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

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

M3 - Conference contribution

AN - SCOPUS:0036209207

SP - 93

EP - 102

BT - Proceedings - International Conference on Data Engineering

A2 - Agrawal, R

A2 - Dittrich, K

A2 - Ngu, A

ER -