619 search results - page 46 / 124 » Query Planning in Infomaster |
124
click to vote
VL
1996
IEEE
15 years 6 months ago
1996
IEEE
This paper describes three new visual languages for use in the coordination of collaborative work in large CSCW environments. EVPL describes work plans and is used to define the c...
116
Voted
SSD
1999
Springer
15 years 6 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
144
click to vote
ICDE
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
122
click to vote
EDBT
2004
ACM
16 years 2 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...
101
click to vote
DAWAK
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Many SQL queries with aggregated subqueries exhibit redundancy (overlap in FROM and WHERE clauses). We propose a method, called the for-loop, to optimize such queries by ...