Sciweavers

47 search results - page 2 / 10
» A Cost Model for Clustered Object-Oriented Databases
Sort
View
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 2 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
ADC
2007
Springer
93views Database» more  ADC 2007»
14 years 2 months ago
A Heuristic Approach to Cost-Efficient Derived Horizontal Fragmentation of Complex Value Databases
Derived horizontal fragmentation is one of the main database distribution design techniques. Unlike primary horizontal fragmentation, the decision of derived horizontal fragmentat...
Hui Ma, Klaus-Dieter Schewe, Qing Wang
ICDAR
2003
IEEE
14 years 4 months ago
A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
Alceu de Souza Britto Jr., Paulo Sergio Lopes de S...
SISAP
2008
IEEE
147views Data Mining» more  SISAP 2008»
14 years 5 months ago
An Empirical Evaluation of a Distributed Clustering-Based Index for Metric Space Databases
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
Veronica Gil Costa, Mauricio Marín, Nora Re...
ADBIS
1995
Springer
155views Database» more  ADBIS 1995»
14 years 2 months ago
The MaStA I/O Cost Model and its Validation Strategy
Crash recovery in database systems aims to provide an acceptable level of protection from failure at a given engineering cost. A large number of recovery mechanisms are known, and...
S. Scheuerl, Richard C. H. Connor, Ronald Morrison...