The n-dimensional k-vector and its application to orthogonal range searching

04/05/2020
by   David Arnas, et al.
0

This work focuses on the definition and study of the n-dimensional k-vector, an algorithm devised to perform orthogonal range searching in static databases with multiple dimensions. The methodology first finds the order in which to search the dimensions, and then, performs the search using a modified projection method. In order to determine the dimension order, the algorithm uses the k-vector, a range searching technique for one dimension that identifies the number of elements contained in the searching range. Then, using this information, the algorithm predicts and selects the best approach to deal with each dimension. The algorithm has a worst case complexity of O(nd(k/n)^2/d), where k is the number of elements retrieved, n is the number of elements in the database, and d is the number of dimensions of the database. This work includes a detailed description of the methodology as well as a study of the algorithm performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Depth-First Grover Search Algorithm on Hybrid Quantum-Classical Computer

We demonstrated the detailed construction of the hybrid quantum-classica...
research
02/04/2020

Separating Variables in Bivariate Polynomial Ideals

We present an algorithm which for any given ideal I⊆𝕂 [x,y] finds all el...
research
12/06/2017

A note on searching sorted unbalanced three-dimensional arrays

We examine the problem of searching sequentially for a desired real valu...
research
07/03/2019

Multi-dimensional interpolations in C++

A C++ software design is presented that can be used to interpolate data ...
research
05/03/2019

Range closest-pair search in higher dimensions

Range closest-pair (RCP) search is a range-search variant of the classic...
research
05/25/2021

Minmax-optimal list searching with O(log_2log_2 n) average cost

We find a searching method on ordered lists that surprisingly outperform...
research
06/24/2023

On the seeds and the great-grandchildren of a numerical semigroup

We present a revisit of the seeds algorithm to explore the semigroup tre...

Please sign up or login with your details

Forgot password? Click here to reset