Sciweavers

1390 search results - page 37 / 278
» Self-Sizing of Clustered Databases
Sort
View
CLUSTER
2002
IEEE
15 years 4 months ago
Cluster Based Hybrid Hash Join: Analysis and Evaluation
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
Erich Schikuta, Peter Kirkovits
SIGMOD
1998
ACM
271views Database» more  SIGMOD 1998»
14 years 11 months ago
Towards On-Line Analytical Mining in Large Databases
Great e orts have been paid in the Intelligent Database Systems Research Lab for the research and development of e cient data mining methods and construction of on-line analytical...
Jiawei Han
DAWAK
1999
Springer
15 years 3 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
JIIS
2000
111views more  JIIS 2000»
14 years 11 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
16 years 25 days ago
Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
Fusheng Wang, Xin Zhou, Carlo Zaniolo