Abstract
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S. counties, population versus area of different nations, etc.) we provide evidence that real data indeed are skewed, and, moreover, we show that for several scales of interest they behave as mathematical fractals with a measurable noninteger fractal dimension. Armed with this tool, we then show its practical use in predicting the performance of spatial access methods and, specifically, of R-trees. We provide thefirstanalysis of R-trees for skewed distributions of points; we develop a formula that estimates the number of disk accesses for range queries, given only the fractal dimension of the point set and its count. Experiments on real data sets show that the formula is very accurate; the relative error is usually below 5%, and it rarely exceeds 10%. We believe that the fractal dimension will help replace the uniformity and independence assumptions, allowing more accurate analysis foranyspatial access method, as well as better estimates for query optimization on multiattribute queries.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
