As databases get widely deployed, it becomes increasingly important to reduce the overhead of database administration. An important aspect of data administration that critically i...
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
The CONTROL project at U.C. Berkeley has developed technologies to provide online behavior for data-intensive applications. Using new query processing algorithms, these technologi...
Ron Avnur, Joseph M. Hellerstein, Bruce Lo, Chris ...
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
The Web is based on a browsing paradigm that makes it di cult to retrieve and integrate data from multiple sites. Today, the only way to achieve this integration is by building sp...
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopul...
Prototype databases are needed in any information system development process to support data-intensive applications development. It is common practice to populate these databases u...
Jesus Bisbal, Bing Wu, Deirdre Lawless, Jane Grims...