A new enhancement to the R-tree node splitting

The performance of spatial queries depends mainly on the underlying index structure used to handle them. R-tree, a well-known spatial index structure, suffers largely from high overlap and high coverage resulting mainly from splitting the overflowed nodes. Assigning the remaining entries to the unde...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of information science Vol. 36; no. 1; pp. 3 - 18
Main Authors:	Al-Badarneh, Amer F., Yaseen, Qussai, Hmeidi, Ismail
Format:	Journal Article
Language:	English
Published:	London, England SAGE Publications 01.02.2010 Sage Publications Bowker-Saur Ltd
Subjects:	Algorithms Assignment Content analysis Exact sciences and technology Experiments Indexes Indexing. Classification. Abstracting Indexing. Classification. Abstracting. Syntheses Information and communication sciences Information and document structure and analysis Information processing and retrieval Information science. Documentation Online data bases Online information storage and retrieval Queries Query formulation Rectangles Rule ordering Sciences and techniques of general use Spatial data Splitting node splitting spatial database R-tree spatial indexing Database query Spatial indexation R tree Node method Spatial database
ISSN:	0165-5515, 1741-6485
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!