Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems.

Markos Zaharioudakis, Michael J. Carey: Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems. SIGMOD Conference 1997: 50-61

@inproceedings{DBLP:conf/sigmod/ZaharioudakisC97,
  author    = {Markos Zaharioudakis and
               Michael J. Carey},
  editor    = {Joan Peckham},
  title     = {Highly Concurrent Cache Consistency for Indices in Client-Server
               Database Systems},
  booktitle = {SIGMOD 1997, Proceedings ACM SIGMOD International Conference
               on Management of Data, May 13-15, 1997, Tucson, Arizona, USA},
  publisher = {ACM Press},
  year      = {1997},
  pages     = {50-61},
  ee        = {http://doi.acm.org/10.1145/253260.253269, db/conf/sigmod/ZaharioudakisC97.html},
  crossref  = {DBLP:conf/sigmod/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

In this paper, we present four approaches to providing highly concurrent B+-tree indices in the context of a data-shipping, client-server OODBMS architecture. The first performs all index operations at the server, while the other approaches support varying degrees of client caching and usage of index pages. We have implemented the four approaches, as well as the 2PL approach, in the context of the SHORE OODB system at Wisconsin, and we present experimental results from a performance study based on running SHORE on an IBM SP2 multicomputer. Our results emphasize the need for non-2PL approaches and demonstrate the tradeoffs between 2PL, no-caching, and the three caching alternatives.

Copyright © 1997 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/smod9397 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Joan Peckham (Ed.): SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA. ACM Press 1997

, SIGMOD Record 26(2), June 1997
Contents

Online Edition: ACM Digital Library

[Index Terms]
[Full Text in PDF Format, 1768 KB]

References

[Basu95]: ...
[Baye77]: Rudolf Bayer, Mario Schkolnick: Concurrency of Operations on B-Trees. Acta Inf. 9: 1-21(1977)
[Care91]: Michael J. Carey, Michael J. Franklin, Miron Livny, Eugene J. Shekita: Data Caching Tradeoffs in Client-Server DBMS Architectures. SIGMOD Conference 1991: 357-366
[Care94]: Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling: Shoring Up Persistent Applications. SIGMOD Conference 1994: 383-394
[Fran92]: Michael J. Franklin, Michael J. Carey: Client-Server Caching Revisited. IWDOM 1992: 57-78
[Gott96]: Vibby Gottemukkala, Edward Omiecinski, Umakishore Ramachandran: Relaxed Index Consistency for a Client-Server Database. ICDE 1996: 352-361
[Howa88]: John H. Howard, Michael L. Kazar, Sherri G. Menees, David A. Nichols, Mahadev Satyanarayanan, Robert N. Sidebotham, Michael J. West: Scale and Performance in a Distributed File System. ACM Trans. Comput. Syst. 6(1): 51-81(1988)
[Lamb91]: Charles Lamb, Gordon Landis, Jack A. Orenstein, Daniel Weinreb: The ObjectStore Database System. Commun. ACM 34(10): 50-63(1991)
[Lehm81]: Philip L. Lehman, S. Bing Yao: Efficient Locking for Concurrent Operations on B-Trees. ACM Trans. Database Syst. 6(4): 650-670(1981)
[Lome93]: ...
[Moha89]: ...
[Moha90]: C. Mohan: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB 1990: 392-405
[Moha91]: C. Mohan, Inderpal Narang: Recovery and Coherency-Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment. VLDB 1991: 193-207
[Moha95]: ...
[Sagi86]: Yehoshua Sagiv: Concurrent Operations on B*-Trees with Overtaking. J. Comput. Syst. Sci. 33(2): 275-296(1986)
[Shas88]: Dennis Shasha, Nathan Goodman: Concurrent Search Structure Algorithms. ACM Trans. Database Syst. 13(1): 53-90(1988)
[Wang91]: Yongdong Wang, Lawrence A. Rowe: Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture. SIGMOD Conference 1991: 367-376
[Wilk90]: W. Kevin Wilkinson, Marie-Anne Neimat: Maintaining Consistency of Client-Cached Data. VLDB 1990: 122-133
[Zaha96]: ...