Efficient cost models for spatial queries using R-trees

Theodoridis, Y; Stefanakis, E; Sellis, T

dc.contributor.author	Theodoridis, Y	en
dc.contributor.author	Stefanakis, E	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T01:15:34Z
dc.date.available	2014-03-01T01:15:34Z
dc.date.issued	2000	en
dc.identifier.issn	1041-4347	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13603
dc.subject	spatial databases	en
dc.subject	access methods	en
dc.subject	query optimization	en
dc.subject	cost models	en
dc.subject	R-trees	en
dc.subject.classification	Computer Science, Artificial Intelligence	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.title	Efficient cost models for spatial queries using R-trees	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/69.842247	en
heal.identifier.secondary	http://dx.doi.org/10.1109/69.842247	en
heal.language	English	en
heal.publicationDate	2000	en
heal.abstract	Selection and join queries are fundamental operations in Data Base Management Systems (DBMS). Support for nontraditional data, including spatial objects, in an efficient manner is of ongoing interest in database research. Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization. In this paper, we present analytical models that estimate the cost (in terms of node and disk accesses) of selection and join queries using R-tree-based structures. The proposed formulae need no knowledge of the underlying R-tree structure(s) and are applicable to uniform-like and nonuniform data distributions. In addition, experimental results are presented which show the accuracy of the analytical estimations when compared to actual runs on both synthetic and real data sets.	en
heal.publisher	IEEE COMPUTER SOC	en
heal.journalName	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING	en
dc.identifier.doi	10.1109/69.842247	en
dc.identifier.isi	ISI:000086814800003	en
dc.identifier.volume	12	en
dc.identifier.issue	1	en
dc.identifier.spage	19	en
dc.identifier.epage	32	en