On the efficient indexing of ordered multidimensional tuples

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86077624" target="_blank" >RIV/61989100:27240/10:86077624 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5678117" target="_blank" >http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5678117</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On the efficient indexing of ordered multidimensional tuples

Popis výsledku v původním jazyce

Multidimensional data structures are applied in many areas, e.g. data mining, indexing multimedia data and text documents, and so on. Therefore many index data structures and algorithms have been proposed. These data structures provide efficient processing of many types of queries like point and range queries. There are some applications where the range query result must be ordered. A typical case is the result with tuples sorted according to values in one dimension defined by the ORDER BY clause of anSQL statement. If we use a common multidimensional data structure, the result set is sorted after the range query is processed. Since the sort operation must often be processed on tuples stored in the secondary storage, an external sorting algorithm mustbe utilized. Therefore, this operation is time consuming especially for a large result set. In this paper, we introduce a new data structure, a variant of the R-tree, supporting a storage of ordered tuples.

Název v anglickém jazyce

On the efficient indexing of ordered multidimensional tuples

Popis výsledku anglicky

Multidimensional data structures are applied in many areas, e.g. data mining, indexing multimedia data and text documents, and so on. Therefore many index data structures and algorithms have been proposed. These data structures provide efficient processing of many types of queries like point and range queries. There are some applications where the range query result must be ordered. A typical case is the result with tuples sorted according to values in one dimension defined by the ORDER BY clause of anSQL statement. If we use a common multidimensional data structure, the result set is sorted after the range query is processed. Since the sort operation must often be processed on tuples stored in the secondary storage, an external sorting algorithm mustbe utilized. Therefore, this operation is time consuming especially for a large result set. In this paper, we introduce a new data structure, a variant of the R-tree, supporting a storage of ordered tuples.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Zpracování XML dat v heterogenních a dynamických prostředích</a><br>

Návaznosti

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

Rok uplatnění

2010

Kód důvěrnosti údajů

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

Název statě ve sborníku

International Conference for Internet Technology and Secured Transactions (ICITST), 2010

ISBN

978-1-4244-8862-9

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1-8

Název nakladatele

IEEE

Místo vydání

Londýn

Místo konání akce

London, England

Datum konání akce

8. 11. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—