Selectivity estimation is crucial for query optimizers choosing an optimal spatial execution plan in a spatial database management system.This paper presents an Annular Bucket spatial histogram(AB histogram)that can e...Selectivity estimation is crucial for query optimizers choosing an optimal spatial execution plan in a spatial database management system.This paper presents an Annular Bucket spatial histogram(AB histogram)that can estimate the selectivity in finer spatial selection and spatial join operations even when the spatial query has more operators or more joins.The AB histogram is represented as a set of bucket-range,bucket-count value pairs.The bucket-range often covers an annular region like a sin-gle-cell-sized photo frame.The bucket-count is the number of objects whose Minimum Bounding Rectangles(MBRs)fall between outer rectangle and inner rectangle of the bucket-range.Assuming that all MBRs in each a bucket distribute evenly,for every buck-et,we can obtain serial probabilities that satisfy a certain spatial selection or join conditions from the operations' semantics and the spatial relations between every bucket-range and query ranges.Thus,according to some probability theories,spatial selection or join selectivity can be estimated by the every bucket-count and its probabilities.This paper also shows a way to generate an updated AB histogram from an original AB histogram and those probabilities.Our tests show that the AB histogram not only supports the selectivity estimation of spatial selection or spatial join with "disjoint","intersect","within","contains",and "overlap" operators but also provides an approach to generate a reliable updated histogram whose spatial distribution is close to the distribution of ac-tual query result.展开更多
对基于R-Tree的空间连接代价模型进行了探讨,主要研究了HUANG Y W提出的空间连接代价模型。利用最优/最差选择策略降低该算法的时间复杂度,对基于缓冲区的代价模型提出了改进后的评估公式,通过实验验证了改进后的模型比原模型提高了评...对基于R-Tree的空间连接代价模型进行了探讨,主要研究了HUANG Y W提出的空间连接代价模型。利用最优/最差选择策略降低该算法的时间复杂度,对基于缓冲区的代价模型提出了改进后的评估公式,通过实验验证了改进后的模型比原模型提高了评估的精确度。展开更多
基金Supported by the Innovation Project of IGSNRR (No. O9V90220ZZ)the Research Plan of LREIS (O88RA700KA),CAS
文摘Selectivity estimation is crucial for query optimizers choosing an optimal spatial execution plan in a spatial database management system.This paper presents an Annular Bucket spatial histogram(AB histogram)that can estimate the selectivity in finer spatial selection and spatial join operations even when the spatial query has more operators or more joins.The AB histogram is represented as a set of bucket-range,bucket-count value pairs.The bucket-range often covers an annular region like a sin-gle-cell-sized photo frame.The bucket-count is the number of objects whose Minimum Bounding Rectangles(MBRs)fall between outer rectangle and inner rectangle of the bucket-range.Assuming that all MBRs in each a bucket distribute evenly,for every buck-et,we can obtain serial probabilities that satisfy a certain spatial selection or join conditions from the operations' semantics and the spatial relations between every bucket-range and query ranges.Thus,according to some probability theories,spatial selection or join selectivity can be estimated by the every bucket-count and its probabilities.This paper also shows a way to generate an updated AB histogram from an original AB histogram and those probabilities.Our tests show that the AB histogram not only supports the selectivity estimation of spatial selection or spatial join with "disjoint","intersect","within","contains",and "overlap" operators but also provides an approach to generate a reliable updated histogram whose spatial distribution is close to the distribution of ac-tual query result.
文摘近年来,许多实际应用不仅需要支持空间连接查询而且需要具备关键词搜索功能,以帮助用户查找那些既满足空间连接条件又包含指定关键词的空间对象组合。正是在这种需求的驱动之下,定义了一种具备关键词搜索功能的空间连接查询(Spatial Join with Keyword Search,缩写SJKS),并提出了一种基于IR2-Tree的SJKS查询处理算法(IR2-TreeSJKS算法),旨在实现关键词搜索与空间连接查询的高效结合。实验表明,本算法可有效支持具有关键词搜索功能的空间连接查询处理。
