The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In distributed storage systems, locally repairable codes (LRCs) are introduced to realize low disk I/O and repair cost. In order to tolerate multiple node failures, the LRCs with (r, δ)-localitty are further proposed. Since hot data is not uncommon in a distributed storage system, both Zeh et al. and Kadhe et al. focus on the LRCs with multiple localities or unequal localities (ML-LRCs) recently,...
Recently linear codes with locality properties have attracted a lot of interest due to their desirable applications in distributed storage systems. An [n, k, d] linear code with (r, δ)-locality can enable the local recovery of a failed node in case of more than one node failures. In this paper, we study the theoretical bounds and constructions of linear codes with (r, δ)-locality for all code symbols...
With the rapid development of remote sensing and computer technologies, remote sensing image data obtained by satellite isincreasing dramatically [1]. The speed has exceeded one TB each day and will obviously increase in the future. How to manage it efficiently becomes a problem because traditional waysare expensive and difficultto extend. Hence, we need a scalable and parallel processing model. HBaseand...
In order to deal with the storage and query problems of massive vector spatial data, we design a vector spatial data model based on HBase. Then, a parallel method of building Hilbert R-tree index using MapReduce and packed Hilbert R-tree algorithm is proposed. In the end, the proposed vector spatial data model and the method of building Hilbert R-tree index in parallel are proven to be effective and...
Geospatial data is the core of spatial information system. It is always a research hotspot of how to realize the sharing and integration applications of distributed geospatial data. OGC has developed a number of web services specifications that enable the interoperation of heterogeneous geospatial data sources. Grid is the technology enabling resource sharing and coordinated problem solving in dynamic,...
The integration of services in heterogeneous, distributed grid environment is dynamic and diverse because of the disparate resources. Hence, this integration can be technically challenged due to the need of achieving various service when running on different platforms. So, in a grid environment, implementations of GIS (geographic information system) should not only concern their internal spatial characteristics,...
Recently, there has been a fast proliferation of applications creating geospatial data distributed somewhere that has to be processed, queried and analyzed efficiently. Consequently, there is a need for effective data processing technologies that are able to support such distributed query and analysis operations. The emergence of grid computing offers a well solution to accomplish this goal. Development...
The research on the sharing and interoperation of geospatial information is always a hotspot in GIS field. Many methods have been proposed such as data format transform, data direct access, Web GIS and data interoperation. These technologies have made great progresses in the sharing and interoperability of geospatial information. But there are many unconquerable problems such as the process of the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.