VLDB
1999
ACM
13 years 12 months ago
1999
ACM
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
13 years 12 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
While the desire to support fast, ad hoc query processing for large data warehouses has motivated the
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
Data intensive applications today usually run in either a clientserver or a middleware environment. In either case, they must efficiently handle both database queries, which proc...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
