Skip to main content
SpringerLink
Log in

Full-Fledged Real-Time Indexing for Constant Size Alphabets

  • Conference paper
Automata, Languages, and Programming (ICALP 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7965))

Included in the following conference series:

Abstract

In this paper we describe a data structure that supports pattern matching queries on a dynamically arriving text over an alphabet of constant size. Each new symbol can be prepended to T in O(1) expected worst-case time. At any moment, we can report all occurrences of a pattern P in the current text in O(|P| + k) time, where |P| is the length of P and k is the number of occurrences. This resolves, under assumption of constant size alphabet, a long-standing open problem of existence of a real-time indexing method for string matching (see [2]).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Amir, A., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Towards real-time suffix tree construction. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 67–78. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Amir, A., Nor, I.: Real-time indexing over fixed finite alphabets. In: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1086–1095 (2008)

    Google Scholar 

  3. Breslauer, D., Grossi, R., Mignosi, F.: Simple real-time constant-space string matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 173–183. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Breslauer, D., Italiano, G.F.: Near real-time suffix tree construction via the fringe marked ancestor problem. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 156–167. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Franceschini, G., Grossi, R.: A General Technique for Managing Strings in Comparison-Driven Data Structures. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 606–617. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci. 48(3), 533–551 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Galil, Z.: String matching in real time. J. ACM 28(1), 134–149 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Giyora, Y., Kaplan, H.: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Transactions on Algorithms 5(3) (2009)

    Google Scholar 

  9. Kopelowitz, T.: On-line indexing for general alphabets via predecessor queries on subsets of an ordered list. In: Proc. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 283–292 (2012)

    Google Scholar 

  10. Kopelowitz, T., Lewenstein, M.: Dynamic weighted ancestors. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 565–574 (2007)

    Google Scholar 

  11. Kosaraju, S.R.: Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). In: Proc. 26th Annual ACM Symposium on Theory of Computing (STOC 1994), pp. 310–316. ACM (1994)

    Google Scholar 

  12. Kucherov, G., Nekrich, Y., Starikovskaya, T.: Cross-document pattern matching. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 196–207. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Mortensen, C.W.: Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 618–627 (2003)

    Google Scholar 

  14. Navarro, G., Nekrich, Y.: Top-k document retrieval in optimal time and linear space. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1066–1077 (2012)

    Google Scholar 

  15. Slisenko, A.: String-matching in real time: Some properties of the data structure. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 493–496. Springer, Heidelberg (1978)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Gaspard Monge, Université Paris-Est & CNRS, Marne-la-Vallée, Paris, France

    Gregory Kucherov

  2. Department of Computer Science, Ben-Gurion University of the Negev, Be’er Sheva, Israel

    Gregory Kucherov

  3. Department of Electrical Engineering & Computer Science, University of Kansas, USA

    Yakov Nekrich

Authors
  1. Gregory Kucherov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yakov Nekrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, Postboks 7803, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Faculty of Computing, University of Latvia, Raina bulv. 19, 1586, Riga, Latvia

    Rūsiņš Freivalds

  3. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Marta Kwiatkowska

  4. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, POB 26, 76100, Rehovot, Israel

    David Peleg

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kucherov, G., Nekrich, Y. (2013). Full-Fledged Real-Time Indexing for Constant Size Alphabets. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39206-1_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39205-4

  • Online ISBN: 978-3-642-39206-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation