Exploiting distance coherence to speed up range queries in metric indexes (Q1041769): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103592863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some approaches to best-match file searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection techniques for proximity searching in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data Structure and an Algorithm for the Nearest Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfying general proximity/similarity queries with metric trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140435 / rank
 
Normal rank

Latest revision as of 06:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Exploiting distance coherence to speed up range queries in metric indexes
scientific article

    Statements

    Exploiting distance coherence to speed up range queries in metric indexes (English)
    0 references
    0 references
    4 December 2009
    0 references
    algorithms
    0 references
    data structures
    0 references
    information retrieval
    0 references
    metric space indexing
    0 references
    proximity searching
    0 references
    similar range queries
    0 references

    Identifiers