File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Integration of Spatial Join Algorithms for Processing Multiple Inputs

TitleIntegration of Spatial Join Algorithms for Processing Multiple Inputs
Authors
KeywordsQuery Optimization
Spatial Joins
Spatial Query Processing
Issue Date1999
Citation
Sigmod Record (Acm Special Interest Group On Management Of Data), 1999, v. 28 n. 2, p. 1-12 How to Cite?
AbstractSeveral techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, providing solutions for the case where at least one input comes as an intermediate result of another database operator. In this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (SISJ), that efficiently computes the spatial join between two inputs, only one of which is indexed by an R-tree. Going one step further, we show how SISJ and other spatial join algorithms can be implemented as operators in a database environment that joins more than two spatial datasets. We study the differences between relational and spatial multiway joins, and propose a dynamic programming algorithm that optimizes the execution of complex spatial queries.
Persistent Identifierhttp://hdl.handle.net/10722/152297
ISSN
2015 Impact Factor: 0.698
2015 SCImago Journal Rankings: 0.543
References

 

DC FieldValueLanguage
dc.contributor.authorMamoulis, Nen_US
dc.contributor.authorPapadias, Den_US
dc.date.accessioned2012-06-26T06:37:00Z-
dc.date.available2012-06-26T06:37:00Z-
dc.date.issued1999en_US
dc.identifier.citationSigmod Record (Acm Special Interest Group On Management Of Data), 1999, v. 28 n. 2, p. 1-12en_US
dc.identifier.issn0163-5808en_US
dc.identifier.urihttp://hdl.handle.net/10722/152297-
dc.description.abstractSeveral techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, providing solutions for the case where at least one input comes as an intermediate result of another database operator. In this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (SISJ), that efficiently computes the spatial join between two inputs, only one of which is indexed by an R-tree. Going one step further, we show how SISJ and other spatial join algorithms can be implemented as operators in a database environment that joins more than two spatial datasets. We study the differences between relational and spatial multiway joins, and propose a dynamic programming algorithm that optimizes the execution of complex spatial queries.en_US
dc.languageengen_US
dc.relation.ispartofSIGMOD Record (ACM Special Interest Group on Management of Data)en_US
dc.subjectQuery Optimizationen_US
dc.subjectSpatial Joinsen_US
dc.subjectSpatial Query Processingen_US
dc.titleIntegration of Spatial Join Algorithms for Processing Multiple Inputsen_US
dc.typeArticleen_US
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_US
dc.identifier.authorityMamoulis, N=rp00155en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0040020712en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0040020712&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume28en_US
dc.identifier.issue2en_US
dc.identifier.spage1en_US
dc.identifier.epage12en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridMamoulis, N=6701782749en_US
dc.identifier.scopusauthoridPapadias, D=7005757795en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats