HEAL DSpace

Constraint-Based Processing of Multiway Spatial Joins

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Papadias, D en
dc.contributor.author Mamoulis, N en
dc.contributor.author Theodoridis, Y en
dc.date.accessioned 2014-03-01T01:50:43Z
dc.date.available 2014-03-01T01:50:43Z
dc.date.issued 2001 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/26084
dc.subject Constraint Satisfaction en
dc.subject Constraint Satisfaction Problem en
dc.subject Cost Model en
dc.subject Optimal Method en
dc.subject Search Algorithm en
dc.subject Search Space en
dc.subject Spatial Database en
dc.subject Spatial Index en
dc.subject Spatial Join en
dc.subject Spatial Relation en
dc.title Constraint-Based Processing of Multiway Spatial Joins en
heal.type journalArticle en
heal.identifier.primary 10.1007/s00453-001-0005-y en
heal.identifier.secondary http://dx.doi.org/10.1007/s00453-001-0005-y en
heal.publicationDate 2001 en
heal.abstract A multiway spatial join combines information found in three or more spatial relations with respect to some spatial predicates. Motivated by their close correspondence with constraint satisfaction problems (CSPs), we show how multiway spatial joins can be processed by systematic search algorithms traditionally used for CSPs. This paper describes two different strategies, window reduction and synchronous traversal, that take advantage en
heal.journalName Algorithmica en
dc.identifier.doi 10.1007/s00453-001-0005-y en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record