VLDB
1998
ACM
14 years 3 months ago
1998
ACM
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
Data warehouses collect data into materialized views for analysis. After some time, some of the data may no longer be needed or may not be of interest. In this paper, we handle th...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
We propose a multi-dimensional language called nD-SQL with the following features: (i) nD-SQL supports queries that interoperate amongst multiple relational sources with heterogen...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
Wedescribea novel approachfor clustering collectionsof sets,andits applicationto theanalysis and mining of categoricaldata. By "categorical data," we meantableswith fiel...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
The design of secure buffer managers for database systems supporting real-time applications with firm deadlines is studied here. We first identify the design challenges and then p...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...