215 citations
- Microsoft (United States)US16 papers
- University of CambridgeGB7 papers
- Massachusetts Institute of TechnologyUS5 papers
- Tel Aviv UniversityIL5 papers
- Johns Hopkins UniversityUS4 papers
- Microsoft Research New England (United States)US4 papers
- University of California, BerkeleyUS4 papers
- University of ChicagoUS4 papers
- University of WashingtonUS4 papers
- Stanford UniversityUS3 papers
- Technion – Israel Institute of TechnologyIL3 papers
- University of British ColumbiaCA3 papers
6 papers · 1 filter
Consistent Streaming Through Time: A Vision for Event Stream Processing
Roger S. Barga, Jonathan Goldstein, Mohamed Ali +1
Event processing will play an increasingly important role in constructing enterprise applications that can immediately react to business critical events. Various technologies have…
Managing Query Compilation Memory Consumption to Improve DBMS Throughput
Boris Baryshnikov, Cipri Clinciu, Conor Cunningham +3
While there are known performance trade-offs between database page buffer pool and query execution memory allocation policies, little has been written on the impact of query compil…
Fragmentation in Large Object Repositories
Russell Sears, Catharine van Ingen
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines ne…
A rigorous proof of the cavity method for counting matchings
Mohsen Bayati, Chandra Nair
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he…
On entropy for mixtures of discrete and continuous variables
Chandra Nair, Balaji Prabhakar, Devavrat Shah
Let be a discrete random variable with support and be a bijection. Then it is well-known that the entropy of is the same as the entropy of .…
Random 3CNF formulas elude the Lovasz theta function
Uriel Feige, Eran Ofek
Let be a 3CNF formula with n variables and m clauses. A simple nonconstructive argument shows that when m is sufficiently large compared to n, most 3CNF formulas are not satisf…