Fechar
Metadados

@Article{FialhoMort:2017:NoLiKv,
               author = "Fialho, M{\'a}rcio Afonso Arimura and Mortari, Daniele",
          affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and {Texas A 
                         \& M University}",
                title = "Non linear k-vector",
              journal = "Advances in the Astronautical Sciences",
                 year = "2017",
               volume = "160",
                pages = "2989--3006",
                 note = "27th AAS/AIAA Space Flight Mechanics Meeting, 2017; San Antonio; 
                         United States; 05-09 Feb. 2017.",
             abstract = "The k-vector search technique is a general purpose search method 
                         that is capable of locating entries in a sorted array with 
                         complexity independent from the database size. It is based on an 
                         m-long vector of integers, called the k-vector, that keeps record 
                         of the sorted database nonlinearities. The traditional k-vector 
                         best performs for almost linear sorted databases. In this paper we 
                         extend the k-vector technique by the use of non-linear mapping 
                         functions, and show how this approach can potentially solve 
                         performance and memory limitations of the traditional k-vector for 
                         searches in arrays with strongly non-uniform distributions.",
                 issn = "0065-3438.",
             language = "en",
        urlaccessdate = "03 dez. 2020"
}


Fechar