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

Range searching in multidimensional databases using navigation metadata

Author

Listed:
  • Arnas, David
  • Rodríguez, Marcos

Abstract

This work presents a new range searching algorithm for multidimensional databases. The proposed methodology is based on the idea of generating a navigation metadata structure, complementary to the database, that eases the navigation between the elements of the database. This metadata structure can be adapted to different problems and it is generated in a one time pre-procesing effort for each database. This work contains a complete description of the algorithm, including a study of its searching performance under different conditions compared with a brute force approach.

Suggested Citation

  • Arnas, David & Rodríguez, Marcos, 2020. "Range searching in multidimensional databases using navigation metadata," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    • Handle: RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304689
    DOI: 10.1016/j.amc.2020.125510
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320304689
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125510?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 & 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).
    Full references (including those not matched with items on IDEAS)

    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.

      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:386:y:2020:i:c:s0096300320304689. 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.