Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1 2*
Department of Computer Science and Engineering,
Manonmaniunm Sundaranar University, Thirunelveli, Tamilnadu, 627012, India.
2
Department of Computer Science and Engineering,
Pondicherry Engineering College, Puducherry, 605014, India
* Corresponding authors Email: johnmtech@gmail.com
Abstract: Indexing methods are developed to effectively process user queries in many real-time and moving object
management applications. The existing spatial data updating indexing methods are based on the Integrated binary Tree,
R-Tree, R*-Tree, Oct-Tree, Quad-Tree, Grid-Tree and Hex-Tree. The depth of these trees is unbalanced and
overlapping, hence the performance is reduced in the multi-structure indexing methods. D-Tree (Decompose - Tree)
based multi-structure spatio-temporal index method is proposed to find the present, past and future data. The new multi-
structural model called DTNH-Tree used to find the present, past and future data. It consists of D-Tree, TB*-Tree, NT-
Tree and hash table. The D-Tree indexing is used to get the spatial data and manage the moving objects in the road
network. A set of TB*-Tree is used to index the history of moving object on road networks. A set of NT Trees is used
to manage the current position of the recently updated data and find present data of the moving objects. NT-Tree indexes
the present and future information of the moving objects. Finally the set of hash tables is used for updating the data
continuously. The proposed multi-structure indexing method supports different types of query processing compared to
the existing indexing methods. Experimental results exhibits better updation and query performance compared to the
MSMON-Tree and PPF*-Tree.
Keywords: Spatio-temporal data, Indexing methods, Query processing.
International Journal of Intelligent Engineering and Systems, Vol.10, No.3, 2017 DOI: 10.22266/ijies2017.0630.48
Received: March 19, 2017 428
In the moving object data representation, network Insertions of the moving objects are happening
model is necessarily one. The proposed network with the help of Hash Tables (HT). P, R, S and O
model represented as in term of routes, junctions and information are located and then inserted to hash
roads (i.e) network G = (P, R), where P = {P1..Pn} table structure. The spatial information and temporal
is a set of junction, R is the route and A, B, C, D is data [ID, T, S, A] are inserted into the leaf node of the
the points and S1, S2, S3 is the segment between two hash table structure. The coming objected are inserted
points. The A and B is the starting and ending point into TB*-Tree with the help of hash table structure.
between the junctions. The sequence of road segment The present moving objects are moving from a hash
in the continuous network has shown in the Figure 3. table to NT-Tree. All this hash table and NT-Tree and
TB*-Tree are implemented with the help of the
3.2 Structure Pointer. The after insertion of hash table from the NT-
Tree and TB*-Tree data are moved to D-Compose
The proposed multi- model structure is called Tree. With the help of D-Tree data overlapping are
DTNH Tree shown in the figure 4. This is a multi avoided.
model structure consists of D-Tree (D-Compose
Tree), TB*-Tree (Trajectories Bundle Tree), NT- ALGORITHM 1. Insert [ID, T, S, A]
Tree (Networks -Limited TPR-Tree), and hash table. /* input: P, R, S and O information inserted into
D-Tree is used to answer the spatial information such the hash table and S1 and S1 starting and ending point
as geometric information (i.e) Road information, data of Road segments */
transformation, actual time and spatial location of 1. Get Route (R) information and moving
moving objects noted directly. In D-Tree spatial Object (O) are inserted
information noted directly so time complexity is 2. Invoke hash table
reduced, so performance automatically increased. 3. If (hash table, Object > 0) objects are
TB*-Tree used to find trajectories of moving objects inserted
and the NT-Tree is used to find the present and future 4. Else Hash table is empty
position of moving objects. Hash Tables are used for 5. Check time duration then
updation purpose. The Hash tables are connected 6. If any objects are find then insert
each tree node so it is easily updates the data. 7. Otherwise
The proposed DTNH-Tree indexing has three END Insert.
parts. The first part is Decompose Tree (D-Tree). The
D-Tree is a space partitioning method for accessing
moving object data. In this part all the spatial points
International Journal of Intelligent Engineering and Systems, Vol.10, No.3, 2017 DOI: 10.22266/ijies2017.0630.48
Received: March 19, 2017 430
Predictive Query
International Journal of Intelligent Engineering and Systems, Vol.10, No.3, 2017 DOI: 10.22266/ijies2017.0630.48
Received: March 19, 2017 432
Data are generated 0 to 1000 and different query [1] M. Mokbel, T. Ghanem, and W. G. Aref,
ranges are taken for checking query efficiency and Spatio-temporal access methods, IEEE Data
cost comparison. The query efficiency and cost Eng. Bull., Vol.26, No.2, pp. 4049, 2003.
comparisons are compared with previous indexing [2] L.V. Nguyen-Dinh, W. G. Aref, and M. F.
methods Shown in the Figure 6 and Figure 7. The Mokbel, Spatio-temporal access methods: Part
query performance is increased because R-Tree is 2 (2003 - 2010), IEEE Data Eng. Bull., Vol.33,
avoided and overlapping also avoided. The query No.2, pp. 46-55, 2010.
range is divided into segment wise so performance is [3] X. Xu, J. Han, and W. Lu, RT-tree: an
increased because within time search particular improved r-tree indexing structure for temporal
segments. The Query range segment are often very spatial databases, In: Proc. of the International
large the search time is also increased in MSMON- Symposium on Spatial Data Handling, SDH,
Tree [32] and PPFN*-Tree [33]. Here it is avoided pp.10401049, 1990.
because no overlapping. Trajectory data are updated [4] Y. Theodoridis, M. Vazirgiannis, and T. Sellis,
with help of TB*- Tree and the query performance is Spatio-temporal indexing for large multimedia
increased because each segment spatial data are applications, In: Proc. of the IEEE Conference
updated with the help of the D-Tee and the trajectory on Multimedia Computing and Systems, ICMCS,
query performance shown in the Figure 8. 1996.
[5] D. Pfoser, C. S. Jensen, and Y. Theodoridis,
5. Conclusion Novel approaches in query processing for
moving object trajectories, In: Proc. of the
DTNH structure was proposed to index the
International Conf. on Very Large Data Bases,
moving objects prediction in the past, present and VLDB, pp.395406, 2000.
future positions The existing spatial data updating [6] P. Zhou, D. Zhang, B. Salzberg, G. Cooperman,
indexing methods are based on the integrated binary and G. Kollios, Close pair queries in moving
Tree, R-Tree, R*-Tree, Oct-Tree, Quad-Tree, Grid- object databases, In: Proc. of the GIS, pp.211,
Tree and Hex-Tree. The depth of these trees is 2005.
unbalanced and overlapping, hence the performance [7] E. Frentzos, Indexing objects moving on fixed
networks, In: Proc. of the SSTD, pp.289305,
is reduced in the multi-structure indexing methods.
2003.
DTNH multi-structure spatio-temporal index method [8] V. T. De Almeida and R. H. Gunting, Indexing
is proposed to find the present, past and future data. the trajectories of moving objects in networks,
DTNH index method manages past, present and Geoinformatica, Vol. 9, No.1, pp.3360, 2005.
future data and it predicts the data in different [9] M. Nascimento and J. Suva, "Towards historical
position and time. This proposed multi-structure rtrees", In: Proc. of the ACM Symposium on
Applied Computing (ACM-SAC), pp. 235-240,
indexing method supports different types of query
1998.
processing compared to the existing indexing [10] Y. Tao and D. Papadias, "Efficient historical r-
methods. Experimental results exhibits better trees," In: Proc. of the 13th IEEE Conference on
updation and query performance compared to the Scientific and Statistical Database Management
MSMON-Tree and PPF*-Tree. DTNH index method (SSDBM), pp. 223 -232, 2001.
supports better query range in compared to MSMON [11] Y. Tao and D. Papadias, "MV3R-tree: a spatio-
and PPFN*. The DTHN Tree base Tree Having D - temporal access method for timestamp and
interval queries", In: Proc. of the 27th
Tree it is used to avoid overlapping of data, so
International Conference on Very Large Data
performance of the index method is increased and Bases, pp.431-440, 2001.
time complexity also decreased. The performance of [12] D. Pfoser, C. S. Jensen, and Y. Theodoridis,
the query is compared to the previous indexing "Novel approaches in query processing for
methods it shown better performance in number of moving object trajectories", In: Proc. of the 26th
queries supporting over previous indexing methods. International Conf on Very Large Data Bases,
The further research includes different direction of pp.395-406, 2000.
[13] V. P. Chakka, A. Everspaugh, and J. M. Patel,
moving objects updation and predictions of data in
"Indexing large trajectory data sets with SETI",
different time interval are considered.
International Journal of Intelligent Engineering and Systems, Vol.10, No.3, 2017 DOI: 10.22266/ijies2017.0630.48
Received: March 19, 2017 433
In: Proc. of the Conf on Innovative Data Systems [26] Y. Fang, J. Cao, Y. Peng, and L. Wang,
Research, CIDR, 2003. "Indexing the past, present and future positions
[14] Z. Song and N. Roussopoulos, "SEB-tree: an of moving objects on fixed networks, In: Proc.
approach to index continuously moving objects", of the International Conf on Computer Science
Mobile Data Management, MDM, pp. 340344, and Software Engineering, pp. 524-527, 2008.
2003. [27] D. Pfoser, Indexing the trajectories of moving
[15] J. Tayeb, O. Ulusoy, and O. Wolfson, "A quad objects, IEEE Data Engineering Bulletin Vol.
tree-based dynamic attribute indexing method", 25, No. 2, pp. 29, 2002.
The Computer Journal, Vol. 41, No. 3, pp. 185 [28] Z. He, C. Wu, G. Liu, Z. Zheng, and Y. Tian,
200, 1998. Decomposition tree: a spatio-temporal
[16] S. Saltenis, C. S. Jensen, S. T. Leutenegger, and indexing method for movement big data,
M. A. Lopez, "Indexing the positions of Journal Cluster Computing, Vol. 18, No. 4,
continuously moving objects", In: Proc. of the pp.1481 -1492, 2015.
ACM International Conf. on Management of [29] I. Sasikala, M. Ganesan, and A. John, Uncertain
Data, SIGMOD, pp. 331342, 2000. data prediction on dynamic road network, In:
[17] Y. Tao, D. Papadias, and J. Sun, "The TPR*- Proc. International Conf on Information
tree: an optimized spatio-temporal access Communication and Embedded Systems
method for predictive queries", In: Proc. of the (ICICES), 2014.
International Conf. On Very Large Data Bases, [30] Y. Zheng, A fast index method for moving
VLDB, 2003. objects on full temporal query, In: Proc. of the
[18] X. Xiong, M. Mokbel, and W. G. Aref, 3rd International Conf on computer Research
"LUGrid: update-tolerant grid-based indexing and Development (ICCRD), 2011.
for moving objects", In: Proc. of the MDM, pp. [31] Y. Fang, J. Cao, J. Wang, Y. Peng, and W. Song,
13, 2006. "HTPR*-tree: an efficient index for moving
[19] Y. N. Silva, X. Xiong, and W. G. Aref, "The objects to support predictive query and partial
RUM-tree: supporting frequent updates in r- history query", Web-Age Information
trees using memos", VLDB J., Vol. 18, No. 3, pp. Management Lecture Notes in Computer
719738, 2009. Science, Vol. 7142, pp. 26-39, 2012.
[20] K.S. Kim, S.W. Kim, T.W. Kim, and K.-J. Li, [32] Z. Zhu, Q. Yang, and D. Pi, "Past, current and
"Fast indexing and updating method for moving future positions index of moving objects in
objects on road networks", Web Information networks future", Control and Automation
Systems Engineering Workshops, pp. 3442, Lecture Notes in Electrical Engineering, Vol.
2003. 172, pp. 335-342, 2012.
[21] M. Pelanis, S. altenis, C.S. Jensen, "Indexing [33] Y. Fang, J. Cao, Y. Peng, N. Chen, and L.
the past, present, and anticipated future positions Liu, "Efficient indexing of the past, present and
of moving objects", ACM Transactions on future positions of moving objects on road
Database Systems (TODS), Vol. 31, No. 1, pp. network", Web-Age Information Management
255-298, 2006. Lecture Notes in Computer Science, Vol. 7901,
[22] Z.H. Liu, X.L. Liu, J.W. Ge, and H.Y. Bae, pp. 223-235, 2013.
Indexing large moving objects from past to [34] T.C. Segar and R. Vijayaragavan, Pell's RSA
future with PCFI+-index", In: Proc. of the key generation and its security analysis, In:
COMAD, pp. 131137, 2005. Proc. of the Computing, Communications and
[23] D. Lin, C. Jensen, B. Ooi, and S. Saltenis, Networking Technologies (ICCCNT), pp. 1-5,
"Efficient indexing of the historical, present, and 2013.
future positions of moving objects", In: Proc. of [35] C. Thirumalai, Physicians drug encoding
the MDM, pp. 5966, 2005. system using an efficient and secured linear
[24] Z. Ding, "UTR-tree: an index structure for the public key cryptosystem (ESLPKC),
full uncertain trajectories of network- International journal of pharmacy and
constrained moving objects", In: Proc. of the technology, Vol. 8, No. 3, pp. 16296-16303,
MDM, pp. 3340, 2008. 2016.
[25] H.Lin, "Indexing the trajectories of moving [36] C. Thirumalai, and S. Shanmugam, Multi-key
objects", In: Proc. of the International Multi distribution scheme using Diophantine form for
Conf. of Engrs. and Computer Scientists, pp. secure IoT communications, In: Proc. of the
732737, 2009. IEEE IPACT, 2017.
International Journal of Intelligent Engineering and Systems, Vol.10, No.3, 2017 DOI: 10.22266/ijies2017.0630.48
Received: March 19, 2017 434
International Journal of Intelligent Engineering and Systems, Vol.10, No.3, 2017 DOI: 10.22266/ijies2017.0630.48