1007 search results - page 55 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
163
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
112
Voted
GIS
2007
ACM
15 years 6 months ago
2007
ACM
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
130
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
137
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
131
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Models of simulation program with integrated circuit emphasis (SPICE) are currently playing a central role in the connection between circuit design and chip fabrication communitie...