47 search results - page 4 / 10 » A Cost Model for Clustered Object-Oriented Databases |
HT
1991
ACM
13 years 11 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
IPPS
2003
IEEE
14 years 21 days ago
2003
IEEE
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
ADBIS
2006
Springer
14 years 1 months ago
2006
Springer
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
ICDE
2002
IEEE
14 years 8 months ago
2002
IEEE
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...