Indexing and searching a data collection

作者: Jonathan J. Hess

DOI:

关键词:

摘要: A system searches a data collection using bloom filter index to reduce the search scope improve efficiency, while at same time allowing more flexible of terms containing any arbitrary string data.

参考文章(16)
Luke W. Friendshuh, Sumanth Jannyavula Venkata, Mark Allen Gaertner, Ryan James Goss, James David Sawin, Criteria for selection of data for a secondary cache ,(2012)
Udi Manber, Ruben Ortega, Yu-Shan Fung, Taylor N. Van Vleet, Search annotation and personalization services ,(2011)
Kwame Gyang, Jeremy Daniel Buhler, Mark Allen Franklin, Praveen Krishnamurthy, Joseph Marion Lancaster, Roger Dean Chamberlain, Arpith Chacko Jacob, Method and apparatus for performing similarity searching ,(2011)
Kumar Chellapilla, Denis Charles, Anton Mityagin, Data partitioning via bucketing bloom filters ,(2007)
Jianchang Mao, Yun Fu, Zhichen Xu, Dynamic bloom filter for caching query results ,(2006)
Richard M. Karp, Michael O. Rabin, Efficient randomized pattern-matching algorithms Ibm Journal of Research and Development. ,vol. 31, pp. 249- 260 ,(1987) , 10.1147/RD.312.0249
John Bethencourt, Dawn Song, Brent Waters, New Techniques for Private Stream Searching ACM Transactions on Information and System Security. ,vol. 12, pp. 1- 32 ,(2009) , 10.1145/1455526.1455529