计算机技术 |
|
|
|
|
CB-LSH:基于压缩位图的高性能LSH索引算法 |
吴羽,寿黎但,陈刚 |
浙江大学 计算机科学与技术学院,浙江 杭州 310027 |
|
CB-LSH: an efficient LSH indexing algorithm based on compressed bitmap |
WU Yu, SHOU Li-dan, CHEN Gang |
College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China |
[1] PIOTR I, RAJEEV M. Approximate nearest neighbors: towards removing the curse of dimensionality [C]∥ Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. New York: ACM, 1998: 604-613.
[2] 程守远. 基于图像检索技术的领带花型检索的研究[D]. 上海: 东华大学, 2006.
[3] WU Y, SHOU LD, HU TL, et al. Query triggered crawling strategy: build a time sensitive vertical search engine [C]∥ Proceedings of the International Conference on Cyberworlds 2008. Washington: IEEE Computer Society, 2008: 422-427.
[4] GIONIS A, INDYK P, MOTWANI R. Similarity Search in High Dimensions via Hashing [C]∥ Proceedings of the 25th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann Publishers Inc, 1999:518529.
[5] DATAR M, IMMORLICA N, INDYK P, et al. Localitysensitive hashing scheme based on pstable distributions [C]∥ Proceedings of the Twentieth Annual Symposium on Computational Geometry. New York: ACM, 2004: 235-262.
[6] PANIGPRAHY R. Entropy based nearest neighbor search in high dimensions [C]∥ Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithm. New York: ACM, 2006: 1186-1195.
[7] DONG W, WANG Z, JOSEPHSON W, et al. Modeling LSH for performance tuning. [C]∥ Proceeding of the 17th ACM Conference on Information and Knowledge Management. New York: ACM, 2008: 669-678.
[8] LV Q, JOSEPHSON W, WANG Z, et al. MultiProbe LSH: Efficient indexing for highdimensional similarity search [C] ∥ Proceedings of the 33rd International Conference on Very Large Data Bases. San Francisco: VLDB Endowment, 2007: 950-961.
[9] KATAYAMA N, SATOH S. The SRtree: An index structure for highdimensional nearest neighbor queries [C]∥ Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data. New York: ACM, 1997: 369-380.
[10] WEBER R, SCHEK H J, BLOTT. A quantitative analysis and performance study for similaritysearch methods in highdimensional spaces [C] ∥ Proceedings of the 24th International Conference on Very Large Data Bases. San Francisco: VLDB Endowment, 1998: 194-205.
[11] BAWA M, CONDIE T, GANESAN P. LSH forest: selftuning indexes for similarity search [C]∥ Proceedings of the 14th International Conference on World Wide Web. New York: ACM, 2005: 651-660.
[12] CHAN CY, YANNIS EL. Bitmap index design and evaluation [C] ∥ Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. New York: ACM, 1998: 355-366.
[13] WU K, OTOO E J, SHOSHANI A. A performance comparison of bitmap indexes [C]∥ Proceedings of the Tenth International Conference on Information and Knowledge Management. New York: ACM, 2001: 559-561.
[14] WU K, OTOO E J, SHOSHANI A. Compressing bitmap indexes for faster search operations[C]∥ Proceedings of the 14th International Conference on Scientific and Statistical Database Management. Washington: IEEE Computer Society, 2002: 99-108.
[15] GENNADY A, MOHAMED Z. Query processing and optimization in Oracle RDB [C]∥ Proceedings of the 23rd International Cconference on Very Large Data Bases. San Francisco: VLDB Endowment, 1996: 229-237.
[16] WU K, OTOO E J, SHOSHANI A. An efficient compression scheme for bitmap indices [J]. ACM Transactions on Database Systems, 2004, 16(1):1-7.
[17] WU K, OTOO EJ, SHOSHANI A. Optimizing bitmap indices with efficient compression [J]. ACM Transactions on Database Systems, 2006, 31(1):1-38. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|