A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
A practical scalable distributed B-tree
Proceedings of the VLDB Endowment
An efficient multi-dimensional index for cloud data management
Proceedings of the first international workshop on Cloud data management
Indexing multi-dimensional data in a cloud system
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
The Hadoop Distributed File System
MSST '10 Proceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)
Efficient B-tree based indexing for cloud data processing
Proceedings of the VLDB Endowment
An efficient quad-tree based index structure for cloud data management
WAIM'11 Proceedings of the 12th international conference on Web-age information management
A method for trust management in cloud computing: Data coloring by cloud watermarking
International Journal of Automation and Computing
IC cloud: Enabling compositional cloud
International Journal of Automation and Computing
Hi-index | 0.00 |
Currently, the cloud computing systems use simple key-value data processing, which cannot support similarity search effectively due to lack of efficient index structures, and with the increase of dimensionality, the existing tree-like index structures could lead to the problem of "the curse of dimensionality". In this paper, a novel VF-CAN indexing scheme is proposed. VF-CAN integrates content addressable network (CAN) based routing protocol and the improved vector approximation file (VA-file) index. There are two index levels in this scheme: global index and local index. The local index VAK-file is built for the data in each storage node. VAK-file is the k-means clustering result of VA-file approximation vectors according to their degree of proximity. Each cluster forms a separate local index file and each file stores the approximate vectors that are contained in the cluster. The vector of each cluster center is stored in the cluster center information file of corresponding storage node. In the global index, storage nodes are organized into an overlay network CAN, and in order to reduce the cost of calculation, only clustering information of local index is issued to the entire overlay network through the CAN interface. The experimental results show that VF-CAN reduces the index storage space and improves query performance effectively.