A parallel similarity search in high dimensional metric space using M-tree

被引：0

作者：

Alpkocak, A ^{[1
]}

Danisman, T ^{[1
]}

Ulker, T ^{[1
]}

机构：

[1] Dokuz Eylul Univ, Dept Comp Engn, TR-35100 Izmir, Turkey

来源：

ADVANCED ENVIRONMENTS, TOOLS, AND APPLICATIONS FOR CLUSTER COMPUTING | 2002年 / 2326卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this study, parallel implementation of M-tree to index high dimensional metric space has been elaborated and an optimal declustering technique has been proposed. First, we have defined the optimal declustering and developed an algorithm based on this definition. Proposed declustering algorithm considers both object proximity and data load on disk/processors by executing a k-NN or a range query for each newly inserted objects. We have tested our algorithm in a database containing randomly chosen 1000 image's color histograms with 32 bins in HSV color space. Experimentation showed that our algorithm produces a very near optimal declustering.

引用

页码：166 / 171

页数：6

共 50 条

[1] M-tree: An efficient access method for similarity search in metric spaces
Ciaccia, P
Patella, M
Zezula, P
PROCEEDINGS OF THE TWENTY-THIRD INTERNATIONAL CONFERENCE ON VERY LARGE DATABASES, 1997, : 426 - 435
[2] Peer-to-Peer Similarity Search Based on M-Tree Indexing
Vlachou, Akrivi
Doulkeridis, Christos
Kotidis, Yannis
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT II, PROCEEDINGS, 2010, 5982 : 269 - +
[3] Parallel M-tree Based on Declustering Metric Objects using K-medoids Clustering
Qiu, Chu
Lu, Yongquan
Gao, Pengdong
Wang, Jintao
Lv, Rui
PROCEEDINGS OF THE NINTH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING AND SCIENCE (DCABES 2010), 2010, : 206 - 210
[4] Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Zhang, Ming
Alhajj, Reda
KNOWLEDGE AND INFORMATION SYSTEMS, 2010, 22 (01) : 1 - 26
[5] Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Ming Zhang
Reda Alhajj
Knowledge and Information Systems, 2010, 22 : 1 - 26
[6] Parallel Dynamic Batch Loading in the M-tree
Lokoc, Jakob
SISAP 2009: 2009 SECOND INTERNATIONAL WORKSHOP ON SIMILARITY SEARCH AND APPLICATIONS, PROCEEDINGS, 2009, : 117 - 123
[7] High dimensional similarity search with space filling curves
Liao, SW
Lopez, MA
Leutenegger, ST
17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2001, : 615 - 622
[8] Distributed Online Similarity Search in High Dimensional Space
Li, Baohui
Xu, Kefu
Xie, Hongtao
2014 INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2014, : 204 - +
[9] Fast and secure similarity search in high dimensional space
Furon, Teddy
Jegou, Herve
Amsaleg, Laurent
Mathon, Benjamin
PROCEEDINGS OF THE 2013 IEEE INTERNATIONAL WORKSHOP ON INFORMATION FORENSICS AND SECURITY (WIFS'13), 2013, : 73 - 78
[10] Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves
Loh, Woong-Kee
CMC-COMPUTERS MATERIALS & CONTINUA, 2021, 66 (02): : 1251 - 1267

← 1 2 3 4 5 →