621 search results - page 61 / 125 » Efficient algorithms for minimizing tree pattern queries |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
BNCOD
2004
13 years 9 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
VLDB
1994
ACM
14 years 1 days ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
EUROPAR
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
DMDW
2000
13 years 9 months ago
2000
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...