Range queries involving spatial relations: A performance analysis

Theodoridis, Y; Papadias, D

dc.contributor.author	Theodoridis, Y	en
dc.contributor.author	Papadias, D	en
dc.date.accessioned	2014-03-01T01:11:27Z
dc.date.available	2014-03-01T01:11:27Z
dc.date.issued	1995	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11644
dc.subject	spatial relations	en
dc.subject	performance analysis	en
dc.subject	query optimisation	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Range queries involving spatial relations: A performance analysis	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-60392-1_35	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-60392-1_35	en
heal.language	English	en
heal.publicationDate	1995	en
heal.abstract	Spatial relations are becoming an important aspect of spatial access methods because of the increasing interest on qualitative spatial information processing. In this paper we show how queries involving spatial relations can be transformed to range queries and implemented in existing DBMSs. We provide a performance analysis of B- and R- tree indexing methods to support such queries and we evaluate the analytical formulas using experimental results. The proposed analytical models for the expected retrieval cost of spatial relations are proved to be good guidelines for a spatial query optimiser.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	SPATIAL INFORMATION THEORY	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-60392-1_35	en
dc.identifier.isi	ISI:A1995BF24Q00035	en
dc.identifier.volume	988	en
dc.identifier.spage	537	en
dc.identifier.epage	551	en