Search algorithms for mutiway spatial joins

Papadias, D; Arkoumanis, D

dc.contributor.author	Papadias, D	en
dc.contributor.author	Arkoumanis, D	en
dc.date.accessioned	2014-03-01T01:18:20Z
dc.date.available	2014-03-01T01:18:20Z
dc.date.issued	2002	en
dc.identifier.issn	1365-8816	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14937
dc.subject	Best Approximation	en
dc.subject	Exact Solution	en
dc.subject	Multimedia Data	en
dc.subject	Query Processing	en
dc.subject	Search Algorithm	en
dc.subject	Search Space	en
dc.subject	Spatial Join	en
dc.subject	Real Time Systems	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Geography	en
dc.subject.classification	Geography, Physical	en
dc.subject.classification	Information Science & Library Science	en
dc.subject.other	CONSTRAINT SATISFACTION	en
dc.title	Search algorithms for mutiway spatial joins	en
heal.type	journalArticle	en
heal.identifier.primary	10.1080/13658810210138733	en
heal.identifier.secondary	http://dx.doi.org/10.1080/13658810210138733	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	This paper deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) there is unlimited time and the goal is to retrieve a single exact solution, if such a solution exists, or the best approximate one otherwise. The first case is motivated by the high cost of join processing in real-time systems involving large amounts of multimedia data, while the second one is motivated by applications that require 'negative' examples. We propose several search algorithms for query processing under theses conditions. For the limited-time case we develop some non-deterministic search heuristics that can quickly retrieve good solutions. However, these heuristics are not guaranteed to find the best solutions, even without a time limit. Therefore, for the unlimited-time case we describe systematic search algorithms tailored specifically for the efficient retrieval of a single solution. Both types of algorithms are integrated with R-trees in order to prune the search space. Our proposal is evaluated with extensive experimental comparison.	en
heal.publisher	TAYLOR & FRANCIS LTD	en
heal.journalName	INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE	en
dc.identifier.doi	10.1080/13658810210138733	en
dc.identifier.isi	ISI:000178291800001	en
dc.identifier.volume	16	en
dc.identifier.issue	7	en
dc.identifier.spage	613	en
dc.identifier.epage	639	en