File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Slot index spatial join
  • Basic View
  • Metadata View
  • XML View
TitleSlot index spatial join
 
AuthorsMamoulis, N1
Papadias, D2
 
KeywordsBuffer management
Database index
Join processing
Query processing
Spatial databases
Spatial index
 
Issue Date2003
 
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tkde
 
CitationIeee Transactions On Knowledge And Data Engineering, 2003, v. 15 n. 1, p. 211-231 [How to Cite?]
DOI: http://dx.doi.org/10.1109/TKDE.2003.1161591
 
AbstractEfficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computational cost of SISJ and we compare it, analytically and experimentally, with other spatial join methods for two cases: 1) when the nonindexed input is read from disk and 2) when it is an intermediate result of a preceding database operator in a complex query plan. The importance of buffer splitting between consecutive join operators is also demonstrated through a two-join case study and a method that estimates the optimal splitting is proposed. Our evaluation shows that SISJ outperforms alternative methods in most cases and is suitable for limited memory conditions.
 
ISSN1041-4347
2013 Impact Factor: 1.815
2013 SCImago Journal Rankings: 1.763
 
DOIhttp://dx.doi.org/10.1109/TKDE.2003.1161591
 
ISI Accession Number IDWOS:000180230300014
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorMamoulis, N
 
dc.contributor.authorPapadias, D
 
dc.date.accessioned2007-03-23T04:51:32Z
 
dc.date.available2007-03-23T04:51:32Z
 
dc.date.issued2003
 
dc.description.abstractEfficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computational cost of SISJ and we compare it, analytically and experimentally, with other spatial join methods for two cases: 1) when the nonindexed input is read from disk and 2) when it is an intermediate result of a preceding database operator in a complex query plan. The importance of buffer splitting between consecutive join operators is also demonstrated through a two-join case study and a method that estimates the optimal splitting is proposed. Our evaluation shows that SISJ outperforms alternative methods in most cases and is suitable for limited memory conditions.
 
dc.description.naturepublished_or_final_version
 
dc.format.extent3237099 bytes
 
dc.format.extent26624 bytes
 
dc.format.mimetypeapplication/pdf
 
dc.format.mimetypeapplication/msword
 
dc.identifier.citationIeee Transactions On Knowledge And Data Engineering, 2003, v. 15 n. 1, p. 211-231 [How to Cite?]
DOI: http://dx.doi.org/10.1109/TKDE.2003.1161591
 
dc.identifier.doihttp://dx.doi.org/10.1109/TKDE.2003.1161591
 
dc.identifier.epage231
 
dc.identifier.hkuros81185
 
dc.identifier.isiWOS:000180230300014
 
dc.identifier.issn1041-4347
2013 Impact Factor: 1.815
2013 SCImago Journal Rankings: 1.763
 
dc.identifier.issue1
 
dc.identifier.openurl
 
dc.identifier.scopuseid_2-s2.0-0037246488
 
dc.identifier.spage211
 
dc.identifier.urihttp://hdl.handle.net/10722/43664
 
dc.identifier.volume15
 
dc.languageeng
 
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tkde
 
dc.publisher.placeUnited States
 
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineering
 
dc.relation.referencesReferences in Scopus
 
dc.rights©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
 
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License
 
dc.subjectBuffer management
 
dc.subjectDatabase index
 
dc.subjectJoin processing
 
dc.subjectQuery processing
 
dc.subjectSpatial databases
 
dc.subjectSpatial index
 
dc.titleSlot index spatial join
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Mamoulis, N</contributor.author>
<contributor.author>Papadias, D</contributor.author>
<date.accessioned>2007-03-23T04:51:32Z</date.accessioned>
<date.available>2007-03-23T04:51:32Z</date.available>
<date.issued>2003</date.issued>
<identifier.citation>Ieee Transactions On Knowledge And Data Engineering, 2003, v. 15 n. 1, p. 211-231</identifier.citation>
<identifier.issn>1041-4347</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/43664</identifier.uri>
<description.abstract>Efficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computational cost of SISJ and we compare it, analytically and experimentally, with other spatial join methods for two cases: 1) when the nonindexed input is read from disk and 2) when it is an intermediate result of a preceding database operator in a complex query plan. The importance of buffer splitting between consecutive join operators is also demonstrated through a two-join case study and a method that estimates the optimal splitting is proposed. Our evaluation shows that SISJ outperforms alternative methods in most cases and is suitable for limited memory conditions.</description.abstract>
<format.extent>3237099 bytes</format.extent>
<format.extent>26624 bytes</format.extent>
<format.mimetype>application/pdf</format.mimetype>
<format.mimetype>application/msword</format.mimetype>
<language>eng</language>
<publisher>I E E E. The Journal&apos;s web site is located at http://www.computer.org/tkde</publisher>
<relation.ispartof>IEEE Transactions on Knowledge and Data Engineering</relation.ispartof>
<rights>&#169;2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<subject>Buffer management</subject>
<subject>Database index</subject>
<subject>Join processing</subject>
<subject>Query processing</subject>
<subject>Spatial databases</subject>
<subject>Spatial index</subject>
<title>Slot index spatial join</title>
<type>Article</type>
<identifier.openurl>http://library.hku.hk:4550/resserv?sid=HKU:IR&amp;issn=1041-4347&amp;volume=15&amp;issue=1&amp;spage=211&amp;epage=231&amp;date=2003&amp;atitle=Slot+index+spatial+join</identifier.openurl>
<description.nature>published_or_final_version</description.nature>
<identifier.doi>10.1109/TKDE.2003.1161591</identifier.doi>
<identifier.scopus>eid_2-s2.0-0037246488</identifier.scopus>
<identifier.hkuros>81185</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-0037246488&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>15</identifier.volume>
<identifier.issue>1</identifier.issue>
<identifier.spage>211</identifier.spage>
<identifier.epage>231</identifier.epage>
<identifier.isi>WOS:000180230300014</identifier.isi>
<publisher.place>United States</publisher.place>
<bitstream.url>http://hub.hku.hk/bitstream/10722/43664/1/81185.pdf</bitstream.url>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. Hong Kong University of Science and Technology