589 search results - page 75 / 118 » Optimized Query Evaluation Using Cooperative Sorts |
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
IJHCR
2010
14 years 7 months ago
2010
This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), which is a dynamic replication scheme for improving the typically low data avail...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
HIPEAC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...