Space-Time Tradeoffs for Graph Properties (1998) [5 citations — 0 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Dodis98space-timetradeoffs,author = {Yevgeniy Dodis and Sanjeev Khanna},
title = {Space-Time Tradeoffs for Graph Properties},
booktitle = {In Proceedings of 26th ICALP},
year = {1998},
pages = {200--217},
publisher = {Springer}
}
Years of Citing Articles
Abstract:
We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. In this setup, we are given: (a) a function f(y; q) where y is the static input and q is a dynamic query, (b) a function family F for preprocessing, and (c) a parameter s indicating the amount of preprocessing space. The goal is to preprocess the static input y to create a data structure D so that the dynamic queries q can be quickly answered. The data structure D contains s bits of information about y and each bit corresponds to a function in F applied to y. The "time " t to answer a query is measured in terms of the number of bits read from D. Intuitively, this models the situation where the data access is slow/expensive and the local computation is fast/cheap. We study the dependence between the space s and the time t for a given f when preprocessing is done using only functions in F. Classically, space-time tradeoffs have been studied in this model under the assumption that family F is an unrestricted function family. In this setting, a large gap exists between the expected and provable lower bounds. Augmenting the model with parameter F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tighter space-time tradeoffs for various natural settings of F. Our model also unifies many fundamental questions previously studied
