File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Complex spatial query processing
  • Basic View
  • Metadata View
  • XML View
TitleComplex spatial query processing
 
AuthorsMamoulis, N1
Papadias, D3
Arkoumanis, D2
 
KeywordsQuery optimization
Spatial joins
Spatial query processing
 
Issue Date2004
 
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1384-6175
 
CitationGeoinformatica, 2004, v. 8 n. 4, p. 311-346 [How to Cite?]
DOI: http://dx.doi.org/10.1023/B:GEIN.0000040830.73424.f0
 
AbstractThe user of a Geographical Information System is not limited to conventional spatial selections and joins, but may also pose more complicated and descriptive queries. In this paper, we focus on the efficient processing and optimization of complex spatial queries that involve combinations of spatial selections and joins. Our contribution is manifold; we first provide formulae that accurately estimate the selectivity of such queries. These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way. Second, we propose algorithms that process spatial joins and selections simultaneously and are typically more efficient than combinations of simple operators. Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models, and (ii) rules that reduce the optimization space significantly. The accuracy of the selectivity models and the efficiency of the proposed algorithms are evaluated through experimentation. © 2004 Kluwer Academic Publishers.
 
ISSN1384-6175
2013 Impact Factor: 1.288
 
DOIhttp://dx.doi.org/10.1023/B:GEIN.0000040830.73424.f0
 
ISI Accession Number IDWOS:000223747100001
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorMamoulis, N
 
dc.contributor.authorPapadias, D
 
dc.contributor.authorArkoumanis, D
 
dc.date.accessioned2010-09-06T09:51:19Z
 
dc.date.available2010-09-06T09:51:19Z
 
dc.date.issued2004
 
dc.description.abstractThe user of a Geographical Information System is not limited to conventional spatial selections and joins, but may also pose more complicated and descriptive queries. In this paper, we focus on the efficient processing and optimization of complex spatial queries that involve combinations of spatial selections and joins. Our contribution is manifold; we first provide formulae that accurately estimate the selectivity of such queries. These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way. Second, we propose algorithms that process spatial joins and selections simultaneously and are typically more efficient than combinations of simple operators. Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models, and (ii) rules that reduce the optimization space significantly. The accuracy of the selectivity models and the efficiency of the proposed algorithms are evaluated through experimentation. © 2004 Kluwer Academic Publishers.
 
dc.description.natureLink_to_subscribed_fulltext
 
dc.identifier.citationGeoinformatica, 2004, v. 8 n. 4, p. 311-346 [How to Cite?]
DOI: http://dx.doi.org/10.1023/B:GEIN.0000040830.73424.f0
 
dc.identifier.doihttp://dx.doi.org/10.1023/B:GEIN.0000040830.73424.f0
 
dc.identifier.epage346
 
dc.identifier.hkuros103325
 
dc.identifier.isiWOS:000223747100001
 
dc.identifier.issn1384-6175
2013 Impact Factor: 1.288
 
dc.identifier.issue4
 
dc.identifier.openurl
 
dc.identifier.scopuseid_2-s2.0-4444314673
 
dc.identifier.spage311
 
dc.identifier.urihttp://hdl.handle.net/10722/89015
 
dc.identifier.volume8
 
dc.languageeng
 
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1384-6175
 
dc.publisher.placeUnited States
 
dc.relation.ispartofGeoInformatica
 
dc.relation.referencesReferences in Scopus
 
dc.subjectQuery optimization
 
dc.subjectSpatial joins
 
dc.subjectSpatial query processing
 
dc.titleComplex spatial query processing
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Mamoulis, N</contributor.author>
<contributor.author>Papadias, D</contributor.author>
<contributor.author>Arkoumanis, D</contributor.author>
<date.accessioned>2010-09-06T09:51:19Z</date.accessioned>
<date.available>2010-09-06T09:51:19Z</date.available>
<date.issued>2004</date.issued>
<identifier.citation>Geoinformatica, 2004, v. 8 n. 4, p. 311-346</identifier.citation>
<identifier.issn>1384-6175</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/89015</identifier.uri>
<description.abstract>The user of a Geographical Information System is not limited to conventional spatial selections and joins, but may also pose more complicated and descriptive queries. In this paper, we focus on the efficient processing and optimization of complex spatial queries that involve combinations of spatial selections and joins. Our contribution is manifold; we first provide formulae that accurately estimate the selectivity of such queries. These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way. Second, we propose algorithms that process spatial joins and selections simultaneously and are typically more efficient than combinations of simple operators. Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models, and (ii) rules that reduce the optimization space significantly. The accuracy of the selectivity models and the efficiency of the proposed algorithms are evaluated through experimentation. &#169; 2004 Kluwer Academic Publishers.</description.abstract>
<language>eng</language>
<publisher>Springer New York LLC. The Journal&apos;s web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&amp;issn=1384-6175</publisher>
<relation.ispartof>GeoInformatica</relation.ispartof>
<subject>Query optimization</subject>
<subject>Spatial joins</subject>
<subject>Spatial query processing</subject>
<title>Complex spatial query processing</title>
<type>Article</type>
<identifier.openurl>http://library.hku.hk:4550/resserv?sid=HKU:IR&amp;issn=1384-6175&amp;volume=8&amp;issue=4&amp;spage=311&amp;epage=346&amp;date=2004&amp;atitle=Complex+Spatial+Query+Processing</identifier.openurl>
<description.nature>Link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1023/B:GEIN.0000040830.73424.f0</identifier.doi>
<identifier.scopus>eid_2-s2.0-4444314673</identifier.scopus>
<identifier.hkuros>103325</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-4444314673&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>8</identifier.volume>
<identifier.issue>4</identifier.issue>
<identifier.spage>311</identifier.spage>
<identifier.epage>346</identifier.epage>
<identifier.isi>WOS:000223747100001</identifier.isi>
<publisher.place>United States</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. Ethniko Metsovio Polytechnico
  3. Hong Kong University of Science and Technology