Sciweavers

8437 search results - page 1378 / 1688
» Preferences over Sets
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
VLDB
2007
ACM
187views Database» more  VLDB 2007»
16 years 7 months ago
Secure Data Outsourcing
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...
Radu Sion
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 7 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 6 months ago
Synthesizing structured text from logical database subsets
In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, h...
Alkis Simitsis, Georgia Koutrika, Yannis Alexandra...
ICFP
2006
ACM
16 years 6 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
« Prev « First page 1378 / 1688 Last » Next »