[1] |
GUTTMAN A . R-trees:a dynamic index structure for spatial searching[J]. ACM SIGMOD Record, 1984,14(2): 47-57.
|
[2] |
KATAYAMA N , SATOH S . The SR-tree:an index structure for high-dimensional nearest neighbor queries[C]// ACM SIGMOD International Conference on Management of Data,May 11-15,1997,Tucson,Arizona,USA. New York:ACM Press, 1997: 369-380.
|
[3] |
过洁, 徐晓旸, 潘金贵 . 虚拟场景的一种快速优化 Kd-Tree构造方法[J]. 电子学报, 2011,39(8): 1811-1817.
|
|
GUO J , XU X Y , PAN J G . Build Kd-Tree for virtual scenes in a fast and optimal way[J]. Chinese Journal of Electronics, 2011,39(8): 1811-1817.
|
[4] |
WEBER R , SCHEK H J , BLOTT S . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces[C]// International Conference on Very Large Data Bases,August 24-27,1998,San Francisco,CA,USA. New York:ACM Press, 1998: 194-205.
|
[5] |
INDYK P , MOTWANI R . Approximate nearest neighbors:towards removing the curse of dimensionality[J].Theory of Computing,2000,604-613(11):604-613. Theory of Computing, 2000,604-613(11): 604-613.
|
[6] |
DATAR M , IMMORLICA N , INDYK P ,et al. Locality-sensitive hashing scheme based on p-stable distributions[C]// Twentieth Symposium on Computational Geometry,June 8-11,2004,Brooklyn,New York,USA. New York:ACM Press, 2004: 253-262.
|
[7] |
LV Q , JOSEPHSON W , WANG Z ,et al. Multi-probe LSH:efficient indexing for high-dimensional similarity search[C]// International Conference on Very Large Data Bases,September 23-27,2007,Vienna,Austria. New York:ACM Press, 2007: 950-961.
|
[8] |
PANIGRAHY R , . Entropy based nearest neighbor search in high dimensions[C]// The Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms,November 4,2005,Miami,Florida,USA.[S.l.:s.n]. 2005: 1186-1195.
|
[9] |
LIU Y F , CUI J T , HUANG Z ,et al. SK-LSH:an efficient index structure for approximate nearest neighbor search[J]. Proceedings of the VLDB, 2014,7(9): 745-756.
|
[10] |
TAO Y F , YI K , SHENG C ,et al. Quality and efficiency in high dimensional nearest neighbor search[C]// ACM Sigmod International Conference on Management of Data,June 29-July 2,2009,Providence,Rhode Island,USA. New York:ACM Press, 2009: 563-576.
|
[11] |
QIAN J , ZHU Q , CHEN H . Multi-granularity locality-sensitive bloom filter[J]. IEEE Transactions on Computers, 2015,64(12): 3500-3514.
|
[12] |
PAULEV L , GOU H , AMSALEG L . Locality sensitive hashing:a comparison of hash function types and querying mechanisms[J]. Pattern Recognition Letters, 2010,31(11): 1348-1358.
|
|
QIAN J , ZHU Q , WANG Y . Bloom filter based associative deletion[J]. IEEE Transactions on Parallel and Distributed Systems, 2014,24(8): 1986-1998.
|
[14] |
胡海苗, 姜帆 . 基于可扩展LSH的高维动态数据索引[J]. 软件学报, 2015,26(2): 228-238.
|
|
HU H M , JIANG F . Scalable locality sensitive hashing scheme for dynamic high-dimension data indexing[J]. Journal of Software, 2015,26(2): 228-238.
|
[15] |
吴军 . 大数据和机器智能对未来社会的影响[J]. 电信科学, 2015,31(2): 7-16.
|
|
WU J . Big data,machine intelligence and their impacts to the future world[J]. Telecommunications Science, 2015,31(2): 7-16.
|