The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces
|
Author(s): Ratko Orlandic (Illinois Institute of Technology, USA)and Byunggu Yu (University of Wyoming, USA)
Copyright: 2004
Volume: 15
Issue: 3
Pages: 15
Source title:
Journal of Database Management (JDM)
Editor(s)-in-Chief: Keng Siau (City University of Hong Kong, Hong Kong SAR)
DOI: 10.4018/jdm.2004070103
Purchase
|
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.
Related Content
Pasi Raatikainen, Samuli Pekkola, Maria Mäkelä.
© 2024.
30 pages.
|
Zhongliang Li, Yaofeng Tu, Zongmin Ma.
© 2024.
25 pages.
|
Jizi Li, Xiaodie Wang, Justin Z. Zhang, Longyu Li.
© 2024.
34 pages.
|
Lavlin Agrawal, Pavankumar Mulgund, Raj Sharman.
© 2024.
37 pages.
|
Ruizhe Ma, Weiwei Zhou, Zongmin Ma.
© 2024.
21 pages.
|
Zongmin Ma, Daiyi Li, Jiawen Lu, Ruizhe Ma, Li Yan.
© 2024.
32 pages.
|
Amit Singh, Jay Prakash, Gaurav Kumar, Praphula Kumar Jain, Loknath Sai Ambati.
© 2024.
25 pages.
|
|
|