Sciweavers

363 search results - page 72 / 73
» Analyzing Plan Diagrams of Database Query Optimizers
Sort
View
EDBT
2009
ACM
186views Database» more  EDBT 2009»
14 years 5 days ago
Automating the loading of business process data warehouses
Business processes drive the operations of an enterprise. In the past, the focus was primarily on business process design, modeling, and automation. Recently, enterprises have rea...
Malú Castellanos, Alkis Simitsis, Kevin Wil...
IJCNN
2000
IEEE
13 years 9 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
COMAD
1994
13 years 6 months ago
An Adaptive, Load Balancing Parallel Join Algorithm
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
Minesh B. Amin, Donovan A. Schneider, V. Singh
PODS
1999
ACM
121views Database» more  PODS 1999»
13 years 9 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
VLDB
1987
ACM
90views Database» more  VLDB 1987»
13 years 8 months ago
Index Access with a Finite Buffer
: A buffer is a main-memory area used to reduce accessto disks. The buffer holds pages from secondary storage files. A processrequesting a page causesa fault if the pageis not in t...
Giovanni Maria Sacco