TALI: An Update-Distribution-Aware Learned Index for Social Media Data

Author:

Guo Na,Wang Yaqi,Jiang Haonan,Xia Xiufeng,Gu Yu

Abstract

In the growing mass of social media data, how to efficiently extract the collection of interested concerns has become a research hotspot. Due to the large size and regularity of social media data, traditional indexing techniques are not applicable. Our “Learned Index”, which is a part of social media intelligence solutions, uses mathematical principles to summarize the laws from the data. It predicts the location of the data by learning the mathematical properties of the data distribution to build the model. Although existing methods over single dimension and multi-dimension such as setting gaps are proposed to further optimize the performance of index, they do not consider the update-distribution of data. In this paper, we propose an update-distribution-aware learned index for social media data (TALI) to support update operations and handle the data sliding. In TALI, underlying data are learned through machine learning models, and a recursive hierarchical model is built. It also learns the update-distribution of data to adjust the size of each leaf node. Thus, it can more effectively support all kinds of operations in databases due to the decrease of the leaf nodes’ sliding. In addition, TALI uses the model-based insertion method for bulkload and query, resulting in a small prediction error. Thus, exponential search is used to perform secondary lookup to improve query efficiency. Experiments were tested and compared on four realistic and synthetic social media datasets. Through extensive experiments, TALI performed better than the existing state-of-the-art learned index with less space occupancy on four realistic and synthetic social media datasets.

Funder

National Key Research and Development Program of China

Fundamental Research Funds of the Central Universities

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference28 articles.

1. k-clique Community Detection in Social Networks based on Formal Concept Analysis;Hao;IEEE Syst. J.,2017

2. Dynamic Maximal Cliques Detection and Evolution Management in Social Internet of Things: A Formal Concept Analysis Approach;Yang;IEEE Trans. Netw. Sci. Eng.,2021

3. Incremental Construction of Three-way Concept Lattice for Knowledge Discovery in Social Networks;Fei;Inf. Sci.,2021

4. SPIDER: A Social Computing Inspired Predictive Routing Scheme for Softwarized Vehicular Networks;Zhao;IEEE Trans. Intell. Transp. Syst. (T-ITS),2021

5. (2022, July 22). The Case for b-Tree Index Structures, 2018. Available online: http://databasearchitects.blogspot.com/2017/12/the-case-for-b-tree-index-structures.html.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Chameleon: Towards Update-Efficient Learned Indexing for Locally Skewed Data;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Robust Benchmark for Propagandist Text Detection and Mining High-Quality Data;Mathematics;2023-06-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3