• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International conference on web-age information management >Efficient Algorithms for Constrained Subspace Skyline Query in Structured Peer-to-Peer Systems
【24h】

Efficient Algorithms for Constrained Subspace Skyline Query in Structured Peer-to-Peer Systems

机译：结构化P2P系统中约束子空间天际线查询的高效算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

To avoid complex P2P architectures, some previous research studies on skyline queries have converted multi-dimensional data into a single index. Their indexing, however, does not solve constrained sub-space queries efficiently. In this paper, we have devised algorithms and techniques to solve constrained subspace skyline queries efficiently in a structured peer-to-peer architecture using a single index. Dataspace is horizontally partitioned; and peers are given Z-order addresses. Each subspace query traverses peers using the subspace Z-order filling curve. Such partitioning and traversal approaches allow parallelism for incomparable data as well as the use of some techniques to reduce the data traveled in the network. The order of traversal also preserves progres-siveness. Our experiments, applied on Chord [1], have shown a reduction in the number of traversed peers and an efficient usage of bandwidth.
机译：为了避免复杂的P2P架构，一些先前关于天际线查询的研究已将多维数据转换为单个索引。但是，它们的索引不能有效地解决约束子空间查询。在本文中，我们设计了算法和技术来使用单个索引在结构化的对等体系结构中有效地解决约束子空间天际线查询。数据空间是水平分区的;和同级被赋予Z顺序地址。每个子空间查询都使用子空间Z阶填充曲线遍历对等对象。这种分区和遍历方法允许并行处理不可比拟的数据，并允许使用某些技术来减少在网络中传输的数据。遍历的顺序也保留了进步性。我们在Chord [1]上进行的实验表明，遍历对等体的数量减少了，带宽得到了有效利用。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号