This paper presents a novel hierarchy data placement algorithm based on data geographic scope to distribute several petabytes of spatial data among tens or hundreds of thousands of devices. Specially, it uses Max-Min algorithm to classify the devices into some classes for different devices configuration. Then we propose a hashing algorithm based on SIEVE [1] and Linear Hashing [2] to assign data between classes and within a class with the geographic scope of data. ? 2013 IEEE.EI
Geographic Information Systems (GIS) are increasingly manag-ing very large sets of data and hence a ...
Services for locating mobile objects are often organized as a distributed search tree. The advantage...
© 1992-2012 IEEE. Hashing methods have been widely investigated for fast approximate nearest neighbo...
This paper presents a novel hierarchy data placement algorithm based on data geographic scope to dis...
Spatial data storage stresses the capability of conventional DBMSs. We present a scalable distribute...
Cloud computing platform can provide infinite storage capacity, computing ability as well as informa...
How to effectively organize and store the profile of moving objects in a mobile environment, which c...
This paper aims at the solution to problems of large amounts of data storage, low efficiency calcula...
As an important component of China’s transportation data sharing system, high-speed railway data sha...
Making effective use of the vast amounts of data gathered by largescale sensor networks will require...
The effectiveness of a distributed system hinges on the manner in which tasks and data are assigned ...
The global gridding schemes used for position representation on the surface of the Earth, also named...
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithm...
Spatial data is being produced at increasing rates from various sources such as mobile applications ...
Nowadays, high performance parallel computation is deemed as a good solution to the complicated proc...
Geographic Information Systems (GIS) are increasingly manag-ing very large sets of data and hence a ...
Services for locating mobile objects are often organized as a distributed search tree. The advantage...
© 1992-2012 IEEE. Hashing methods have been widely investigated for fast approximate nearest neighbo...
This paper presents a novel hierarchy data placement algorithm based on data geographic scope to dis...
Spatial data storage stresses the capability of conventional DBMSs. We present a scalable distribute...
Cloud computing platform can provide infinite storage capacity, computing ability as well as informa...
How to effectively organize and store the profile of moving objects in a mobile environment, which c...
This paper aims at the solution to problems of large amounts of data storage, low efficiency calcula...
As an important component of China’s transportation data sharing system, high-speed railway data sha...
Making effective use of the vast amounts of data gathered by largescale sensor networks will require...
The effectiveness of a distributed system hinges on the manner in which tasks and data are assigned ...
The global gridding schemes used for position representation on the surface of the Earth, also named...
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithm...
Spatial data is being produced at increasing rates from various sources such as mobile applications ...
Nowadays, high performance parallel computation is deemed as a good solution to the complicated proc...
Geographic Information Systems (GIS) are increasingly manag-ing very large sets of data and hence a ...
Services for locating mobile objects are often organized as a distributed search tree. The advantage...
© 1992-2012 IEEE. Hashing methods have been widely investigated for fast approximate nearest neighbo...