Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces (Q2282287): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for high dimensional nearest neighbor search and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity estimation techniques from rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3223360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining fuzzy information from multiple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal aggregation algorithms for middleware. / rank
 
Normal rank
Property / cites work
 
Property / cites work: TJJE: an efficient algorithm for top-\(k\) join on massive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527027 / rank
 
Normal rank

Latest revision as of 09:55, 21 July 2024

scientific article
Language Label Description Also known as
English
Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces
scientific article

    Statements

    Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2020
    0 references
    0 references
    top-\(N\) query
    0 references
    \(n\)-dimensional normed space
    0 references
    relational database
    0 references
    ranking function
    0 references
    0 references