Multi-dimensional range query processing with spatial relations

Papadias, D; Theodoridis, Y; Stefanakis, E

dc.contributor.author	Papadias, D	en
dc.contributor.author	Theodoridis, Y	en
dc.contributor.author	Stefanakis, E	en
dc.date.accessioned	2014-03-01T01:13:12Z
dc.date.available	2014-03-01T01:13:12Z
dc.date.issued	1997	en
dc.identifier.issn	10692665	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12358
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0242329136&partnerID=40&md5=df61ac341fa87ca7e093fafd6e6e7a43	en
dc.subject	Query processing	en
dc.subject	Spatial data structures	en
dc.subject	Spatial relations	en
dc.title	Multi-dimensional range query processing with spatial relations	en
heal.type	journalArticle	en
heal.publicationDate	1997	en
heal.abstract	The processing of multi-dimensional range queries involving spatial relations arises in many application areas including Spatial Databases and GISs. In this paper we show how a variety of three- or four-dimensional queries that correspond to different relations can be processed using spatial data structures. We provide analytical formulas that describe the expected cost of retrieval and test the accuracy of the formulas through extensive experimentation. We also propose alternative methods aimed at the efficient processing of certain queries. The paper concludes by discussing the most suitable data structure for each type of query taking into account the properties of the data. © 1997 OPA (Overseas Publishers Association) Amsterdam B. V. Published under license in The Netherlands under the Gordon and Breach Science Publishers imprint.	en
heal.journalName	Geographical Systems	en
dc.identifier.volume	4	en
dc.identifier.issue	4	en
dc.identifier.spage	343	en
dc.identifier.epage	365	en