Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Trade-offs in non-reversing diameter
Nordic Journal of Computing
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Key Revocation with Interval Cover Families
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
A 3-space partition and its applications
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bound for sparse Euclidean spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Range mode and range median queries on lists and trees
Nordic Journal of Computing
New constructions for provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 12th ACM symposium on Access control models and technologies
Weak ε-nets and interval chains
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Path Minima in Incremental Unrooted Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
New constructions for provably-secure time-bound hierarchical key assignment schemes
Theoretical Computer Science
Weak ε-nets and interval chains
Journal of the ACM (JACM)
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Efficient and secure distribution of massive geo-spatial data
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Balancing degree, diameter and weight in Euclidean spanners
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Practical and efficient cryptographic enforcement of interval-based access control policies
ACM Transactions on Information and System Security (TISSEC)
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Efficient provably-secure hierarchical key assignment schemes
Theoretical Computer Science
Path minima queries in dynamic weighted trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Time-storage trade-offs for cryptographically-enforced access control
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
An optimal-time construction of sparse Euclidean spanners with tiny diameter
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate range mode and range median queries
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Efficient provably-secure hierarchical key assignment schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Hi-index | 0.00 |
In this paper, we raise and investigate the question of (storage) space- (retrieval) time tradeoff for a static database, in the general framework of Fredman's. As will be seen, such tradeoff results also lead to lower bounds on the complexity of processing a sequence of m INSERT and QUERY instructions. The latter results are incomparable to Fredman's, since the presence of DELETE instructions was crucial for his proof technique. We will present our results in detail in the next few sections. Here we will only mention three main conclusions. Firstly, circular query is shown to be intrinsically hard in the sense that, for some static database with n records, there is a space-time tradeoff TS -&-gt; n1 + -&-egr; where -&-egr;-&-gt;0; in contrast, orthogonal query can always be implemented with space S-&-equil;0(n(log n)k) and time T-&-equil;0((log n)k) for fixed k. Furthermore, any algorithm for processing 0(n) INSERT and QUERY instructions must use time -&-Ohgr;(n1+-&-egr;) in the worst case. Secondly, for the -&-ldquo;interval-&-rdquo; query, we have determined the space-time tradeoff quite precisely to be T @@@@ -&-agr;(S,n), where -&-agr; is the inverse to an Ackermann's function first defined by Tarjan [9]. This is a rare case where the function -&-agr; arises outside the context of path compression, and is obtained through a totally independent derivation. Thirdly, we prove that, for the interval query, any algorithm to process a sequence of 0(n) INSERT and QUERY must take time -&-Ohgr;((n log n)/(log log n)) in the worst case. This means that one cannot hope to maintain the most efficient static data structure (with retrieval time -&-agr;(S,n)) in the dynamic case.