Paper
5 October 1998 Data declustering for efficient range and similarity searching
Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi
Author Affiliations +
Proceedings Volume 3527, Multimedia Storage and Archiving Systems III; (1998) https://doi.org/10.1117/12.325834
Event: Photonics East (ISAM, VVDC, IEMB), 1998, Boston, MA, United States
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sunil Prabhakar, Divyakant Agrawal, and Amr El Abbadi "Data declustering for efficient range and similarity searching", Proc. SPIE 3527, Multimedia Storage and Archiving Systems III, (5 October 1998); https://doi.org/10.1117/12.325834
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital image processing

Image processing

Multimedia

Databases

Digital libraries

Electroluminescence

Binary data

Back to Top