Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

43

ADBIS
1994
Springer

favoriteEmaildiscussreport

87views Database» more ADBIS 1994»

Variations of R-Tree Structure for Indexing of Spatial Objects

14 years 3 months ago

Variations of R-Tree Structure for Indexing of Spatial Objects

Download meta.math.spbu.ru

The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial objects and composite optimization criteria are proposed. The efficient algorithms, including one for spatial join operation, providing for optimize considered methods are described. The results of experimental measurements of different variations of R-trees and proposed methods are presented and compared.

M. G. Martynov

Real-time Traffic

ADBIS 1994 | Database | Large Spatial Objects | Methods Concerned Approximation | Spatial Objects |

claim paper

Related Content

» Efficient indexing structure for scalable processing of spatial alarms

» HighDimensional Similarity Joins

» Energy Efficient Index for Querying LocationDependent Data in Mobile Broadcast Environment...

» Distributed Sparse Spatial Selection Indexes

» Spatial Clustering of Structured Objects

» An Efficient Trajectory Index Structure for Moving Objects in LocationBased Services

» Declustering of Trajectories for Indexing of Moving Objects Databases

» A New Point Access Method Based on Wavelet Trees

» An Efficient Spatial Search Method Based on SGTree

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	ADBIS
Authors	M. G. Martynov

Comments (0)