Indexing and its data structure is an example of such techniques. Despite its popularity in query optimization for efficient data mining, the indexing was not integrated into the MapReduce platform. By design the MapReduce was made to perform a full scan of the input data. However, there were...
研究报告 > 技术指导 > R-tree Based KNN Indexing Techniques(PPT-60) 下载文档 收藏 打印 转格式 49阅读文档大小:865.0K60页4dddc75b上传于2015-04-01格式:PPT 人工智能基础(第2版) x2d;高济 x2d;ai x2d;4 x2d;本 热度: 安妮老师--魅力女性两天课程(课纲)590 ...
computing environments wherein the number of read operations (readers) accessing a shared data set is large in comparison to the number of update operations (updaters), and wherein the overhead cost of employing other mutual exclusion techniques (such as locks) for each read operation would be...
Recall from the algorithm of computing shortest distance over a tree structure introduced in Section 6.1, certain pruning techniques are applied during the traversal through the tree nodes. The first pruning strategy, namely first removing the branches in the tree which do not contain any vertex in...
Proceedings of the Institute of Electrical and Electronics Engineers (IEEE) Conference on Computer Vision and Pattern Recognition (CVPR), 2006. However, the set of content descriptors210may be large enough (e.g., on the order of terabytes) so that conventional index tree212build techniques result...
Such geometric predicates are ubiquitous within the efficient implementations of non-matching finite element techniques, where two different geometries, usually representing different physical components, overlap arbitrarily such as in immersed methods [22], [49] or in particle methods [47]. By ...
Regarding the architecture of reconfigurable cache, it can be reconfigured by tuning the cache capacity, number of associative ways, and cache line size utilizing techniques such as way-shutdown, way-concatenation, and line-resizing [5–12]. Gordon-Ross et al. [5] proposed a reconfigurable ...
For instance, mean shift is a nonparametric density gradient estimation using a generalized kernel approach and is one of the most powerful clustering techniques. Cai et al. proposed a cross-sections of axons detection and connection method using nonlinear diffusion and mean shift [14]. The ...
ClusteringsortingR-treeindexWe propose new R-tree construction techniques (CSR-tree) for spatial databases. The main ideal of this algorithm is to make ... Z He,C Wu,C Wang - IEEE 被引量: 20发表: 2008年 A Neighborhood-Based Clustering by Means of the Triangle Inequality We prove experime...
Spatial index and query are enabling techniques for achieving the vision of the Internet of Things. K-NN is an algorithm which is used widely in spatial database. Traditional query algorithms use R-tree as the index structure and improve the query effici