Optimization of History Tree in 3DR-Tree Index Structure

Zhi Tong Zhang

doi:10.4028/www.scientific.net/AMM.347-350.2521

Paper Titles

A Method for Generating the Timetable of Double-Track Railway Line
p.2501

Design and Implementation of Distributed Crawler System for Opinion Mining
p.2506

Internet of Things Key Technologies and Architectures Research in Information Processing
p.2511

Methods of Predicting the Brain Activity Based on Noun
p.2516

Optimization of History Tree in 3DR-Tree Index Structure
p.2521

Two-Dimension Nonlinear Optimization Method for Parameter Inversion of Elliptic Equation
p.2524

A Novel Fingerprint Image Preprocessing Algorithm
p.2528

The Design and Implementation of Database on Library Management Information System
p.2533

The Page Flow Implements Business Logic in Web Applications
p.2536

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 347-350Optimization of History Tree in 3DR-Tree Index...

Optimization of History Tree in 3DR-Tree Index Structure

Abstract:

Many optimizations have been done to 3DR-tree index structure and many opinions have been proposed. Modification by splitting mechanism is one of them. There are two index trees in 3DR-tree index structure after modification: one is a history tree for past data storage and the other is an active tree for current data storage. In this article, optimization of history tree is firstly done and is proved theoretically. Then a correspondent insert algorithm is designed.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 347-350)

Pages:

2521-2523

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.347-350.2521

Citation:

Cite this paper

Online since:

August 2013

Authors:

Zhi Tong Zhang

Keywords:

3DR-tree, History Data Insert Algorithm, Index Structure, R-Tree Structure Model

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] PATEL J M, CHEN Y, CHALLA V P. STRIPES: An Efficient Index for Predicted Trajectories[C]. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Paris, France, 2007: 637-646.

Google Scholar

[2] GUTTMAN A. R-trees: A Dynamic Index Structure for Spatial Searching[C]. In: Proe. Of the ACMSIGMOD, Boston, MA ACMPress, 1984: 47-57.

Google Scholar

[3] TAO Y, PAPADIAS D. MV3R-tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries[C]. Proceedings of the 27th International Conference on Very Large Databases, San Francisco, 2001: 431-440.

Google Scholar

[4] PATEL J M, CHEN Y, CHALLA V P. STRIPES: An Efficient Index for Predicted Trajectories[C]. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Paris, France, 2007: 637-646.

Google Scholar

[5] PFOSER D, JENSEN C, THEODORIDIS Y. Novel Approaches in Query Processing for Moving Object Trajectories[C]. In Proceedings of 26th International Conference on Very Large Data Bases, Cairo, Egypt. 2000: 395-406.

Google Scholar

[6] TAO Y, PAPADIAS D, SUN J. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries[C]. In Proc. Of the Intl. Conf. On Vary Large Data Bases, VLDB, Rome, Italy, 2006: 431-440.

Google Scholar