J. G. Kollias, Y. Manolopoulos, and C. H. Papadimitriou, \The optimum execution order of queries in linear storage," Information Processing Letters, vol. 36, pp. 141-145, Nov. 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the 9 track tapes of that time, it applies less well to modern helical scan drives that switch to high speed tape motion for long moves, and the assumption is wildly incorrect for serpentine drives. The problem of scheduling the retrieval of a set of overlapping intervals from a tape is studied in [32] assuming that block retrievals for separate intervals cannot be interleaved, that blocks for overlapping intervals are not cached for reuse, and that locate time is proportional to the di erence in block numbers. Striped tape organizations are modeled in [33, 34, 35, 36] Database algorithms for ....

J. G. Kollias, Y. Manolopoulos, and C. H. Papadimitriou, \The optimum execution order of queries in linear storage," Information Processing Letters, vol. 36, pp. 141-145, Nov. 1990.

.... to predict future references and prefetch documents in the SS [KW98] for digital library applications, to derive intelligent placement strategies of data in the library [CTZ97] as well as efforts to derive intelligent scheduling algorithms for multiplexed video streams over tape drives [KMP90,LLW95] As mentioned in the introduction, disk based storage is viewed as presently too costly to store the thousands of video objects in a full fledged video server, and thus TS is employed for storage augmentation purposes. A continuous object can be played either from TS or from SS [Che94, ....

J. Kollias, Y. Manolopoulos, and C.H. Papadimitriou. The optimum execution order of queries in linear storage. Information Processing Letters, 36(3), November 1990.

....with i j n 1) An optimal tour in this case is constructed from an optimal assignment in a related matrix. Again, given an optimal assignment, an optimal tour can be constructed without increasing the cost. Another result in this direction is presented by Kollias, Manolopoulos and Papadimitriou [66]. They investigate a TSP on a permuted right upper triangular Monge matrix with an additional column and show how to solve it in O(n log n) time. Note that the additional column usually destroys the Monge structure of the distance matrix. 4.2 Specially structured patching graphs In 1980, ....

J.G. Kollias, Y. Manolopoulos and C.H. Papadimitriou, The optimum execution order of queries in linear storage, Information Processing Letters 36, 1990, 141--145.

....but our measurements indicate that this relationship is weak for helical scan drives because of their high speed search capability, and the assumption is wildly incorrect for DLT serpentine drives. The problem of scheduling the retrieval of a set of overlapping intervals from a tape is studied in [12] assuming that block retrievals for separate intervals cannot be interleaved, that blocks for overlapping intervals are not cached for reuse, and that locate time is proportional to the difference in block numbers. They identify as an open problem the scheduling of retrievals in which some blocks ....

Kollias, J. G., Manolopoulos, Y., and Papadimitriou, C. H. The optimum execution order of queries in linear storage. Information Processing Letters 36, 3 (Nov. 1 1990), 141--145.

.... 1992] Myllymaki and Livny also studied join algorithms for database stored partly on tapes and partly on disks [Myllymaki and Livny, 1995] Issues of caching, query scheduling and optimization for relational database systems using tertiary storage jukeboxes have also been studied [Sarawagi, 1995; Kollias et al. 1990; Sarawagi and Stonebraker, 1996] In this paper, we report our preliminary study on the issues related to efficiently fetching data from tertiary storage systems consisting of optical disks. The objective of our work is to avoid the possible poor response time caused by long disk exchange time ....

Kollias, J. G., Manolopoulos, Y., and Papadimitriou, C. H. (1990). The optimum execution order of queries in linear storage. Information Processing Letters, 36(3):141--145.

....fetching and evicting fragments from the tertiary memory to the disk cache. MSD93] discusses the problem of scheduling parallel hash joins in a batched environment. Query scheduling with the aim of reducing seek cost or platter switch cost in tertiary memory has been addressed in a few places: KMP90] addresses the question of finding the optimum execution order of queries on a file stored on a tape and [Won80] addresses the problem of placing records with known access probability on tape to minimize expected head movement. ML95] studies the benefit of doing hybrid hash join and nested loop ....

J.G. Kollias, Y. Manolopoulos, and C.H. Papadimitriou. The optimum execution order of queries in linear storage. Information Processing Letters, 36(3):141--5, Nov 1990.

....relevant in our context. One class of algorithms [BK79, Wie87, Hof83, SLM93] deals with reordering a set of pending I O requests to reduce seek and rotational latency on magnetic disks. There is also work on scheduling a collection of I O requests on tape so as to reduce seek cost. For instance, KMP90] addresses the problem of finding the optimum execution order of queries on a file stored on a tape assuming a linear seek cost model, and [HS96b] studies the scheduling problem on a DLT tape assuming a non linear seek cost. Scheduling in robotic devices is more challenging because tertiary ....

J.G. Kollias, Y. Manolopoulos, and C.H. Papadimitriou. The optimum execution order of queries in linear storage. Information Processing Letters, 36(3):141--5, Nov 1990.

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