Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization (Q5056141): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of a fringe heuristic for binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving time and space efficiency in generalized binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial match retrieval of multidimensional data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253975 / rank
 
Normal rank

Latest revision as of 03:06, 31 July 2024

scientific article; zbMATH DE number 7631657
Language Label Description Also known as
English
Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
scientific article; zbMATH DE number 7631657

    Statements

    Identifiers