2004 journal article

Deriving efficient SQL sequences via read-aheads

Lecture Notes in Computer Science, 3181, 299–308.

By: A. Bilgin n, R. Chirkova n, T. Salo* & M. Singh n

Contributors: M. Singh n, T. Salo*, R. Chirkova n, A. Bilgin n & M. Singh

TL;DR: The proposed solution uses data prefetching (read-aheads) to minimize the total data-access time of an application, in a manner that affects neither the application code nor the backend DBMS. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018

2004 chapter

Incremental read-aheads

In Current trends in database technology: EDBT 2004 Workshops, PhD, DataX, PIM, P2P&DB, and Clustweb, Heraklion, Crete, Greece, March 14-18, 2004: revised selected papers (Vol. 3268, pp. 144–153). Berlin; New York: Springer.

By: A. Bilgin

Source: NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.