作者: Altitude 時間: 2025-3-21 23:46
High-Dimensional Indexing978-3-540-45770-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: formula 時間: 2025-3-22 02:48
https://doi.org/10.1007/3-540-45770-4B-Trees; Data Mining; Database Querying; High-Dimensional Indexes; High-Dimensional Indexing; Indexing; In作者: Flustered 時間: 2025-3-22 05:08
,Indexing the Edges — A Simple and Yet Efficient Approach to High-Dimensional Range Search,Many multi-dimensional indexing structures have been proposed in the literature [12, 69]. In particular, it has been observed that the performance of hierarchical tree index structures such as R-trees [46] and R*-trees [5] deteriorates rapidly with the increase in the dimensionality of data. This phenomenon is caused by two factors.作者: Schlemms-Canal 時間: 2025-3-22 09:59 作者: 紳士 時間: 2025-3-22 15:42 作者: athlete’s-foot 時間: 2025-3-22 17:50 作者: aggrieve 時間: 2025-3-22 22:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/h/image/426568.jpg作者: Thymus 時間: 2025-3-23 03:46
ulate such an idea in the concrete. No, this text is somewhat impatient with the manner in which, in the few contexts where technology is culture-historically discussed at all, very fundamental shifts are being ignored. Or at least excluded from discourse. Information technology is printing technolo作者: phlegm 時間: 2025-3-23 08:23
s challenges and requirements..This book shows how WPF techn.Applied WPF 4 in Context. sets the standard for leveraging the latest Windows user interface technology in your business applications.. . Using this book, you‘ll learn how to implement world-class Windows Professional Foundation (WPF)?solu作者: 新星 時間: 2025-3-23 12:20 作者: 該得 時間: 2025-3-23 17:35 作者: JAMB 時間: 2025-3-23 20:06
Scienti c Centres within Mathematics and its Applications, CENS-CMA (2005-2009), - der contract MTKD-CT-2004-013909, which ?nanced exchange visits to and from CENS, the Centre for Nonlinear Studies at the Institute of Cybernetics of Tallinn University of Technology in Estonia. Seven contributions de作者: assail 時間: 2025-3-24 00:17
ally have long wave periods, and occasionally very large amplitudes. The wave fan is often much wider than for conventional ships, and the leading waves can be highly nonlinear. This is particularly an issue in shallow coastal waters, and for coastal regions not exposed to large sea swell or impact 作者: confide 時間: 2025-3-24 05:01 作者: V切開 時間: 2025-3-24 08:14 作者: 不溶解 時間: 2025-3-24 12:27
e consists of twelve contributions related to the EU Marie Curie Transfer of Knowledge Project Cooperation of Estonian and Norwegian Scienti c Centres within Mathematics and its Applications, CENS-CMA (2005-2009), - der contract MTKD-CT-2004-013909, which ?nanced exchange visits to and from CENS, th作者: EXULT 時間: 2025-3-24 17:24
with suitable restrictions imposed to the transverse deformation of the layer. It turns out that the resulting equations, in the one-dimensional case, are of the same kind as those introduced by Engelbrecht and Pastrone (Proc. Estonian Acad. Sci. Phys. Math. .(1), 12–20 (2003)) for the dynamics of a作者: 驕傲 時間: 2025-3-24 21:52
Introduction,stored data according to its content, organizational methods or structures known as indexes are used. While indexes are optional, as data can always be located by sequential scanning, they are the primary means of reducing the volume of data that must be fetched and examined in response to a query. 作者: tariff 時間: 2025-3-24 23:21
High-Dimensional Indexing,mains at about 4 to 5 orders of magnitude. Hence, optimizing the number of disk I/Os remains important. This calls for the use of organizational methods or structures known as indexes to locate data of interest quickly and efficiently. Many indexes have been proposed for multi-dimensional databases 作者: 要求比…更好 時間: 2025-3-25 04:03
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 時間: 2025-3-25 08:49 作者: Curmudgeon 時間: 2025-3-25 14:57 作者: AMOR 時間: 2025-3-25 18:33
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作者: 踉蹌 時間: 2025-3-25 22:39 作者: cortex 時間: 2025-3-26 00:10 作者: braggadocio 時間: 2025-3-26 07:00
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 時間: 2025-3-26 08:55
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)易 時間: 2025-3-26 16:10
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 作者: 煩憂 時間: 2025-3-26 17:30 作者: Talkative 時間: 2025-3-27 00:38 作者: 一瞥 時間: 2025-3-27 02:17
ation Inequality 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. T作者: 食品室 時間: 2025-3-27 06:09
t with the interests of ferry operators and the general public concerning fast transportation at sea. A careful planning of ship routes and speed regimes is needed to optimize the ship operation, while maintaining acceptable wash levels at the shore. This review presents some of the basic properties作者: 依法逮捕 時間: 2025-3-27 12:24 作者: 的事物 時間: 2025-3-27 15:16 作者: Chagrin 時間: 2025-3-27 19:55
considered. The dispersion curves of the approximate and exact theories are compared for some values of Poisson’s ratio. It is shown that the main, acoustical branch fits well for wavelengths above three times the plate thickness. The optical branches of the approximate model deviate from their exac作者: 高貴領(lǐng)導(dǎo) 時間: 2025-3-27 22:26
Book 2002s and the other for similarity queries. Extensive experiments and comparison studies are conducted to demonstrate the superiority of the proposed indexing methods..Many new database applications, such as multimedia databases or stock price information systems, transform important features or propert作者: 感激小女 時間: 2025-3-28 05:30 作者: 字謎游戲 時間: 2025-3-28 08:36 作者: Presbycusis 時間: 2025-3-28 13:40 作者: Tonometry 時間: 2025-3-28 18:09
Introduction,e located by sequential scanning, they are the primary means of reducing the volume of data that must be fetched and examined in response to a query. In practice, large database files must be indexed to meet performance requirements. In fact, it has been noted [13] that indexes are the primary and most direct means in reducing redundant disk I/O.作者: 聲明 時間: 2025-3-28 20:15
High-Dimensional Indexing,ds or structures known as indexes to locate data of interest quickly and efficiently. Many indexes have been proposed for multi-dimensional databases and, in particular, for spatial databases. These indexes have been designed primarily for low-dimensional databases, and hence most of them suffer from the ‘dimensionality curse’.作者: mydriatic 時間: 2025-3-28 23:09
Conclusions,he iMinMax(.) was specifically designed for range queries, it could be extended to efficiently support approximate .-nearest neighbor (KNN) queries. The iDistance [105] was designed for supporting KNN queries directly. The basic principle of both indexes is their simple extension of existing B.-trees, while achieving efficient query retrieval.
