All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A New Range Query Algorithm for Universal B-trees

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F05%3A00012184" target="_blank" >RIV/61989100:27240/05:00012184 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    A New Range Query Algorithm for Universal B-trees

  • Original language description

    In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in Universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm behaves efficiently, especially for high-dimensional databases.We explain the algorithm using a geometric model providing an intelligible insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quadtrees. We also present experimental results for the range query algorithm implementation

  • Czech name

    A New Range Query Algorithm for Universal B-trees

  • Czech description

    In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in Universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm behaves efficiently, especially for high-dimensional databases.We explain the algorithm using a geometric model providing an intelligible insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quadtrees. We also present experimental results for the range query algorithm implementation

Classification

  • Type

    A - Audiovisual production

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F03%2F0912" target="_blank" >GA201/03/0912: XML documents searching and indexing</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2005

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • ISBN

  • Place of publication

    Amsterdam

  • Publisher/client name

    Elsevier Amsterdam

  • Version

  • Carrier ID