116 search results - page 12 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
127
Voted
PEPM
2010
ACM
16 years 9 days ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
184
Voted
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
166
Voted
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
213
click to vote
VLDB
2002
ACM
16 years 3 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
125
Voted
PVLDB
2008
15 years 2 months ago
2008
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...