نتایج جستجو برای: oppedisano r

تعداد نتایج: 446784  

2005
Ruben Shahoyan R. Averbeck S. Damjanovic A. De Falco A. Devaux A. Ferretti P. Parracho P. Sonderegger G. Usai

R. Arnaldi 10, R. Averbeck 9, K. Banicz 2,4, J. Castor 3, B. Chaurand 7, C. Cicalò 1, A. Colla 10, P. Cortese 10, S. Damjanovic 4, A. David 2,5, A. De Falco 1, A. Devaux 3, A. Drees 9, L. Ducroux 6, H. En’yo 8, A. Ferretti 10, M. Floris 1, P. Force 3, A. ,Förster 2, N. Guettet 2,3, A. Guichard 6, H. Gulkanian 11, J. Heuser 8, M. Keil 2,5, L. Kluberg 2,7, C. Lourenço 2, J. Lozano 5, F. Manso 3, ...

2005
Carlos Lourenço R. Averbeck S. Damjanovic A. De Falco A. Devaux A. Ferretti P. Parracho P. Sonderegger G. Usai

R. Arnaldi 10, R. Averbeck 9, K. Banicz 2,4, J. Castor 3, B. Chaurand 7, C. Cicalò 1, A. Colla 10, P. Cortese 10, S. Damjanovic 4, A. David 2,5, A. De Falco 1, A. Devaux 3, A. Drees 9, L. Ducroux 6, H. En’yo 8, A. Ferretti 10, M. Floris 1, P. Force 3, A. Förster 2, N. Guettet 2,3, A. Guichard 6, H. Gulkanian 11, J. Heuser 8, M. Keil 2,5, L. Kluberg 2,7, J. Lozano 5, F. Manso 3, A. Masoni 1, P. ...

Journal: :IJIDS 2012
Majid Khojastehpour S. Kami Makki Bo Sun

1987
Timos K. Sellis Nick Roussopoulos Christos Faloutsos

The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data indexing. Second, a variation to Guttman’s R-trees (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree is introduced. Algorithms for searching, updating, initial packing and ...

Journal: :Tamkang Journal of Mathematics 1996

2007
W. A. Kirk

It is shown that for a metric space (M,d) the following are equivalent: (i) M is a complete R-tree; (ii) M is hyperconvex and has unique metric segments.

2013
Martin Sumak Peter Gurský

We present a new spatial index belonging to R-tree family. Since our new index comes out from the R-tree and holds the concept of nonoverlapping nodes we call it R-tree. The original R-tree was designed for both point and spatial data. Using R-tree for indexing spatial data is very inefficient. In our research we face the problem of indexing product catalogues data that can be represented as po...

Journal: :Data Knowl. Eng. 2004
Wonik Choi Bongki Moon Sukho Lee

R-tree based access methods for moving objects are hardly applicable in practice, due mainly to excessive space requirements and high management costs. To overcome the limitations of such R-tree based access methods, we propose a new index structure called AIM (Adaptive cell-based Index for Moving objects). The AIM is a cell-based multiversion access structure adopting an overlapping technique....

Journal: :JCP 2011
Aiguo Li Chi Zhang Jiulong Zhang Zhenhai Zhang

A new dynamic multi-dimensional index structure called RSR-tree is proposed, in which splitting operations of leaf nodes and non-leaf nodes are performed separatively. RSR-tree retains the sequence ordering of index records in a leaf node of RS-tree and thus reduces the addressing time cost of disk access while reading data files. In addition, it integrates the characteristic of reducing the ov...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید