Skiptree:面向多维数据的可扩性范围查询的数据结构  

SkipTree:A Scalable Range-Queryable Data Structure for Multidimensional Data

作　　者：叶培顺[1] 史旭宁 YE Pei-shun;SHI Xu-ning(School of Information Engineering, Yulin University,Yulin 719000, China;School of Continuing Education, Tongchuan Vocational and Technical College, Tongchuan 727031, China)

机构地区：[1]榆林学院信息工程学院,陕西榆林719000 [2]铜川职业技术学院继续教育学院,陕西铜川727031

出　　处：《榆林学院学报》2020年第4期68-70,共3页Journal of Yulin University

基　　金：榆林市科技局产学研计划项目(2016CXY-04-03)。

摘　　要：本文提出并研究了对等网络中为储存多维关键值数据的一种新的平衡分布式数据结构:Skiptree系统。提出Skiptree在分布式环境下处理多维空间的单点查询和范围查询方法,论述了Skiptree系统在每个节点上维护O(logn)个链接的基本方法。论文主要工作是提出并详细论述和证实了Skiptree系统中单点查询与范围查询的基本处理算法,同时给出了Skiptree系统中节点加入和离开的方法。This paper proposes and studies a new balanced distributed data structure for storing multi-dimensional key value data in peer-to-peer networks,skiptree system.In this paper,a method of single point query and range query in multi-dimensional space is proposed,and the basic method of maintaining o(log n)links in each node is discussed.The main work of this paper is to propose and prove the basic processing algorithm of single point query and range query in the skiptree system in detail,and to give the method of adding and leaving nodes in the skiptree system.

关 键 词：对等网络 分割树 范围查询 多维关键值数据 平衡分布式数据结构 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]