Results 231 to 240 of about 24,693 (267)
ACM Transactions on Database Systems, 2020 We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries: open-range queries, closed-range queries, and range counts.
Viktor Leis +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algorithmica, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diego Arroyuelo, Rajeev Raman
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diego Arroyuelo, Rajeev Raman
openaire +2 more sources
Succinct Representations of Functions
2004We investigate the problem of succinctly representing an arbitrary function, f: [n] →[n] so that f k (i) can be computed quickly for any i and any (positive or negative) integer power k. We give a representation that takes \((1+\epsilon) n \lg n + O(1)\) bits and computes arbitrary positive powers in constant time. It can also be used to compute f k (i)
J. Ian Munro, S. Srinivasa Rao 0001
openaire +1 more source
Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08, 2008
We describe the engineering of Succinct DOM (SDOM), a DOM implementation, written in C++, which is suitable for in-memory representation of large static XML documents. SDOM avoids the use of pointers, and is based upon succinct data structures, which use an information-theoretically minimum amount of space to represent an object.SDOM gives a space ...
O'Neil Delpratt +2 more
openaire +1 more source
We describe the engineering of Succinct DOM (SDOM), a DOM implementation, written in C++, which is suitable for in-memory representation of large static XML documents. SDOM avoids the use of pointers, and is based upon succinct data structures, which use an information-theoretically minimum amount of space to represent an object.SDOM gives a space ...
O'Neil Delpratt +2 more
openaire +1 more source
ACM SIGMOD Record, 2019
We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the point and range query performance of state-of-the ...
Huanchen Zhang +5 more
openaire +1 more source
We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the point and range query performance of state-of-the ...
Huanchen Zhang +5 more
openaire +1 more source
On the Size of Succinct Indices
2007A succinct data structure occupies an amount of space that is close to the information-theoretic minimum plus an additional term. The latter is not necessarily a lower-order term and, in several cases, completely dominates the space occupancy both in theory and in practice. In this paper, we present several solutions to partially overcome this problem,
GOLYNSKI A +4 more
openaire +2 more sources
Succinct Representations of Trees
2009Trees are by far the most common data structures to represent/organize/search large amount of data. Part of the trees' success is probably due to the simplicity of the usual pointer-based implementation in which to move from parent to child we simply follow a pointer. Unfortunately, a simple counting argument shows that the pointer-based implementation
openaire +3 more sources
The Complexity of Succinct Elections
Proceedings of the AAAI Conference on Artificial Intelligence, 2017The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the preferences of the electorate succinctly, as the distinct votes and their counts. Though the succinct representation may be exponentially smaller
Zack Fitzsimmons, Edith Hemaspaandra
openaire +2 more sources
The succinctness of the cover modality
Journal of Applied Non-Classical Logics, 2015We prove that modal logic formulated in a language with the cover modality is exponentially more succinct than the usual box-and-diamond version. In contrast with this, we show that adding the so-called public announcement operator to the latter results in a modal system that is exponentially more succinct than the one based on the cover modality.
H. van Ditmarsch, P. Iliev
openaire +2 more sources
Succinct Representations of Permutations
2003We investigate the problem of succinctly representing an arbitrary permutation, π, on {0, ..., n - 1} so that πk(i) can be computed quickly for any i and any (positive or negative integer) power k. A representation taking (1 + Ɛ)n lg n + O(1) bits suffices to compute arbitrary powers in constant time.
J. Ian Munro +3 more
openaire +1 more source