.png){kind=icon}
返回
Computation over APT compressed data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.is.2024.102504.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Arithmetic Progressions Tree (APT) is a data structure storing an encoding of a monotonic sequence G in [1 .. ] . Previous work on APTs focused on its theoretical and experimental compression guarantees. This paper is the first to consider computations over APT compressed data. In particular: 1. We show how to perform a search for any sub-sequence/a set of the monotone sequence G in time proportional to the query sub-sequence length/set size multiplied by the size of the APT compressed representation of G. 2. We show how, given the APT compressed representation of the monotone sequence G , we can find a minimum run-length of G inconstant time, a maximum run-length of G in (log ) time, and all runs of G in constant time plus the output size. 3. We show how, given the APT compressed representation of the monotone sequence G , we can answer whether a consecutive periodic pattern is represented by an APT-node in (log ) time and report occurrences of in G within the processing time of the output size. 4. In addition, we improve the APT construction algorithm time and space complexity.
Keyword:
Monotonic sequences
Arithmetic progression
Compact data structure
Periodic pattern
Inverted index
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
Connecting With Families to Improve Students’ School Attendance: A Review of the Literature与家庭建立联系以提高学生出勤率：文献综述
PREAI
分享收藏The Uses of Institutional Culture: Strengthening Identification and Building Brand Equity in Higher Education (review)《制度文化的应用：加强认同感与构建高等教育品牌资产》（评论）
PREAI
分享收藏Two Years of Case Management for At-Risk Students: Final Findings From the Communities In Schools Random Assignment Evaluation为有风险学生提供两年案例管理：来自Communities In Schools随机分配评估的最终发现.png)
IF0
PREAI
分享收藏 没有更多内容
没有更多内容