A high-speed dynamic full-text search method by using memory management (Q4652853): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160412331296643 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051274892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate string-matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the balance property of Patricia tries: External path length viewpoint / rank
 
Normal rank

Latest revision as of 18:10, 7 June 2024

scientific article; zbMATH DE number 2139498
Language Label Description Also known as
English
A high-speed dynamic full-text search method by using memory management
scientific article; zbMATH DE number 2139498

    Statements

    A high-speed dynamic full-text search method by using memory management (English)
    0 references
    28 February 2005
    0 references
    Full-text search
    0 references
    Inverted file search
    0 references
    Uni-gram index
    0 references
    Bi-gram index
    0 references
    Adaptive block management
    0 references

    Identifiers