Towards graph containment search and indexing
Chen Chen, Xifeng Yan, et al.
VLDB 2007
As the demand for high volume transaction processing grows, coupling multiple computing nodes becomes increasingly attractive. This paper presents a comparison on the resilience of the performance to system dynamics of three architectures for transaction processing. In the Shared Nothing (SN) architecture, neither disks nor memory is sharEd., In the Shared Disk (SD) architecture, all disks are accessible to all nodes while in the Shared Intermediate Memory (SIM) architecture, a shared intermediate level of memory is introducEd., A transaction processing system needs to be configured with enough capacity to cope with the dynamic variation of load or with a node failure. Three specific scenarios are considered: 1) a sudden surge in load of one transaction class, 2) varying transaction rates for all transaction classes, and 3) failure of a single processing node. We find that the different architectures require different amounts of capacity to be reserved to cope with these dynamic situations. We further show that the data sharing architecture, especially in the case with shared intermediate memory, is more resilient to system dynamics and require far less contingency capacity compared to the SN architecture. © 1994 IEEE
Chen Chen, Xifeng Yan, et al.
VLDB 2007
Ming-Ling Lo, Ming-Syan Syan Chen, et al.
SIGMOD Record
Joel L. Wolf, Philip S. Yu
ACM TOIT
Claudio Lucchese, Michail Vlachos, et al.
ICDE 2008