Sciweavers

2229 search results - page 392 / 446
» The Case for Grounding Databases
Sort
View
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 1 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
PODS
2002
ACM
168views Database» more  PODS 2002»
16 years 1 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 1 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
PODS
2007
ACM
122views Database» more  PODS 2007»
16 years 1 months ago
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
The contingency table is a work horse of official statistics, the format of reported data for the US Census, Bureau of Labor Statistics, and the Internal Revenue Service. In many ...
Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Sat...
PODS
2008
ACM
221views Database» more  PODS 2008»
16 years 1 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...