Share Email Print
cover

Proceedings Paper

Data declustering for efficient range and similarity searching
Author(s): Sunil Prabhakar; Divyakant Agrawal; Amr El Abbadi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Advances in processor and network technologies have catalyzed the growth of data intensive applications such as image repositories and digital libraries. The lack of commensurate improvements in storage systems have resulted in I/O becoming a major bottleneck in modern systems. The use of parallel I/O from multiple devices is a well known technique for improving I/O performance. A key factor in exploiting parallel I/O is knowledge of the access pattern-- the sets of data items that are likely to be accessed concurrently should be declustered across the disks. Range and nearest-neighbor (similarity) queries are the most important class of queries for multimedia databases. Declustering schemes tailored for improving the performance of range only or similarity only queries have been proposed in the literature. The problem of declustering for combined range and similarity queries has not been addressed in the literature.

Paper Details

Date Published: 5 October 1998
PDF: 12 pages
Proc. SPIE 3527, Multimedia Storage and Archiving Systems III, (5 October 1998); doi: 10.1117/12.325834
Show Author Affiliations
Sunil Prabhakar, Purdue Univ. (United States)
Divyakant Agrawal, Univ. of California/Santa Barbara (United States)
Amr El Abbadi, Univ. of California/Santa Barbara (United States)


Published in SPIE Proceedings Vol. 3527:
Multimedia Storage and Archiving Systems III
C.-C. Jay Kuo; Shih-Fu Chang; Sethuraman Panchanathan, Editor(s)

© SPIE. Terms of Use
Back to Top