【24h】

Approximation techniques for spatial data

机译:空间数据的近似技术

获取原文

摘要

Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high query processing costs. Accurate selectivity estimation during query optimization therefore is crucially important for finding good query plans, especially when spatial joins are involved. Selectivity estimation has been studied for relational database systems, but to date has only received little attention in SDBMS. In this paper, we introduce novel methods that permit high-quality selectivity estimation for spatial joins and range queries. Our techniques can be constructed in a single scan over the input, handle inserts and deletes to the database incrementally, and hence they can also be used for processing of streaming spatial data. In contrast to previous approaches, our techniques return approximate results that come with provable probabilistic quality guarantees. We present a detailed analysis and experimentally demonstrate the efficacy of the proposed techniques.
机译:管理诸如点,线和超矩形之类的空间对象的空间数据库管理系统(SDBMS),例如地理信息系统,通常具有非常高的查询处理成本。因此,在查询优化过程中进行准确的选择性估计对于找到良好的查询计划至关重要,尤其是在涉及空间联接时。对于关系数据库系统,已经研究了选择性估计,但是迄今为止,在SDBMS中只受到很少的关注。在本文中,我们介绍了允许对空间连接和范围查询进行高质量选择性估计的新颖方法。我们的技术可以通过对输入的单次扫描来构造,以增量方式处理对数据库的插入和删除,因此它们也可以用于处理空间数据流。与以前的方法相比,我们的技术返回的近似结果带有可证明的概率质量保证。我们提出了详细的分析,并通过实验证明了所提出技术的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号