Sciweavers

418 search results - page 32 / 84
» Optimizing Large Join Queries in Mediation Systems
Sort
View
SEBD
1996
94views Database» more  SEBD 1996»
13 years 9 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
VLDB
1998
ACM
126views Database» more  VLDB 1998»
13 years 12 months ago
Materialized Views in Oracle
Oracle Materialized Views (MVs) are designed for data warehousing and replication. For data warehousing, MVs based on inner/outer equijoins with optional aggregation, can be refre...
Randall G. Bello, Karl Dias, Alan Downing, James J...
GIS
2005
ACM
14 years 8 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
NIS
1998
131views more  NIS 1998»
13 years 7 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
HPDC
2000
IEEE
14 years 3 days ago
dQUOB: Managing Large Data Flows using Dynamic Embedded Queries
The dQUOB system satis es client need for speci c information from high-volume data streams. The data streams we speak of are the ow of data existing during large-scale visualizat...
Beth Plale, Karsten Schwan