|
FAST '04 — Abstract
Pp. 73-86 of the Proceedings
Diamond: A Storage Architecture for Early Discard in Interactive Search
Larry Huston, Intel Research Pittsburgh; Rahul Sukthankar, Carnegie Mellon
University; Rajiv Wickremesinghe, Intel Research Pittsburgh; M. Satyanarayanan and Gregory R. Ganger, Carnegie Mellon University; Erik Riedel, Seagate Research; Anastassia Ailamaki, Carnegie Mellon University
Abstract
This paper explores the concept of early discard for
interactive search of unindexed data. Processing data inside
storage devices using downloaded searchlet code enables
Diamond to perform efficient, application-specific filtering of
large data collections. Early discard helps users who are looking
for ``needles in a haystack'' by eliminating the bulk of the
irrelevant items as early as possible. A searchlet consists of a
set of application-generated filters that Diamond uses to determine
whether an object may be of interest to the user. The system
optimizes the evaluation order of the filters based on run-time
measurements of each filter's selectivity and computational cost.
Diamond can also dynamically partition computation between the
storage devices and the host computer to adjust for changes in
hardware and network conditions. Performance numbers show that
Diamond dynamically adapts to a query and to run-time system state.
An informal user study of an image retrieval application supports
our belief that early discard significantly improves the quality
of interactive searches.
- View the full text of this paper in HTML and
PDF.
Until March 2005, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2004 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
