2 citations found. Retrieving documents...
H. Andrade, T. Kurc, U. Catalyurek, A. Sussman, and J. Saltz. Persistent caching in a multiple query optimization framework. In Proceedings of the 6th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Washington, DC, March 2002.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Exploiting Functional Decomposition for Efficient.. - Andrade, Kurc.. (2002)   Self-citation (Andrade Kurc Sussman Saltz)   (Correct)

....employs a two tier architecture that uses both main memory and secondary storage. The in core cache implements on demand 10 lookup for reusable aggregates, while the persistent cache in secondary storage makes it possible to maintain cached aggregates across different invocations of the server [4, 7]. In this paper, we focus on in core caching of aggregates. When the server is started up, a fixed amount of memory is allocated to the in core cache. A query thread interacts with the Data Store using a DataStore object, which provides functionality similar to the C library malloc function. ....

H. Andrade, T. Kurc, U. Catalyurek, A. Sussman, and J. Saltz. Persistent caching in a multiple query optimization framework. In Proceedings of the 6th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Washington, DC, March 2002.


Active Proxy-G: Optimizing the Query Execution Process.. - Andrade, Kurc, Sussman, .. (2002)   Self-citation (Andrade Kurc Saltz)   (Correct)

....collection of datasets. Although main memory is becoming increasingly cheap, it is still orders of magnitude more expensive than secondary storage. Furthermore, secondary storage can be persistent across APG invocations. PDSS is therefore implemented as a large secondary storage based Data Store [5]. It is a two tier hierarchy, using both a portion of main memory plus a large chunk of secondary storage. The employed replacement policies insure that more useful intermediate results are maintained in memory, while other intermediate results may get swapped out to the secondary storage cache ....

....the design and implementation of the APG component of our framework. APG interacts with one or more application servers to answer queries that require input data, and with the Persistent Data Store Service for retrieving cached aggregates. Data access is achieved through a Data Source abstraction [5, 7]. The Data Source presents the underlying storage subsystem as a page based storage medium. That is, a dataset is assumed to have been partitioned and stored in terms of fixed size pages. In our current system, we have implemented Data Sources for the Unix file system on disk based storage. In a ....

H. Andrade, T. Kurc, U. Catalyurek, A. Sussman, and J. Saltz. Persistent caching in a multiple query optimization framework. In Proceedings of the 6th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Washington, DC, March 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC