About: Efficient in-memory data structures for n-grams indexing     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • Indexing n-gram phrases from text has many practical applications. Plagiarism detection, comparison of DNA of sequence or spam detection. In this paper we describe several data structures like hash table or B+ tree that could store n-grams for searching. We perform tests that shows their advantages and disadvantages. One of neglected data structure for this purpose, ternary search tree, is deeply described and two performance improvements are proposed.
  • Indexing n-gram phrases from text has many practical applications. Plagiarism detection, comparison of DNA of sequence or spam detection. In this paper we describe several data structures like hash table or B+ tree that could store n-grams for searching. We perform tests that shows their advantages and disadvantages. One of neglected data structure for this purpose, ternary search tree, is deeply described and two performance improvements are proposed. (en)
Title
  • Efficient in-memory data structures for n-grams indexing
  • Efficient in-memory data structures for n-grams indexing (en)
skos:prefLabel
  • Efficient in-memory data structures for n-grams indexing
  • Efficient in-memory data structures for n-grams indexing (en)
skos:notation
  • RIV/61989100:27740/13:86088861!RIV14-MSM-27740___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 72074
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27740/13:86088861
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Ternary tree; N-gram; Hash table; B+ tree (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [D8FE0F4BCAF6]
http://linked.open...v/mistoKonaniAkce
  • Písek
http://linked.open...i/riv/mistoVydani
  • Aachen
http://linked.open...i/riv/nazevZdroje
  • CEUR Workshop Proceedings. Volume 971
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Platoš, Jan
  • Snášel, Václav
  • Robenek, Daniel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
issn
  • 1613-0073
number of pages
http://purl.org/ne...btex#hasPublisher
  • ceur-ws.org
https://schema.org/isbn
  • 978-80-248-2968-5
http://localhost/t...ganizacniJednotka
  • 27740
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software