D 2014

Text Processing Performance in Go Language

PITNER, Tomáš and Slavomír POLÁK

Basic information

Original name

Text Processing Performance in Go Language

Authors

PITNER, Tomáš ORCID (203 Czech Republic, guarantor, belonging to the institution) and Slavomír POLÁK (703 Slovakia, belonging to the institution)

Edition

Ostrava, Proceedings of the 17 th International Conference on Information Technologyfor Practice 2014, p. 143-146, 4 pp. 2014

Publisher

Ostrava: VŠB - Technical University of Ostrava, Faculty ofEconomics

Other information

Language

English

Type of outcome

Proceedings paper

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Czech Republic

Confidentiality degree

is not subject to a state or trade secret

Publication form

printed version "print"

RIV identification code

RIV/00216224:14330/14:00078454

Organization unit

Faculty of Informatics

ISBN

978-80-248-3555-6

Keywords in English

Go language; string matching; Horspool algorithm;Boyer-Moor algorithm;Knuth-Morris-Pratt algorithm;concurrent programming
Changed: 18/1/2015 11:53, prof. RNDr. Tomáš Pitner, Ph.D.

Abstract

ORIG CZ

In the original language

Go programming language, introduced by Google represents a new promising platform for distributed enterprise computing. Reader will become familiar with some basics of Go programming language - syntax,declare of variables, arrays and slices, concurrent programming. Then, time complexity of string matching algorithms under different conditions in Go will be examined and evaluated.

In Czech

Go - programovací jazyk, který byl zaveden společností Google - představuje novou slibnou platformu pro distribuované podnikové nasazení. Čtenář se seznámí s některými základy Go programovacího jazyka - syntax, deklarace proměnných, polí a řezů, souběžné programování. Posléze bude prošetřena a vyhodnocena časová složitost řetězcových algoritmů za různých podmínek v Go.