Efficient and tunable similar set retrieval

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 2, 2001, Pages 247-258

  Gionis, Aristides ^b   Gunopulos, Dimitrios ^a   Koudas, Nick ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040152802     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375689     Document Type: Article

References (20)

1. R. Agrawal, C. Faloutsos, and A. Swami. Efficient Similarity Search in Sequence Databases. Proc. of the 4th Int'l Conference on Foundations of Data Organization and Algorithms, pages 69-84, October 1993.
2. P. Indyk A. Gionis and R. Motwani. Similarity Search In High Dimensions Via Hashing. Proceedings of VLDB, 1999.
3. R. Agrawal, K. Lin, H. S. Sawhney, and K. Shim. Fast Similarity Search in the Presence of Noise, Scaling and Translation in Time-Series Databases. Proceedings of VLDB, pages 490-501, September 1995.
4. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Minwise Independent Permutations. Proceedings of STOC, pages 327-336, 1998.
5. A. Broder, S. Glassman, M. Manasse, and G. Zweig. Syntactic Clustering on the Web. Proceedings of WWW6, 1997.
6. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, R. Motwani, J. Ullman, and C. Yang. Finding Interesting Associations Without Support Prunning. International Conference on Data Engineering, 2000.
7. Z. Chen, H. V. Jagadish, F. Korn, N. Koudas, S. Muthukrishnan, R. Ng, and D. Srivastava. Counting twig matches in a tree. International Conference on Data Engineering, to appear, April 2001.
8. Z. Chen, F. Korn, N. Koudas, and S. Muthukrishnan. Selectivity Estimation for Boolean Queries. PODS, May 200.
9. E. Cohen. Size-Estimation Framework With Applications To Transitive Closure And Reachability. Journal Of Comput. Syst. Sciences, 55, pages 441-453, 1997.
10. C. Faloutsos. Fast Access Methods For Text. ACM Computing Surveys 17(1), pages 49-74, 1985.
11. Christos Faloutsos, M. Ranganathan, and I. Manolopoulos. Fast Subsequence Matching in Time Series Databases. Proceedings of ACM SIGMOD, pages 419-429, May 1994.
12. V. Gaede and O. Gunther. Multidimensional Access Methods. ACM Computing Surveys, No 30, Vol 2, pages 170-231, March 1998.
13. J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. Proceedings of VLDB, pages 562-573, August 1995.
14. P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse Of Dimensionality. 30th Symposium on Theory of Computing, 1998.
15. P. Indyk. Dimensionality Reduction Techniques For Proximity problems. SODA, pages 371-378, 2000.
16. F. J MacWilliams and A. Sloane. The Theory Of Error Correcting Codes. North Holland, 1993.
17. M. Stonebraker and D. Moore. Object Relational Databases: The Next Wave. Morgan Kauffman, June 1996.
18. Manber Udi. Finding Similar Files in a Large File System. Winter USENIX Technical Conference, October 1994.
19. C. J. van Rijsbergen. Information Retrieval. Butterworths, 1979.
20. M. Kitagawa Y. Ishikawa and N. Obho. Evaluation of Signature Files as Set Access Facility in OODBs. Proceedings of ACM SIGMOD, pages 247-256, June 1993.