Výsledky vyhledávání - "Full text index"

Analysis of the integration of the ElasticSearch search engine using the example of the e-Arhiv system of Pošta Slovenije

Autor: Marinšek, Boštjan

Publikováno v: Maribor

V magistrski nalogi smo preučili smotrnost integracije iskalnega pogona ElasticSearch v sistem e-Arhiv Pošte Slovenije, ki v obstoječi konfiguraciji uporablja iskalni pogon Microsoft SQL Server Full Text Search. V ta namen smo primerjali oba iskal

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1857::3d26f7c90b80cd24b7a7892a0ea3a856
https://dk.um.si/Dokument.php?id=132232&dn=

Zobrazit plný text záznamu

Space-Efficient Substring Occurrence Estimation

Autor: Rossano Venturini, Alessio Orlandi

Publikováno v: Algorithmica 74 (2016): 65–90. doi:10.1007/s00453-014-9936-y
30th symposium on Principles of Database Systems of Data, PODS 2011, pp. 95–106, Athens, Greece, 12-16 June 2011
PODS
info:cnr-pdr/source/autori:Orlandi A.; Venturini R./titolo:Space-Efficient Substring Occurrence Estimation/doi:10.1007%2Fs00453-014-9936-y/rivista:Algorithmica/anno:2016/pagina_da:65/pagina_a:90/intervallo_pagine:65–90/volume:74
info:cnr-pdr/source/autori:Orlandi, Alessio ; Venturini, Rossano/congresso_nome:30th symposium on Principles of Database Systems of Data, PODS 2011/congresso_luogo:Athens, Greece/congresso_data:12-16 June 2011/anno:2011/pagina_da:95/pagina_a:106/intervallo_pagine:95–106

In this paper we study the problem of estimating the number of occurrences of substrings in textual data: A text $$T$$T on some alphabet $$\varSigma =[\sigma ]$$Σ=[?] of length $$n$$n is preprocessed and an index $${\mathcal {I}}$$I is built. The in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16cd6e40335b2444cb96d3470c4507e6
https://openportal.isti.cnr.it/doc?id=people______::451bdcd17ae419919a10832ca4aa6976

Zobrazit plný text záznamu

TagTick: A tool for annotation tagging over solr indexes

Autor: Michele Artini, Claudio Atzori, Alessia Bardi, Sandro La Bruzzo, Paolo Manghi

Publikováno v: JCDL 2014-2014 IEEE/ACM Joint Conference on Digital Libraries, pp. 407–408, London, 8-12 September 2014
info:cnr-pdr/source/autori:Artini M.; Atzori C.; Bardi A.; La Bruzzo S.; Manghi P./congresso_nome:JCDL 2014-2014 IEEE%2FACM Joint Conference on Digital Libraries/congresso_luogo:London/congresso_data:8-12 September 2014/anno:2014/pagina_da:407/pagina_a:408/intervallo_pagine:407–408

"Annotation tagging" is an important curation action per- formed by authorized data curators willing to classify ac- cording to a common vocabulary an Information Space of potentially heterogeneous objects (e.g. not sharing common classification sche

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63c4227f7cdddcd3c94cee5b8abae7b
https://doi.org/10.1109/jcdl.2014.6970198

Zobrazit plný text záznamu

Indices and Applications in High-Throughput Sequencing

Autor: Weese, David

Recent advances in sequencing technology allow to produce billions of base pairs per day in the form of reads of length 100 bp an longer and current developments promise the personal $1,000 genome in a couple of years. The analysis of these unprecede

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______4732::fce1dfc6b995e586b00a830ce67dd641
https://refubium.fu-berlin.de/handle/fub188/7664

Zobrazit plný text záznamu

The rightmost equal-cost position problem

Autor: Alessio Langiu, Filippo Mignosi, Maxime Crochemore

Publikováno v: DCC

LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). For a given factor, the smallest is the offset, the smallest is the resu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5fef04a934c9515ddeb34c631247e1d
http://hdl.handle.net/11697/30121

Zobrazit plný text záznamu

Dissertation/ Thesis

Suffix trees for very large inputs

Autor: Barsky, Marina

A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suff

Externí odkaz: http://hdl.handle.net/1828/2901

Zobrazit plný text záznamu

Suffix arrays in theory and practice

Autor: Schürmann, Klaus-Bernd

The suffix array of a string is a permutation of all starting positions of the string's suffixes in lexicographical order. In this thesis, we investigate mathematical and algorithmical aspects of suffix arrays. The first part mainly deals with combin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2294::e4a52f5431c1e8a1ff42c4a2ec5d499a
https://pub.uni-bielefeld.de/record/2303359

Zobrazit plný text záznamu

Using Bitmap Indexing Technology for Combined Numerical and Text Queries

Autor: Stockinger, Kurt, Cieslewicz, John, Wu, Kesheng, Rotem, Doron, Shoshani, Arie

Publikováno v: Stockinger, Kurt; Cieslewicz, John; Wu, Kesheng; Rotem, Doron; & Shoshani, Arie. (2006). Using Bitmap Indexing Technology for Combined Numerical and Text Queries. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/4bz4v90b

In this paper, we describe a strategy of using compressed bitmap indices to speed up queries on both numerical data and text documents. By using an efficient compression algorithm, these compressed bitmap indices are compact even for indices with mil

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______325::d952c3542686a2e9ed6c1e11a4090be6
http://www.escholarship.org/uc/item/4bz4v90b

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání