Titlebook: High-Dimensional Indexing; Transformational App Cui Yu Book 2002 Springer-Verlag Berlin Heidelberg 2002 B-Trees.Data Mining.Database Queryi

要求比…更好

Performance Study of Window Queries,gnitude. With the ever increasing complexity of applications, and ever increasing volume of data that need to be retrieved from disk, the number of disk accesses becomes a very important performance parameter to optimize. Data must be organized on the disk in such a way that relevant data can be loc

FAST

Curmudgeon

AMOR

Conclusions, indexing, detailed description of two new indexing techniques, the iMinMax(.) method and the iDistance method, and their performance studies. While the iMinMax(.) was specifically designed for range queries, it could be extended to efficiently support approximate .-nearest neighbor (KNN) queries. T

踉蹌

cortex

braggadocio

Part IV Waves in Fluids Part V Mathematical Methods The papers are written in a tutorial style, intended for non-specialist researchers and students, where the authors communicate their own experiences in tackling a problem that is currently of interest in the scienti?c community. T978-3-642-42519-6978-3-642-00585-5

beta-carotene

Book 2002re well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.

貿(mào)易

0302-9743 ce. Indexes for low-dimensional databases are well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.978-3-540-44199-1978-3-540-45770-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

煩憂