67 search results - page 8 / 14 » Computing Join Aggregates over Private Tables |
75
Voted
AINA
2007
IEEE
15 years 4 months ago
2007
IEEE
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
108
Voted
SSDBM
2009
IEEE
15 years 5 months ago
2009
IEEE
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
84
Voted
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
101
Voted
PVLDB
2008
14 years 9 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
76
Voted
PPOPP
2010
ACM
15 years 1 days ago
2010
ACM
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...