Derivations of Clustering Performance of Spatial Access Methods

Akhil Kumar and Waleed A. Muhanna

Corporate Finance & Organizations from Ohio State University

Abstract: This paper develops analytical expressions and algorithms for deriving the number of clusters that an average query of a given size and orientation retrieves using a given spatial access method. Besides being of theoretical interest, these algorithms run very fast and can be used by query schedulers and optimizers on the fly to determine best processing plans. Current techniques for determining the number of clusters are based on simulation, which is slow. Our algorithms are discussed in the context of the hilbert method for ease of exposition, but they do generalize in most cases to other space filling methods. Moreover, they apply for any given blocking factor. We prove that the proposed approach provides exact results for the case of blocking factor of 1, and empirically demonstrate that it yields near exact results for other blocking factors.

New Economics Papers: this item is included in nep-cmp, nep-geo and nep-ure
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.cob.ohio-state.edu/dept/acctmis/fac/muhanna/research/clustp2.ps (application/postscript)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www.cob.ohio-state.edu/dept/acctmis/fac/muhanna/research/clustp2.ps [301 Moved Permanently]--> https://www.cob.ohio-state.edu/dept/acctmis/fac/muhanna/research/clustp2.ps [301 Moved Permanently]--> https://fisher.osu.edu/dept/acctmis/fac/muhanna/research/clustp2.ps)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:ohstfi:_012

Access Statistics for this paper

More papers in Corporate Finance & Organizations from Ohio State University Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().