高频传感器数据流的高效管理使用阅读优化学习指数
Hu Luo1, Jiabao Wen1, Desheng Chen1
1School of Electrical Automation and Information Engineering, Tianjin University, Tianjin 300072, China.
Sensors (Basel, Switzerland)
|February 27, 2026
概括
DyGLIN优化了物联网传感器数据的空间索引,大大降低了查询延迟并提高了更新吞吐量. 这种动态的学习指数可以提高高频数据流中的性能.
科学领域:
- 计算机科学 计算机科学
- 数据管理数据管理
- 数据库系统 数据库系统
背景情况:
- 物联网 (IoT) 和数字双胞胎产生大量的传感器数据,要求高效的空间索引.
- 传统的空间索引 (例如,R树) 具有较高的存储开销.
- 像GLIN这样的学习指数面临着"精细化瓶",原因是粗略的最小界限矩形 (MBR) 过,并与动态工作负载作斗争.
研究的目的:
- 为高频传感器流开发一个动态的,读取优化的学习空间索引.
- 解决现有的空间索引在处理动态物联网环境中的并发读写方面的局限性.
- 为了提高查询准确性和更新吞吐量.
主要方法:
- 拟议的DyGLIN (基于学习的动态生成索引) 具有脱的叶架构,用于单独处理查询和数据维护.
- 实施了使用等级MBR (HMBR) 和Cuckoo Filters进行攻击性的假阳性修剪的等级过管道.
- 利用Delta缓冲机制来摊销更新成本,并对高吞吐量进行逻辑删除.
主要成果:
- 与GLIN相比,DyGLIN减少了26.4%的查询延迟时间.
- 实现了比现有方法高出30.0%的插入吞吐量.
- 证明了优越的删除性能,仅增加了18.5%的内存开销.
结论:
- 在动态物联网环境中,DyGLIN为空间索引提供了显著的性能改善.
- 提出的架构和过机制有效地克服了以前学习索引的局限性.
- DyGLIN为高频传感器数据流提供了强大的解决方案,平衡了查询性能和更新效率.
相关概念视频
Upsampling
670
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
670
Column Efficiency: Rate Theory
1.1K
The rate theory of chromatography provides quantitative insight into the shapes and widths of elution bands. These bands are based on the random-walk mechanism governing molecular migration within a column. The Gaussian profile of chromatographic bands arises from the cumulative effect of random molecular motions as they progress through the column.
During elution, a solute molecule experiences numerous transitions between stationary and mobile phases, exhibiting irregular residence times in...
During elution, a solute molecule experiences numerous transitions between stationary and mobile phases, exhibiting irregular residence times in...
1.1K
Fast Fourier Transform
1.0K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.0K
Aliasing
717
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
717


