1007 search results - page 31 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
110
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
115
click to vote
ICCSA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The prima...
65
Voted
CCGRID
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific dataset...
113
Voted
TVLSI
2008
15 years 2 months ago
2008
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
143
click to vote
SIGMOD
2010
ACM
15 years 19 days ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...