A document comparison scheme for secure duplicate detection

International Journal on Digital Libraries

Volumn 4, Issue 3, 2004, Pages 223-244

  Mandreoli, Federica ^a   Martoglia, Riccardo ^a   Tiberio, Paolo ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Clustering; Data reduction; Databases; Information retrieval; Intellectual property protection

Indexed keywords

EID: 77955176442     PISSN: 14325012     EISSN: 14321300     Source Type: Journal    
DOI: 10.1007/s00799-004-0079-7     Document Type: Article

References (26)

1. Secure Hash Standard (1995) Technical Report FIPS PUB 180-1 US Department of Commerce/National Institute of Standards and Technology
2. Arms WY (2000) Digital libraries. MIT Press, Cambridge, MA
3. Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley, Reading, MA
4. Baeza-Yates RA, Navarro G (1996) A faster algorithm for approximate string matching. In: 7th annual symposium on combinatorial pattern matching, pp 1-23
5. Breunig M, Kriegel H, Kröger P, Sander J (2001) Data bubbles: quality preserving performance boosting for hierarchical clustering. In: Proc. ACM international conference on management of data (SIGMOD'01), pp 79-90
6. Bricklin D (2004) Copy Protection Robs the Future. http://www.bricklin.com/robfuture.htm
7. Brin S, Davis J, Garcia-Molina H (1995) Copy detection mechanisms for digital documents. In: Proc. 1995 ACM SIGMOD international conference on management of data, pp 398-409
8. Broder A, Glassman S, Manasse M, Zweig G (1997) Syntactic clustering of the Web. Computer Netw ISDN Syst 29(8-13):1157-1166
9. Chowdhury A, Frieder O, Grossman D (2002) Collection statistics for fast duplicate document detection. ACM Trans Inf Syst 20(2):171-191
10. Ciaccia P, Patella M (2002) Searching in metric spaces with user-defined and approximate distances. Trans Database Syst 4(27):398-437
11. Ciaccia P, Patella M, Zezula P (1997) M-Tree: an efficient access method for similarity search in metric spaces. In: Proc. 23rd international conference on very large data bases (VLDB), pp 426-435
12. Gravano L, Ipeirotis P, Jagadish H, Koudas N, Muthukrishnan S, Srivastava D (2001) Approximate string joins in a database (almost) for free. In: Proc. 27th international conference on very large data bases (VLDB)
13. nd Usenix workshop on electronic commerce, pp 191-200
14. Jain A, Dubes R (1988) Algorithms for clustering data. Prentice-Hall, Englewood Cliffs, NJ
15. Jain A, Murty M, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264-323
16. Khachiyan L (1979) A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR 244:1093-1096
17. Kwok SH (2003) Watermark-based copyright protection system security. Commun ACM 46(10):98-101
18. Lawrence S, Bollacher K, Lee Giles C (1999) Indexing and retrieval of scientific literature. In: Proc. 8th international conference on information and knowledge management (CIKM)
19. Litman J (2002) Digital copyright and the progress of science. ACM SIGIR Forum 36(2):44-52
20. Mandreoli F, Martoglia R, Tiberio P (2002) A syntactic approach for searching similarities within sentences. In: Proc. 11th ACM conference of information and knowledge management (ACM CIKM)
21. Mandreoli F, Martoglia R, Tiberio P (2003) Exploiting multilingual text potentialities in EBMT systems. In: Proc. 13th IEEE international workshop on research issues in data engineering: multi lingual information management (IEEE RIDEMLIM 2003)
22. Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31-88
23. nd international conference on theory and practice of digital libraries
24. Sutinen E, Tarhio J (1996) Filtration with q-samples in approximate string matching. In: Proc. 7th annual symposium on combinatorial pattern matching
25. Vitter J (1987) An efficient algorithm for sequential random sampling. ACM Trans Math Softw 13(1):58-67
26. Zhou J, Sander J (2003) Data bubbles for non-vector data: speeding-up hierarchical clustering in arbitrary metric spaces. In: Proc. 29th international conference on very large data bases (VLDB)