Approximate string search in spatial databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 545-556

  Yao, Bin ^a   Li, Feifei ^a   Hadjieleftheriou, Marios ^b   Hou, Kun ^a  

^a Florida State University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE STRING MATCHES; CONCISE REPRESENTATIONS; HASHING TECHNIQUES; INDEX NODES; INDEX STRUCTURE; NEAREST NEIGHBOR QUERIES; Q-GRAMS; QUERY PREDICATES; QUERY STRING; RANGE QUERY; REAL DATA SETS; SPATIAL DATABASE; STRING SEARCH;

ADAPTIVE ALGORITHMS; DECISION TREES;

QUERY LANGUAGES;

EID: 77952757244     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447836     Document Type: Conference Paper

References (37)

1. "Open street map," http://www.openstreetmap.org.
2. "The spatialindex library," www.research.att.com/~marioh/ spatialindex.
3. S. Acharya, V. Poosala, and S. Ramaswamy, "Selectivity estimation in spatial databases," in SIGMOD, 1999.
4. A. Arasu, V. Ganti, and R. Kaushik, "Efficient exact set-similarity joins," in VLDB, 2006.
5. A. Arasu, S. Chaudhuri, K. Ganjam, and R. Kaushik, "Incorporating string transformations in record matching," in SIGMOD, 2008.
6. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles," in SIGMOD, 1990.
7. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, "Min-wise independent permutations (extended abstract)," in STOC, 1998.
8. K. Chakrabarti, S. Chaudhuri, V. Ganti, and D. Xin, "An efficient filter for approximate membership checking," in SIGMOD, 2008.
9. S. Chaudhuri and R. Kayshik, "Extending autocompletion to tolerate errors," in SIGMOD, 2009.
10. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani, "Robust and efficient fuzzy match for online data cleaning," in SIGMOD, 2003.
11. S. Chaudhuri, V. Ganti, and L. Gravano, "Selectivity estimation for string predicates: Overcoming the underestimation problem," in ICDE, 2004.
12. S. Chaudhuri, V. Ganti, and R. Kaushik, "A primitive operator for similarity joins in data cleaning," in ICDE, 2006.
13. E. Cohen, "Size-estimation framework with applications to transitive closure and reachability," Journal of Computer and System Sciences, vol. 55, no. 3, pp. 441-453, 1997.
14. G. Cong, C. S. Jensen, and D. Wu, "Efficient retrieval of the top-k most relevant spatial web objects," PVLDB, vol. 2, no. 1, pp. 337-348, 2009.
15. E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica, "Correlation clustering in general weighted graphs," Theoretical Computer Science, vol. 361, no. 2, pp. 172-187, 2006.
16. C. Ding and X. He, "Cluster merging and splitting in hierarchical clustering algorithms," in ICDM, 2002.
17. I. D. Felipe, V. Hristidis, and N. Rishe, "Keyword search on spatial databases," in ICDE, 2008.
18. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S.Muthukrishnan, and D. Srivastava, "Approximate string joins in a database (almost) for free," in VLDB, 2001.
19. D. Gunopulos, G. Kollios, J. Tsotras, and C. Domeniconi, "Selectivity estimators for multidimensional range queries over real attributes," The VLDB Journal, vol. 14, no. 2, pp. 137-154, 2005.
20. A. Guttman, "R-trees: a dynamic index structure for spatial searching," in SIGMOD, 1984.
21. G. R. Hjaltason and H. Samet, "Distance browsing in spatial databases," ACM Trans. Database Syst., vol. 24, no. 2, 1999.
22. V. Hristidis and Y. Papakonstantinou, "Discover: keyword search in relational databases," in VLDB, 2002.
23. H. V. Jagadish, R. T. Ng, and D. Srivastava, "Substring selectivity estimation," in PODS, 1999.
24. S. Ji, G. Li, C. Li, and J. Feng, "Efficient interactive fuzzy keyword search," in WWW, 2009.
25. L. Jin and C. Li, "Selectivity estimation for fuzzy string predicates in large data sets," in VLDB, 2005.
26. L. Jin, C. Li, and R. Vernica, "Sepia: estimating selectivities of approximate string predicates in large databases," The VLDB Journal, vol. 17, no. 5, pp. 1213-1229, 2008.
27. M.-S. Kim, K.-Y. Whang, J.-G. Lee, and M.-J. Lee, "n-gram/2l: a space and time efficient two-level n-gram inverted index structure," in VLDB, 2005.
28. N. Koudas, A. Marathe, and D. Srivastava, "Flexible string matching against large databases in practice," in VLDB, 2004.
29. H. Lee, R. T. Ng, and K. Shim, "Extending q-grams to estimate selectivity of string matching with low edit distance," in VLDB, 2007.
30. H. Lee, R. T. Ng, and K. Shim, "Approximate substring selectivity estimation," in EDBT, 2009.
31. C. Li, J. Lu, and Y. Lu, "Efficient merging and filtering algorithms for approximate string searches," in ICDE, 2008.
32. A. Mazeika, M. H. Böhlen, N. Koudas, and D. Srivastava, "Estimating the selectivity of approximate string queries," ACM TODS, vol. 32, no. 2, pp. 12-52, 2007.
33. N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest neighbor queries," in SIGMOD, 1995.
34. S. Sahinalp, M. Tasan, J. Macker, and Z. Ozsoyoglu, "Distance based indexing for string proximity search," in ICDE, 2003.
35. E. Sutinen and J. Tarhio, "On using q-gram locations in approximate string matching," in ESA, 1995.
36. E. Ukkonen, "Approximate string-matching with q-grams and maximal matches," Theor. Comput. Sci., vol. 92, no. 1, pp. 191-211, 1992.
37. X. Yang, B.Wang, and C. Li, "Cost-based variable-length-gram selection for string collections to support approximate queries efficiently," in SIGMOD, 2008.