现代计算机2024,Vol.30Issue(24) :166-169.DOI:10.3969/j.issn.1007-1423.2024.24.033

面向大规模数据集的SQLite数据快速查询算法研究

Research on fast query algorithm for SQLite data to large dcale fatasets

刘昶 李威 王德志
现代计算机2024,Vol.30Issue(24) :166-169.DOI:10.3969/j.issn.1007-1423.2024.24.033

面向大规模数据集的SQLite数据快速查询算法研究

Research on fast query algorithm for SQLite data to large dcale fatasets

刘昶 1李威 1王德志2
扫码查看

作者信息

  • 1. 华北科技学院矿山安全学院,廊坊 065201
  • 2. 华北科技学院计算机学院,廊坊 065201
  • 折叠

摘要

在使用SQLite数据库进行大量实时数据的存储时,随着数据量的不断增加,当单一表格数据量超过千万时,使用非主键字段进行查询,查询速度会非常慢,如何高效地进行数据库查询成为了一个重要课题.提出了一种在大规模数据集构成的SQLite数据库的快速查询算法,通过主键字段基于折半查找方法实现目标数据集定位快速查询.该方法首先通过将主键字段与特定非主键字段值进行关联,利用折半算法获取满足条件的特定非主键字段对应的主键字段,然后利用该主键字段进行数据检索.实验结果表明,该算法可显著提高数据查询效率.

Abstract

When using SQLite database for storing a large amount of real-time data,with the increasing amount of data,when the amount of data in a single table is more than ten million,the query speed will be very slow when querying by using non-primary key fields,and how to efficiently query the database has become an important topic.In this paper,we propose a fast query algorithm for SQLite database composed of large-scale datasets,which realizes the fast query for target dataset localization through the pri-mary key field based on the half-fold lookup method.The method first associates the primary key field with a specific non-primary key field value by using the halving algorithm to obtain the primary key field corresponding to a specific non-primary key field that satisfies the condition,and then utilizes this primary key field for data retrieval.The experimental results show that the algorithm can significantly improve the data query efficiency.

关键词

SQLite/折半查找/数据检索

Key words

SQLite/half search/data retrieval

引用本文复制引用

出版年

2024
现代计算机
中大控股

现代计算机

影响因子:0.292
ISSN:1007-1423
段落导航相关论文