* 教科书：
索引结构的设计可参考《数据结构》教科书中的搜索（Search）的章节。索引结构的设计可参考《算法与数据结构》教科书中的搜索（Search）的章节。
# Thomas H. Cormen, Introduction to algorithms, third edition, MIT press, 2009.
# Eva Tardos and Jon Kleinberg, Algorithm Design, Pearson, 2006.
# Tim Roughgarden, [http://www.algorithmsilluminated.org Algorithms Illuminated].
=索引的形式=
# B. H. Bloom,Space/time trade-offs in hash coding with allowable errors, Commun. ACM, Volume 13 Issue 7, Pages 422-426, July 1970.
# Crainiceanu, Adina, and Daniel Lemire. "Bloofi: Multidimensional Bloom Filters." Information Systems 54 (2015): 311-324.
# Chazelle, Bernard, et al. "The Bloomier filter: an efficient data structure for static support lookup tables." SODA, 2004.
== 树（Tree） ==