Using dynamic sets to overcome high I/O latencies during search
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Describes a single unifying abstraction called 'dynamic sets', which can offer substantial benefits to search applications. These benefits include greater opportunity in the I/O subsystem to aggressively exploit prefetching and parallelism, as well as support for associative naming to complement the hierarchical naming in typical file systems. This paper motivates dynamic sets and presents the design of a system that embodies this abstraction.Keywords
This publication has 6 references indexed in Scilit:
- Exposing I/O concurrency with informed prefetchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A study of the reliability of Internet sitesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The World-Wide WebCommunications of the ACM, 1994
- Semantic file systemsPublished by Association for Computing Machinery (ACM) ,1991
- Read-only transactions in a distributed databaseACM Transactions on Database Systems, 1982
- GrapevineCommunications of the ACM, 1982