TechWeb Digital Library

Investigating Storage Layouts to Improve Parallelism in Interactive Brute-Force Search

Date: January 2008
Type: White Paper
Rating: (0)

Overview: This research paper describes different storage layout approaches and their effect on the efficiency of data retrieval and storage in Diamond, an interactive search system. Diamond implements the concept of early discard to interactively search terabytes of unindexed data including such as images, videos, etc. Four main storage layout approaches were compared: the existing layout, which simply lays whole objects on each node, an archive approach, which stores a tar archive of data objects on each node, and two striping approaches which deal with the alignment of data striped across nodes either by repeating the incomplete data in the next stripe.


Click here to download now

View all content from this source

Not what you’re looking for? Search again
Go Advanced »
Email Alert

Receive an email alert whenever new content is added to the Storage section of the TechWeb Digital Library

More Storage Resources

Data Discovery for IT: Analyst Review of New Technology
In 3.0 Index Engines combines the indexing of primary storage data with backup data that previously required separate processing. Index Engines...

Data Protection Strategies Using Replication
This paper examines four data protection strategies and compares their merits for the most common business continuance scenarios.

More On Storage