6004 search results - page 286 / 1201 » Parallelizing query optimization |
127
Voted
ICPP
1998
IEEE
15 years 4 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
187
click to vote
ACPC
1999
Springer
15 years 5 months ago
1999
Springer
In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. Its main goal is to provide pa...
116
click to vote
ESCIENCE
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
218
click to vote
GIS
2006
ACM
16 years 1 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
196
click to vote
VLDB
2002
ACM
16 years 27 days ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...