The proposed STEM 2 is a fast and space-efficient data structure that achieves 100% query accuracy and can support dynamic key updates for multi-set membership queries, and is a minimized hashing scheme that requires only two hash computations per key lookup.
A novel architecture called S !"#$, designed to enhance the performance of hash indexes in disaggregated memory, is introduced and the results show that S !"#$ outperforms state-of-the-art DM-optimized hash indexes by at most 6.7 → (RACE), 3.6 → (SepHash), and 1.8 → (Outback) in YCSB workloads, respectively.
Han-Tian Zha, Teng Ma, Bao-Tong Lu et al.· 0 citations
The Consensus technique marked a breakthrough in the construction of minimal perfect hash functions (MPHFs), reaching a linear tradeoff between construction time and space overhead relative to the optimum. Consensus provides a clever scheme to search for and encode seeds of tasks in random data structures. We apply Con...
Shortest path queries are a fundamental operation on graphs with numerous applications. Efficiently executing shortest path searches in RDBMS is challenging, as graphs can not only be static relations but might also occur as ad-hoc intermediate results of complex analytical queries. Especially single-pair shortest path...
Maximilian Reif, Thomas Neumann· Proceedings of the VLDB Endo...· 0 citations
Range filters are compact probabilistic data structures that answer approximate range emptiness queries. They are used in many domains, e.g., in key-value stores, to quickly rule out the existence of keys in a given query range and avoid searching for them in storage. However, all existing range filters exhibit at leas...
Serving stacks for large language models manage context through four recurring mechanisms: incremental edits to a growing context, branching and snapshotting for tree search, identification of reusable prefixes for KV-cache reuse, and encoding of repeated segments. Each mechanism is served today by a different speciali...
Muntaser M Syed, Ameerah Alsulami, Marius Silaghi· 0 citations
We present a novel subspace segment tree data structure designed for online aggregation queries on streaming data, addressing the challenge of efficient query processing under limited storage space in embedded systems. Traditional segment tree structures require several times the storage space of the original data,...
Jia-Xuan Su, Xia-Oou Ding, Hai Qin et al.· Tsinghua Science and Technol...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
