Abstract
This paper studies the 1-error dictionary search problem in external memory. The input is a set D of strings whose characters are drawn from a constant-size alphabet. Given a string q, a query reports the ids of all strings in D that are within 1 edit distance from q. We give a structure occupying O(n/B) blocks that answers a query in \(O(1 + \frac{m}{wB} + \frac{k}{B})\) I/Os, where n is the total length of all strings in D, m is the length of q, k is the number of ids reported, w is the size of a machine word, and B is the number of words in a block.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. CACM 31(9), 1116–1127 (1988)
Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. of Comp. 32(6), 1488–1508 (2003)
Belazzougui, D.: Faster and space-optimal edit distance “1” dictionary. In: Annual Symp. on Combinatorial Pattern Matching, pp. 154–167 (2009)
Belazzougui, D., Venturini, R.: Compressed string dictionary look-up with edit distance one. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 280–292. Springer, Heidelberg (2012)
Brodal, G.S., Gasieniec, L.: Approximate dictionary queries. In: Hirschberg, D., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 65–74. Springer, Heidelberg (1996)
Chan, H.-L., Lam, T.-W., Sung, W.-K., Tam, S.-L., Wong, S.-S.: A linear size index for approximate pattern matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 49–59. Springer, Heidelberg (2006)
Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don’t cares. In: STOC, pp. 91–100 (2004)
Demaine, E.D., auf der Heide, F.M., Pagh, R., Pǎtraşcu, M.: De dictionariis dynamicis pauco spatio utentibus (lat. on dynamic dictionaries using little space). In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 349–361. Springer, Heidelberg (2006)
Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. of Comp. 23(4), 738–761 (1994)
Ferragina, P., Grossi, R.: The string B-tree: A new data structure for string search in external memory and its applications. JACM 46(2), 236–280 (1999)
Hon, W.-K., Lam, T.W., Shah, R., Tam, S.-L., Vitter, J.S.: Cache-oblivious index for approximate string matching. Theoretical Computer Science 412(29), 3579–3588 (2011)
Kukich, K.: Techniques for automatically correcting words in text. ACM Comp. Surv. 24(4), 377–439 (1992)
Navarro, G.: A guided tour to approximate string matching. ACM Comp. Surv. 33(1), 31–88 (2001)
Overmars, M.H.: The Design of Dynamic Data Structures. Springer (1987)
Tsur, D.: Fast index for approximate string matching. Journal of Discrete Algorithms 8(4), 339–345 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chung, CW., Tao, Y., Wang, W. (2014). I/O-Efficient Dictionary Search with One Edit Error. In: Moura, E., Crochemore, M. (eds) String Processing and Information Retrieval. SPIRE 2014. Lecture Notes in Computer Science, vol 8799. Springer, Cham. https://doi.org/10.1007/978-3-319-11918-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-11918-2_19
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11917-5
Online ISBN: 978-3-319-11918-2
eBook Packages: Computer ScienceComputer Science (R0)