Multi-method dispatching

A geometric approach with applications to string matching problems

Paolo Ferragina, Shanmugavelayutham Muthukrishnan, Mark de Berg

    Research output: Contribution to journalConference article

    Abstract

    Current object oriented programming languages (OOPLs) rely on mono-method dispatching. Recent research has identified multi-methods as a new, powerful feature to be added to OOPLs, and several experimental OOPLs now have multi-methods. Their ultimate success and impact in practice depends, among other things, on whether multi-method dispatching can be supported efficiently. We show that the multi-method dispatching problem can be transformed to a geometric problem on multi-dimensional integer grids, for which we then develop a data structure that uses near-linear space and has log-logarithmic query time. This gives a solution whose performance almost matches that of the best known algorithm for mono-method dispatching. Our geometric data structure has other applications as well, namely in two string matching problems: matching multiple rectangular patterns against a rectangular query text, and approximate dictionary matching with edit distance at most one. Our results for the former, long-standing open problem are substantially improved, near-linear time bounds. For the latter problem, which has applications in checking password security and the design of filtering tools, we obtain a near-linear solution as well.

    Original languageEnglish (US)
    Pages (from-to)483-491
    Number of pages9
    JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
    StatePublished - Jan 1 1999
    EventProceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA
    Duration: May 1 1999May 4 1999

    Fingerprint

    Object oriented programming
    Computer programming languages
    Data structures
    Glossaries

    ASJC Scopus subject areas

    • Software

    Cite this

    Multi-method dispatching : A geometric approach with applications to string matching problems. / Ferragina, Paolo; Muthukrishnan, Shanmugavelayutham; de Berg, Mark.

    In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 01.01.1999, p. 483-491.

    Research output: Contribution to journalConference article

    @article{1272750ca6514c6bbe43049130bc1aa4,
    title = "Multi-method dispatching: A geometric approach with applications to string matching problems",
    abstract = "Current object oriented programming languages (OOPLs) rely on mono-method dispatching. Recent research has identified multi-methods as a new, powerful feature to be added to OOPLs, and several experimental OOPLs now have multi-methods. Their ultimate success and impact in practice depends, among other things, on whether multi-method dispatching can be supported efficiently. We show that the multi-method dispatching problem can be transformed to a geometric problem on multi-dimensional integer grids, for which we then develop a data structure that uses near-linear space and has log-logarithmic query time. This gives a solution whose performance almost matches that of the best known algorithm for mono-method dispatching. Our geometric data structure has other applications as well, namely in two string matching problems: matching multiple rectangular patterns against a rectangular query text, and approximate dictionary matching with edit distance at most one. Our results for the former, long-standing open problem are substantially improved, near-linear time bounds. For the latter problem, which has applications in checking password security and the design of filtering tools, we obtain a near-linear solution as well.",
    author = "Paolo Ferragina and Shanmugavelayutham Muthukrishnan and {de Berg}, Mark",
    year = "1999",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "483--491",
    journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
    issn = "0734-9025",
    publisher = "Association for Computing Machinery (ACM)",

    }

    TY - JOUR

    T1 - Multi-method dispatching

    T2 - A geometric approach with applications to string matching problems

    AU - Ferragina, Paolo

    AU - Muthukrishnan, Shanmugavelayutham

    AU - de Berg, Mark

    PY - 1999/1/1

    Y1 - 1999/1/1

    N2 - Current object oriented programming languages (OOPLs) rely on mono-method dispatching. Recent research has identified multi-methods as a new, powerful feature to be added to OOPLs, and several experimental OOPLs now have multi-methods. Their ultimate success and impact in practice depends, among other things, on whether multi-method dispatching can be supported efficiently. We show that the multi-method dispatching problem can be transformed to a geometric problem on multi-dimensional integer grids, for which we then develop a data structure that uses near-linear space and has log-logarithmic query time. This gives a solution whose performance almost matches that of the best known algorithm for mono-method dispatching. Our geometric data structure has other applications as well, namely in two string matching problems: matching multiple rectangular patterns against a rectangular query text, and approximate dictionary matching with edit distance at most one. Our results for the former, long-standing open problem are substantially improved, near-linear time bounds. For the latter problem, which has applications in checking password security and the design of filtering tools, we obtain a near-linear solution as well.

    AB - Current object oriented programming languages (OOPLs) rely on mono-method dispatching. Recent research has identified multi-methods as a new, powerful feature to be added to OOPLs, and several experimental OOPLs now have multi-methods. Their ultimate success and impact in practice depends, among other things, on whether multi-method dispatching can be supported efficiently. We show that the multi-method dispatching problem can be transformed to a geometric problem on multi-dimensional integer grids, for which we then develop a data structure that uses near-linear space and has log-logarithmic query time. This gives a solution whose performance almost matches that of the best known algorithm for mono-method dispatching. Our geometric data structure has other applications as well, namely in two string matching problems: matching multiple rectangular patterns against a rectangular query text, and approximate dictionary matching with edit distance at most one. Our results for the former, long-standing open problem are substantially improved, near-linear time bounds. For the latter problem, which has applications in checking password security and the design of filtering tools, we obtain a near-linear solution as well.

    UR - http://www.scopus.com/inward/record.url?scp=0032662012&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032662012&partnerID=8YFLogxK

    M3 - Conference article

    SP - 483

    EP - 491

    JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

    JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

    SN - 0734-9025

    ER -