Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper presents a vector data access method in memory, aimed at improve the I/O performance bottleneck in spatial data analysis. It uses memory copy instead of data interaction between disk and memory, as the memory copy operation is much faster than disk. It designs the vector spatial data model in memory as K-V structure, and presents the data access method between memory and SIC type. The experiment...
Vector map overlay is a core operation in the fields of spatial information processing. To meet the demand of overlay analysis with large scale vector data, this paper proposes a vector map overlay algorithm based on distributed task queue and designs a desirable task structure composed of geometries pair and a task assignment strategy based on spatial location. As well known, data access and load...
This paper concentrates on reducing the cost of I/O and improving algorithm efficiency by designing and realizing a spatial data access system based on main memory database (MMDB). We use Redis to manage vector spatial data in main memory which is faster than hard disk or disk-based database in respect of data access. We design a management strategy of spatial data, internal and external data exchange...
With the emergence of online geospatial applications such as WebGIS services, the large spatio-temporal data and numerous concurrent users have posed grand challenges on the state-of-the-art spatial databases due to their intolerable disk I/O latency. Hence, the clients cannot be served with real-time response. In this paper, we propose VegaCache, a distributed inmemory caching scheme, to provide...
The algorithm of line segment intersection is the core algorithm for vector map overlay. The traditional method is based on the plane-sweep process to find the intersections of two groups of lines. Although such method proves to be efficient in serial system, the basic data structure of this kind of algorithm needs to maintain a tree structure, which has the data-lock in multi-core system. In addition,...
In recent years, spatial applications have become more and more important in both scientific research and industry. Spatial query processing is the fundamental functioning component to support spatial applications. However, the state-of-the-art techniques of spatial query processing are facing significant challenges as the data expand and user accesses increase. In this paper we propose and implement...
During the past few years Special-purpose data mining systems have drawn great attraction in research and industry area for their application into real environments. In this paper, a new scalable spatial data mining architecture for POI(Points of Interest) datasets has been proposed on VegaGIS 3.0 platform to design and develop a professional spatial data mining system. Our research covers a wide...
In this paper we introduced a new R-tree node splitting algorithm. As an indexing technique for multi-dimensional data, R-tree is widely used in geographical information systems, CAD systems and spatial databases. An R-tree consists of nodes which in turn consist of records. Each node in R-tree must contain limited number of records in order that it can be stored within one disk block, thus a node...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.