%0 Conference Proceedings
%T CCIndex: a Complemental Clustering Index on Distributed Ordered Tables for Multi-dimensional Range Queries
%+ CAS Institute of Computing Technology (ICT)
%A Zou, Yongqiang
%A Liu, Jia
%A Wang, Shicai
%A Zha, Li
%A Xu, Zhiwei
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B IFIP International Conference on Network and Parallel Computing (NPC)
%C Zhengzhou, China
%Y Chen Ding; Zhiyuan Shao; Ran Zheng
%I Springer
%3 Network and Parallel Computing
%V LNCS-6289
%P 247-261
%8 2010-09-13
%D 2010
%R 10.1007/978-3-642-15672-4_22
%K Clustering
%K index
%K range queries
%K multi-dimensional
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X Massive scale distributed database like Google's BigTable and Yahoo!'s PNUTS can be modeled as Distributed Ordered Table, or DOT, which partitions data regions and supports range queries on key. Multi-dimensional range queries on DOTs are fundamental requirements; however, none of existing schemes work well while considering three critical issues: high performance, low space overhead, and high reliability. This paper introduces CCIndex scheme, short for Complemental Clustering Index, to solve all three issues. CCIndex creates several Complemental Clustering Index Tables for performance, leverages region-to-server information to estimate result size, and supports incremental data recovery. This paper builds a prototype on Apache HBase. Theoretical analysis and micro-benchmarks show that CCIndex consumes 5.3% ~ 29.3% more space, has the same reliability, and gains 11.4 times range queries throughput of secondary index scheme. Synthetic application benchmark shows that CCIndex query throughput is 1.9 ~ 2.1 times of MySQL Cluster.
%G English
%2 https://inria.hal.science/hal-01054987/document
%2 https://inria.hal.science/hal-01054987/file/NPC10-_1569306987.pdf
%L hal-01054987
%U https://inria.hal.science/hal-01054987
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6289
%~ IFIP-NPC
%~ IFIP-2010