Optimizing Skyline Queries in SPA Distributed Networks

HUANG Zhen-hua; XIANG Yang; SUN Sheng-li; CHEN Qian

doi:10.3969/j.issn.0372-2112.2013.08.010

您当前的位置：

首页 >

文章列表页 >

Optimizing Skyline Queries in SPA Distributed Networks

更新时间：2025-07-16

- Optimizing Skyline Queries in SPA Distributed Networks
- Acta Electronica Sinica Vol. 41, Issue 8, Pages: 1515-1520(2013)
- 作者机构：
  
  1. 同济大学计算机科学与工程系,上海,201804
  2. 同济大学嵌入式系统与服务计算教育部重点实验室,上海,201804
  3. 北京大学软件与微电子学院,北京,102600
  4. 同济大学计算机科学与工程系,上海,201804
  5. 同济大学嵌入式系统与服务计算教育部重点实验室,上海,201804
  6. 北京大学软件与微电子学院,北京,102600
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2013.08.010
  CLC： TP311.13
- Published：2013
- 稿件说明：
移动端阅览
HUANG Zhen-hua, XIANG Yang, SUN Sheng-li, et al. Optimizing Skyline Queries in SPA Distributed Networks[J]. Acta Electronica Sinica, 2013, 41(8): 1515-1520.
DOI：

HUANG Zhen-hua, XIANG Yang, SUN Sheng-li, et al. Optimizing Skyline Queries in SPA Distributed Networks[J]. Acta Electronica Sinica, 2013, 41(8): 1515-1520. DOI： 10.3969/j.issn.0372-2112.2013.08.010.

摘要

轮廓查询是近年来信息服务领域的一个研究重点和热点.现有的三阶段算法TPAOSS (Three-Phase Algorithm for Optimizing Skyline Scalar)至少存在如下两个缺陷:(1)在TPAOSS算法的第3阶段中

当网络节点上的对象个数较多时

Bloom filter的长度将呈指数级增长

从而严重影响获取子空间重复值的效率以及占用内存空间的大小;(2)TPAOSS算法只考虑预处理阶段的时间代价

而没有考虑各网络节点进行局部或全局子空间轮廓查询计算的效率.为此

提出一种适合超对等网络(Super-Peer Architecture

SPA)的子空间轮廓查询方法EPSSQDN (Efficient Processing of Subspace Skyline Queries in Distributed Networks).EPSSQDN算法有效解决了TPAOSS算法的的两个主要性能问题

并且显著提高了SPA网络中的子空间轮廓查询处理的效率.此外

为了能够进一步降低子空间上轮廓查询的时间开销以及网络节点间的数据传输量

我们给出新颖且有效的优化策略.实验结果表明

EPSSQDN算法比TPAOSS算法更能够缩短SPA网络中子空间轮廓查询的时间开销.

Abstract

Skyline query has recently received a lot of attention in information service community.The TPAOSS (Three-Phase Algorithm for Optimizing Skyline Scalar) algorithm has two performance drawbacks:(1) in the third phase of TPAOSS

as the number of objects on net nodes increases

the length of bloom filter will increases exponentially

which will seriously influence the efficiency of obtaining replicated values and the occupation size of memory;(2) the TPAOSS algorithm does not consider the computation efficiency of local or global subspace skyline queries in each net node.Motivated by these facts

we propose EPSSQDN (Efficient Processing of Subspace Skyline Queries in Distributed Networks)

an algorithm for efficient processing of subspace skyline queries in SPA distributed networks.Moreover

in order to further reduce the computation cost of subspace skyline queries and decrease the volume of data transferred

we present an efficient optimized techniques.Furthermore

we present extensive experiments that demonstrate our method is more advantageous than the TPAOSS algorithm.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Join Optimizer Based on Asynchronous Dueling DQN and Plan Latency Prediction Network

Parsing Skyline Queries

A New Optimization Algorithm for Queries with Expensive Selections

Cardinality Estimation in Query for Probability RDF Graphs

Related Author

QIAO Shao-jie

HAN Nan

MIN Sheng-jie

LI He

QIN Xiao

ZHANG Tao

YUAN Chang-an

GAO Rui-wei

Related Institution

School of Management， Chengdu University of Information Technology

CEC Zhiyuan Data Technology Co.， Ltd.

School of Computer Science and Technology， Xidian University

Nanning Normal University

Yibin University

⁰