M
Mario Schkolnick
Researcher at IBM
Publications - 17
Citations - 1621
Mario Schkolnick is an academic researcher from IBM. The author has contributed to research in topics: Database design & Relational database. The author has an hindex of 15, co-authored 17 publications receiving 1594 citations.
Papers
More filters
Patent
Intelligent shopping cart
TL;DR: In this paper, a mobile shopping cart that can automatically keep track of objects selected and carried in the cart and provide a customer using the cart information like the total price of the items carried.
Journal ArticleDOI
A history and evaluation of System R
Donald D. Chamberlin,Morton M. Astrahan,Michael W. Blasgen,Jim Gray,W. Frank King,Bruce G. Lindsay,Raymond A. Lorie,James W. Mehl,T. G. Price,Franco Putzolu,Patricia G. Selinger,Mario Schkolnick,Donald R. Slutz,Irving L. Traiger,B. W. Wade,Robert A. Yost +15 more
TL;DR: System R as mentioned in this paper is an experimental database system designed to demonstrate that the usability advantages of the relational data model can be realized in a system with the complete function and high performance required for everyday production use.
Journal ArticleDOI
Physical database design for relational databases
TL;DR: This paper describes the concepts used in the implementation of DBDSGN, an experimental physical design tool for relational databases developed at the IBM San Jose Research Laboratory and illustrates how a system can export a model of its internal assumptions and behavior so that other systems can share this model.
Journal ArticleDOI
Buffer management in relational database systems
TL;DR: The hot-set model, characterizing the buffer requirements of relational queries, is presented and it can be used by the query optimizer to derive efficient execution plans accounting for the available buffer space, and by a query scheduler to prevent thrashing.
Proceedings Article
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
TL;DR: A buffer management algorithm based on a model of database requests is presented based on the combination of a regular pattern of accesses made by a process and the competing requests for buffer resources made by concurrently executing processes.