关系型大数据查询的层次结构  

Hierarchy of queries on relational big data

作　　者：胡天伟 余靖[2] 刘国华[1] 陈德华[1] HU Tianwei;YU Jing;LIU Guohua;CHEN Dehua(College of Computer Science and Technology,Donghua University,Shanghai 201620,China;School of Information Science and Engineering,Yanshan University,Qinhuangdao Hebei 066004,China)

机构地区：[1]东华大学计算机科学与技术学院,上海201620 [2]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《智能计算机与应用》2023年第12期56-61,共6页Intelligent Computer and Applications

基　　金：国家自然科学基金(61872311)。

摘　　要：数据查询是获取信息的重要手段,大数据的特征从不同维度上给经典的数据查询理论和方法带来了新的挑战,如何最大限度地获取信息是大数据应用亟待解决的问题。在大数据规模庞大、时效性强、类型多样化、准确性弱等特征中,规模庞大最为突出,围绕该特征的大数据查询解答问题是目前的研究热点。本文针对数据规模庞大这一特征,以关系型数据为对象,描述了由数据库向大数据转化的演变历程,并根据大数据的特征将大数据分成八类,给出了大数据的形式化定义,以关系型大数据库为例,讨论了查询的层次结构,并将查询分类为:一阶查询、存在性查询及不动点查询。针对不同的查询,讨论了其预处理方法并进行实验。Data query is an important means of obtaining information.The characteristics of big data have brought new challenges to the classic data query theory and methods from different dimensions.How to obtain information to the maximum extent is an urgent problem to be solved in big data applications.Among the characteristics of big data,such as large scale,strong timeliness,diverse types,and weak accuracy,large scale is the most prominent feature,and the query and answering of big data around this feature is a current research hotspot.Aiming at the characteristics of huge data scales,this paper describes the evolution process from database to big data with relational data as the object,divides big data into eight categories according to the characteristics of big data,and gives a formal definition of big data.Taking the relational large database as an example,the hierarchy of the query is discussed,and the query is classified into first-order query,existence query,and fixed point query.For different queries,the preprocessing methods are discussed and experiments are carried out.

关 键 词：关系型数据 大数据 查询 不动点查询层次 预处理 

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