VLDB
2000
ACM
13 years 8 months ago
2000
ACM
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Today's Internet economy has primed customers to expect immediate access and immediate results. But instant results are difficult to achieve when your customers want up-to-th...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
A well-known challenge in data warehousing is the efficient incremental maintenance of warehouse data in the presence of source data updates. In this paper, we identify several cr...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal dat...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...