Sciweavers

Share
FAST
2004

Diamond: A Storage Architecture for Early Discard in Interactive Search

8 years 10 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
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, applicationspecific 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 ...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where FAST
Authors Larry Huston, Rahul Sukthankar, Rajiv Wickremesinghe, Mahadev Satyanarayanan, Gregory R. Ganger, Erik Riedel, Anastassia Ailamaki
Comments (0)
books