Dynamic sorted neighborhood indexing for real-time entity resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8506 LNCS, Issue , 2014, Pages 1-12

  Ramadan, Banda ^a   Christen, Peter ^a   Liang, Huizhi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

braided tree; data matching; Dynamic indexing

Indexed keywords

DATABASE SYSTEMS; QUERY PROCESSING; TREES (MATHEMATICS);

BRAIDED TREE; DATA MATCHING; DYNAMIC DATABASE; ENTITY RESOLUTIONS; INDEXING METHODS; INDEXING TECHNIQUES; REAL-WORLD ENTITIES; VERY LARGE DATABASE;

INDEXING (OF INFORMATION);

EID: 84904155169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-08608-8_1     Document Type: Conference Paper

References (16)

1. Christen, P.: Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer (2012)
2. Herzog, T., Scheuren, F., Winkler, W.: Data quality and record linkage techniques. Springer (2007)
3. Dong, X.L., Srivastava, D.: Big data integration. In: IEEE ICDE, Brisbane, AU, pp. 1245-1248 (2013)
4. Rice, S.V.: Braided AVL trees for efficient event sets and ranked sets in the SIMSCRIPT III simulation programming language. In: Western MultiConference on Computer Simulation, San Diego, pp. 150-155 (2007)
5. Hernandez, M.A., Stolfo, S.J.: The merge/purge problem for large databases. In: ACM SIGMOD, San Jose, pp. 127-138 (1995)
6. Christen, P., Gayler, R., Hawking, D.: Similarity-aware indexing for real-time entity resolution. In: ACM CIKM, Hong Kong (2009)
7. Ramadan, B., Christen, P., Liang, H., Gayler, R.W., Hawking, D.: Dynamic similarity-aware inverted indexing for real-time entity resolution. In: Li, J., Cao, L., Wang, C., Tan, K.C., Liu, B., Pei, J., Tseng, V.S. (eds.) PAKDD 2013 Workshops. LNCS (LNAI), vol. 7867, pp. 47-58. Springer, Heidelberg (2013)
8. Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB, Edinburgh, Scotland, pp. 518-529 (1999)
9. Zhang, Z., Jiang, J., Liu, X., Lau, R., Wang, H., Zhang, R.: A real time hybrid pattern matching scheme for stock time series. In: Australin Database Conference, pp. 161-170. Australian Computer Society, Inc., Brisbane (2010)
10. Fellegi, I., Sunter, A.: A theory for record linkage. Journal of the American Statistical Association 64(328), 1183-1210 (1969)
11. Bhattacharya, I., Getoor, L.: Query-time entity resolution. Journal of Artificial Intelligence Research 30, 621-657 (2007)
12. Ioannou, E., Nejdl, W., Niederée, C., Velegrakis, Y.: On-the-fly entity-aware query processing in the presence of linkage. VLDB Endowment 3(1) (2010)
13. Yan, S., Lee, D., Kan, M.Y., Giles, L.C.: Adaptive sorted neighborhood methods for efficient record linkage. In: ACM/IEEE-CS Joint Conference on Digital Libraries, Vancouver, Canada, pp. 185-194 (2007)
14. Draisbach, U., Naumann, F., Szott, S., Wonneberg, O.: Adaptive windows for duplicate detection. In: IEEE ICDE, Washington, DC, pp. 1073-1083 (2012)
15. Christen, P.: Preparation of a real voter data set for record linkage and duplicate detection research. Technical report. Australian National University (2013)
16. Christen, P., Pudjijono, A.: Accurate synthetic generation of realistic personal information. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 507-514. Springer, Heidelberg (2009)