Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Panos Kalnis, Jun Zh...
According to a survey of the University of Berkeley [6], about 5 Exabytes of new information has been created in 2002. This information explosion affects also the database volumes...
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...