This paper presents and discusses a radically different approach to multi-dimensional indexing based on the concept of the space-filling curve. It reports the novel algorithms which had to be developed to create the first actual implementation of a system based on this approach, on some comparative performance tests, and on its actual use within the TriStarp Group at Birkbeck to provide a Triple Store repository. An important result that goes beyond this requirement, however, is that the performance improvement over the Grid File is greater the higher the dimension
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performa...
In this paper, we propose a new technique for multidimensional query processing which can be widely ...
Because of their locality preservation properties, Space-Filling Curves (SFC) have been widely used ...
Abstract. Efficiently accessing multidimensional data is a challenge for building modern database ap...
Given a query Q, a one-dimensional index structure I(e.g., B-tree), and a set of D dimensional point...
Mapping to one-dimensional values and then using a one-dimensional indexing method has been proposed...
For the application of space-??lling curves to the cre-ation of e??cient indexes on spatial objects,...
We present a new dynamic index structure for multidimensional data. The considered index structure i...
Efficient management of multidimensional data is a challenge when building modern database applicati...
Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in...
The goal of this work was to character the indexing structure VA-file and perform the huge variety o...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
Abstract. In this paper, we propose a new technique for multidimensional query processing which can ...
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes at...
Abstract:- An efficient algorithm for spatial databases, various approaches are delivered by the var...
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performa...
In this paper, we propose a new technique for multidimensional query processing which can be widely ...
Because of their locality preservation properties, Space-Filling Curves (SFC) have been widely used ...
Abstract. Efficiently accessing multidimensional data is a challenge for building modern database ap...
Given a query Q, a one-dimensional index structure I(e.g., B-tree), and a set of D dimensional point...
Mapping to one-dimensional values and then using a one-dimensional indexing method has been proposed...
For the application of space-??lling curves to the cre-ation of e??cient indexes on spatial objects,...
We present a new dynamic index structure for multidimensional data. The considered index structure i...
Efficient management of multidimensional data is a challenge when building modern database applicati...
Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in...
The goal of this work was to character the indexing structure VA-file and perform the huge variety o...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
Abstract. In this paper, we propose a new technique for multidimensional query processing which can ...
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes at...
Abstract:- An efficient algorithm for spatial databases, various approaches are delivered by the var...
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performa...
In this paper, we propose a new technique for multidimensional query processing which can be widely ...
Because of their locality preservation properties, Space-Filling Curves (SFC) have been widely used ...