Reference Hub6
Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces

Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces

Ratko Orlandic, Byunggu Yu
Copyright: © 2004 |Volume: 15 |Issue: 3 |Pages: 15
ISSN: 1063-8016|EISSN: 1533-8010|ISSN: 1063-8016|EISBN13: 9781615200573|EISSN: 1533-8010|DOI: 10.4018/jdm.2004070103
Cite Article Cite Article

MLA

Orlandic, Ratko, and Byunggu Yu. "Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces." JDM vol.15, no.3 2004: pp.45-59. http://doi.org/10.4018/jdm.2004070103

APA

Orlandic, R. & Yu, B. (2004). Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces. Journal of Database Management (JDM), 15(3), 45-59. http://doi.org/10.4018/jdm.2004070103

Chicago

Orlandic, Ratko, and Byunggu Yu. "Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces," Journal of Database Management (JDM) 15, no.3: 45-59. http://doi.org/10.4018/jdm.2004070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Many database applications require effective representation of regional objects in high-dimensional spaces. By applying an original query transformation, a recently proposed access method for regional data, called the simple QSF-tree (sQSF-tree), effectively attacks the limitations of traditional spatial access methods in spaces with many dimensions. Nevertheless, sQSF-trees are not immune to all problems associated with high data dimensionality. Based on the analysis of sQSF-trees, this paper presents a new variant of sQSF-trees, called the scalable QSF-tree (cQSF-tree), which relies on a heuristic optimization to reduce the number of false drops into pages that contain no object satisfying the query. By increasing the selectivity of search predicates, cQSF-trees improve the performance of multi-dimensional selections. Experimental evidence shows that cQSF-trees are more scalable than sQSF-trees to the growing data dimensionality. The performance improvements also increase with more skewed data distribution.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.