Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Segmentation of continuous audio is important for speaker indexing. The reliability of models in speaker indexing depends much on segmentation. Commonly used method is based on th...