We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registeri...
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, ...