IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v372y2020ics0096300319310021.html
   My bibliography  Save this article

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

Author

Listed:
  • Arnas, David
  • Leake, Carl
  • Mortari, Daniele

Abstract

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.

Suggested Citation

  • Arnas, David & Leake, Carl & Mortari, Daniele, 2020. "The n-dimensional k-vector and its application to orthogonal range searching," Applied Mathematics and Computation, Elsevier, vol. 372(C).
    • Handle: RePEc:eee:apmaco:v:372:y:2020:i:c:s0096300319310021
    DOI: 10.1016/j.amc.2019.125010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319310021
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.125010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Arnas, David & Mortari, Daniele, 2018. "Nonlinear function inversion using k-vector," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 754-768.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Arnas, David & Rodríguez, Marcos, 2020. "Range searching in multidimensional databases using navigation metadata," Applied Mathematics and Computation, Elsevier, vol. 386(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Daniele Tommasini & David N. Olivieri, 2020. "Fast Switch and Spline Function Inversion Algorithm with Multistep Optimization and k-Vector Search for Solving Kepler’s Equation in Celestial Mechanics," Mathematics, MDPI, vol. 8(11), pages 1-18, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:372:y:2020:i:c:s0096300319310021. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.