SP-GiST: An Extensible Database Index for Supporting Space Partitioning

Get BibTex-formatted data

Download

PDF

Author

WG Aref, IF Ilyas

Entry type

article

Abstract

Emerging database applications require the use of new indexing structures beyond B-trees and R-trees. Examples are the k-D tree, the trie, the quadtree, and their variants. They are often proposed as supporting structures in data mining, GIS, and CAD/CAM applications. A common feature of all these indexes is that they recursively divide the space into partitions. A new extensible index structure, termed SP-GiST is presented that supports this class of data structures, mainly the class of space partitioning unbalanced trees. Simple method implementations are provided that demonstrate how SP-GiST can behave as a k-D tree, a trie, a quadtree, or any of their variants. Issues related to clustering tree nodes into pages as well as concurrency control for SP-GiST are addressed. A dynamic minimum-height clustering technique is applied to minimize disk accesses and to make using such trees in database systems possible and efficient. A prototype implementation of SP-GiST is presented as well as performance studies of the various SP-GiST''s tuning parameters.

Download

PDF

Date

2001 – 12

Journal

Journal of Intelligent Information Systems

Key alpha

Aref

Number

2-3

Pages

215-240

Publisher

Springer Netherlands

Volume

Publication Date

2001-12-01

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Aref,
	title = " SP-GiST: An Extensible Database Index for Supporting Space Partitioning",
	author = "WG Aref, IF Ilyas",
	year = "2001",
	month = "12",
	journal = "Journal of Intelligent Information Systems",
	number = "2-3",
	pages = "215-240",
	publisher = "Springer Netherlands",
	volume = "17",
	abstract = "Emerging database applications require the use of new indexing structures beyond B-trees and R-trees. Examples are the k-D tree, the trie, the quadtree, and their variants. They are often proposed as supporting structures in data mining, GIS, and CAD/CAM applications. A common feature of all these indexes is that they recursively divide the space into partitions. A new extensible index structure, termed SP-GiST is presented that supports this class of data structures, mainly the class of space partitioning unbalanced trees. Simple method implementations are provided that demonstrate how SP-GiST can behave as a k-D tree, a trie, a quadtree, or any of their variants. Issues related to clustering tree nodes into pages as well as concurrency control for SP-GiST are addressed. A dynamic minimum-height clustering technique is applied to minimize disk accesses and to make using such trees in database systems possible and efficient. A prototype implementation of SP-GiST is presented as well as performance studies of the various SP-GiST''s tuning parameters.",
}