SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Much real data consists of more than one dimension, such as financial transactions (eg, price × volume) and IP network flows (eg, duration × numBytes), and capture relationship...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract. Most correlation clustering algorithms rely on principal component analysis (PCA) as a correlation analysis tool. The correlation of each cluster is learned by applying P...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Wireless sensor networks have drawn much attention due to their ability to monitor ecosystems and wildlife habitats. In such systems, the data should be intelligently collected to ...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose an automatic method for modeling a relational database that uses SQL triggers and foreign-keys to efficiently answer positive semantic queries about ground instances for...
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
