INVESTIGATION OF METHODS AND ALGORITHMS OF MOVING OBJECT HASHING
Authors:
1.
Bryanskiy gosudarstvennyy tehnicheskiy universitet
(docent)
2.
Bryanskiy gosudarstvennyy tehnicheskiy universitet
(docent)
Type:
Article
Pages:
from 133
to 143
Status:
Published
Received:
02.03.2017
Accepted:
02.03.2017
Published:
02.03.2017
Language:
Russian
Keywords:
spatial-temporal objects, indexing, trees, hashing
Abstract (English):
The paper deals with the study of one of the urgent problems of real time applications in which objects have spatial and temporal dependences. With the development of wireless communication and position-ing technologies the problem of storage in a database and indexing a large quantity of moving objects becomes urgent. In this paper there is offered an idea based on the method of hashing allowing the consider-able decrease of the quantity of database updates and the fulfillment of an indexing procedure possible. The paper reports the following basic approaches to the solution of the problem mentioned: a hashing; LP-layer; a division of space into blocks; coverings be-tween blocks; the use of a dynamic update of blocks, and also combinations of approaches. In order to draw conclusions of efficiency of hash-functions offered there was carried out a work on the experimental assessment of methods mentioned. The results of the comparison of methods are presented according to different criteria: productivity, a quantity of database updates, amount of disk memory pages used. The conclusions and recommendations for use are formulated.
The paper deals with the study of one of the urgent problems of real time applications in which objects have spatial and temporal dependences. With the development of wireless communication and position-ing technologies the problem of storage in a database and indexing a large quantity of moving objects becomes urgent. In this paper there is offered an idea based on the method of hashing allowing the consider-able decrease of the quantity of database updates and the fulfillment of an indexing procedure possible. The paper reports the following basic approaches to the solution of the problem mentioned: a hashing; LP-layer; a division of space into blocks; coverings be-tween blocks; the use of a dynamic update of blocks, and also combinations of approaches. In order to draw conclusions of efficiency of hash-functions offered there was carried out a work on the experimental assessment of methods mentioned. The results of the comparison of methods are presented according to different criteria: productivity, a quantity of database updates, amount of disk memory pages used. The conclusions and recommendations for use are formulated.
Keywords:
spatial-temporal objects, indexing, trees, hashing
spatial-temporal objects, indexing, trees, hashing
1. Gulakov, V.К. Introduction into Hashing: mono-graph / V.К.Gulakov, К.V.Gulakov. - Bryansk: BSTU, 2011. - pp. 129.
2. Gulakov, V.К. Spatial-Temporal Structure of Data / V.К.Gulakov, Е.О.Trubakov, А.О.Trubakov. - Bryansk: BSTU, 2013. - pp. 214.
3. Nascimento, М.А. Evaluation of Access Structures for Discretely Moving Points Intl. Workshop on Spatio-Temporal Database Management / M.A.Nascimento, J.R.Silva, Y.Theodoridi. - Edin-burgh, UK, 2002.
4. Song, Z. Hashing moving objects / Z.Song, N.Roussopoulos; Department of Computer Science University of Maryland College Park. - 2004.
