DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search

Zeyu Wang, Qitong Wang, Peng Wang, Themis Palpanas, Wei Wang
{"title":"DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search","authors":"Zeyu Wang, Qitong Wang, Peng Wang, Themis Palpanas, Wei Wang","doi":"10.1007/s00778-024-00874-9","DOIUrl":null,"url":null,"abstract":"<p>Data series indexes are necessary for managing and analyzing the increasing amounts of data series collections that are nowadays available. These indexes support both exact and approximate similarity search, with approximate search providing high-quality results within milliseconds, which makes it very attractive for certain modern applications. Reducing the pre-processing (i.e., index building) time and improving the accuracy of search results are two major challenges. DSTree and the iSAX index family are state-of-the-art solutions for this problem. However, DSTree suffers from long index building times, while iSAX suffers from low search accuracy. In this paper, we identify two problems of the iSAX index family that adversely affect the overall performance. First, we observe the presence of a <i>proximity-compactness trade-off</i> related to the index structure design (i.e., the node fanout degree), significantly limiting the efficiency and accuracy of the resulting index. Second, a skewed data distribution will negatively affect the performance of iSAX. To overcome these problems, we propose Dumpy, an index that employs a novel multi-ary data structure with an adaptive node splitting algorithm and an efficient building workflow. Furthermore, we devise Dumpy-Fuzzy as a variant of Dumpy which further improves search accuracy by proper duplication of series. To fully leverage the potential of modern hardware including multicore CPUs and Solid State Drives (SSDs), we parallelize Dumpy to DumpyOS with sophisticated indexing and pruning-based querying algorithms. An optimized approximate search algorithm, DumpyOS-F that prominently improves the search accuracy without violating the index, is also proposed. Experiments with a variety of large, real datasets demonstrate that the Dumpy solutions achieve considerably better efficiency, scalability and search accuracy than its competitors. DumpyOS further improves on Dumpy, by delivering several times faster index building and querying, and DumpyOS-F improves the search accuracy of Dumpy-Fuzzy without the additional space cost of Dumpy-Fuzzy. This paper is an extension of the previously published SIGMOD paper [81].</p>","PeriodicalId":501532,"journal":{"name":"The VLDB Journal","volume":"3 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The VLDB Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00778-024-00874-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data series indexes are necessary for managing and analyzing the increasing amounts of data series collections that are nowadays available. These indexes support both exact and approximate similarity search, with approximate search providing high-quality results within milliseconds, which makes it very attractive for certain modern applications. Reducing the pre-processing (i.e., index building) time and improving the accuracy of search results are two major challenges. DSTree and the iSAX index family are state-of-the-art solutions for this problem. However, DSTree suffers from long index building times, while iSAX suffers from low search accuracy. In this paper, we identify two problems of the iSAX index family that adversely affect the overall performance. First, we observe the presence of a proximity-compactness trade-off related to the index structure design (i.e., the node fanout degree), significantly limiting the efficiency and accuracy of the resulting index. Second, a skewed data distribution will negatively affect the performance of iSAX. To overcome these problems, we propose Dumpy, an index that employs a novel multi-ary data structure with an adaptive node splitting algorithm and an efficient building workflow. Furthermore, we devise Dumpy-Fuzzy as a variant of Dumpy which further improves search accuracy by proper duplication of series. To fully leverage the potential of modern hardware including multicore CPUs and Solid State Drives (SSDs), we parallelize Dumpy to DumpyOS with sophisticated indexing and pruning-based querying algorithms. An optimized approximate search algorithm, DumpyOS-F that prominently improves the search accuracy without violating the index, is also proposed. Experiments with a variety of large, real datasets demonstrate that the Dumpy solutions achieve considerably better efficiency, scalability and search accuracy than its competitors. DumpyOS further improves on Dumpy, by delivering several times faster index building and querying, and DumpyOS-F improves the search accuracy of Dumpy-Fuzzy without the additional space cost of Dumpy-Fuzzy. This paper is an extension of the previously published SIGMOD paper [81].

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DumpyOS:用于可扩展数据序列相似性搜索的数据自适应多ary索引
数据序列索引是管理和分析当今日益增多的数据序列集合所必需的。这些索引支持精确和近似相似性搜索,其中近似搜索可在几毫秒内提供高质量结果,因此对某些现代应用非常有吸引力。减少预处理(即建立索引)时间和提高搜索结果的准确性是两大挑战。DSTree 和 iSAX 索引系列是解决这一问题的最先进解决方案。然而,DSTree 的索引构建时间较长,而 iSAX 的搜索准确率较低。在本文中,我们发现 iSAX 索引系列存在两个对整体性能有不利影响的问题。首先,我们发现在索引结构设计(即节点扇出程度)方面存在邻近性与紧凑性的权衡,这大大限制了所生成索引的效率和准确性。其次,倾斜的数据分布会对 iSAX 的性能产生负面影响。为了克服这些问题,我们提出了 Dumpy 索引,它采用了新颖的多ary 数据结构、自适应节点分割算法和高效的构建工作流程。此外,我们还设计了 Dumpy-Fuzzy 作为 Dumpy 的变体,通过适当的序列复制进一步提高搜索精度。为了充分利用现代硬件(包括多核 CPU 和固态硬盘 (SSD))的潜力,我们将 Dumpy 并行化为 DumpyOS,并采用复杂的索引和基于剪枝的查询算法。我们还提出了一种优化的近似搜索算法 DumpyOS-F,它能在不违反索引的情况下显著提高搜索精度。使用各种大型真实数据集进行的实验表明,Dumpy 解决方案在效率、可扩展性和搜索准确性方面都大大优于竞争对手。DumpyOS 在 Dumpy 的基础上做了进一步改进,索引建立和查询速度提高了数倍,DumpyOS-F 提高了 Dumpy-Fuzzy 的搜索精度,但没有 Dumpy-Fuzzy 的额外空间成本。本文是对之前发表的 SIGMOD 论文[81]的扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A versatile framework for attributed network clustering via K-nearest neighbor augmentation Discovering critical vertices for reinforcement of large-scale bipartite networks DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search Enabling space-time efficient range queries with REncoder AutoCTS++: zero-shot joint neural architecture and hyperparameter search for correlated time series forecasting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1