File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Slot index spatial join

TitleSlot index spatial join
Authors
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
Citation
Ieee Transactions On Knowledge And Data Engineering, 2003, v. 15 n. 1, p. 211-231 How to Cite?
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.
Persistent Identifierhttp://hdl.handle.net/10722/43664
ISSN
2023 Impact Factor: 8.9
2023 SCImago Journal Rankings: 2.867
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorPapadias, Den_HK
dc.date.accessioned2007-03-23T04:51:32Z-
dc.date.available2007-03-23T04:51:32Z-
dc.date.issued2003en_HK
dc.identifier.citationIeee Transactions On Knowledge And Data Engineering, 2003, v. 15 n. 1, p. 211-231en_HK
dc.identifier.issn1041-4347en_HK
dc.identifier.urihttp://hdl.handle.net/10722/43664-
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.en_HK
dc.format.extent3237099 bytes-
dc.format.extent26624 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tkdeen_HK
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineeringen_HK
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.subjectBuffer managementen_HK
dc.subjectDatabase indexen_HK
dc.subjectJoin processingen_HK
dc.subjectQuery processingen_HK
dc.subjectSpatial databasesen_HK
dc.subjectSpatial indexen_HK
dc.titleSlot index spatial joinen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1041-4347&volume=15&issue=1&spage=211&epage=231&date=2003&atitle=Slot+index+spatial+joinen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TKDE.2003.1161591en_HK
dc.identifier.scopuseid_2-s2.0-0037246488en_HK
dc.identifier.hkuros81185-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0037246488&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume15en_HK
dc.identifier.issue1en_HK
dc.identifier.spage211en_HK
dc.identifier.epage231en_HK
dc.identifier.isiWOS:000180230300014-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK
dc.identifier.issnl1041-4347-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats