A dictionary for approximate string search and longest prefix search

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2006, Pages 768-775

  Gollapudi, Sreenivas ^a   Panigrahy, Rina ^b  

^a MICROSOFT RESEARCH   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Embeddings; Hamming space

Indexed keywords

HAMMING SPACES; QUERY STRINGS; RANDOM STRINGS;

DATA STRUCTURES; DATABASE SYSTEMS; EMBEDDED SYSTEMS; ERROR ANALYSIS; ONLINE SEARCHING; ONLINE SYSTEMS; QUERY PROCESSING;

DIGITAL LIBRARIES;

EID: 34547633280     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183723     Document Type: Conference Paper

References (19)

1. Alexandr Andoni and Piotr Indyk. Efficient algorithms for substring near neighbor problem. In Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm, pages 1203-1212, 2006.
2. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, and R-avi Kumar. Approximating edit distance efficiently. In Proc. 45th Symposium on Foundations of Computer Science (FOCS 2004), Pages 550-559, 2004.
3. Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
4. A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey, 2002.
5. Andrei Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of SEQUENCES SEQS: Sequences '91, 1998.
6. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. Min-wise independent permutations. Journal of Computer and System Sciences, 60(3):630-659, 2000.
7. Richard Cole, Lee-Ad Gottlieb, and Moshe Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proceedings of the 36th annual A CM symposium on Theory of computing (STOC), pages 91-100, 2004.
8. Cristian Estan and George Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput Syst., 21(3):270-313, 2003.
9. Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. of 30th ACM Symposium on Theory of Computing (STOC), pages 604-613, 1998.
10. Adam Kirsch and Michael Mitzenmacher. Distance-sensitive bloom filters. In Proceedings of ALENEX 06, 2006.
11. Eyal Kushilevitz, Rafail Ostrovsky, and Yuval Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proc. of 30th ACM Symposium on Theory of Computing (STOC), pages 614-623, 1998.
12. Gad M. Landau and Uzi Vishkin. Efficient string matching with k mismatches. Theoretical Computer Science., 43:239-249, 1986.
13. M. D. McIllroy. Development of a, spelling list. IEEE Transactions on Communications, 30(1):91-99, 1982.
14. James K. Mullin and Daniel J. Margolia-sh. A tale of three spelling checkers. Software - Practice and Experience, 20(6):625-630, 1990.
15. Gonzalo Navarro. A guided tour to approximate string matching. A CM Computing Surveys, 33(l):31-88, 2001.
16. Rafail Ostrovsky and Yuval Rabani. Low distortion embeddings for edit distance. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 218-224, 2005.
17. H. Shang and T. H. Merrettal. Tries for approximate string matching. IEEE Transactions on Knowledge and Data Engineering, 8(4):540-547, 1996.
18. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
19. E. Ukkonnen. Finding approximate pattern in strings. Journal of Algorithms, 6:132-137, 1985.