Ippokratis Pandis
Pinar Tözün
Abstract
Scaling the performance of shared-everything transaction processing systems to highly-parallel multicore hardware remains a challenge for database system designers. Recent proposals alleviate locking and logging bottlenecks in the system, leaving page latching as the next potential problem. To tackle the page latching problem, we propose physiological partitioning (PLP). The PLP design applies logical-only partitioning, maintaining the desired properties of shared-everything designs, and introduces a multi-rooted B+Tree index structure (MRBTree) which enables the partitioning of the accesses at the physical page level. Logical partitioning and MRBTrees together ensure that all accesses to a given index page come from a single thread and, hence, can be entirely latch-free; an extended design makes heap page accesses thread-private as well. Eliminating page latching allows us to simplify key code paths in the system such as B+Tree operations leading to more efficient and maintainable code. Profiling a prototype PLP system running on different multicore machines shows that it acquires 85% and 68% fewer contentious critical sections, respectively, than an optimized conventional design and one based on logical-only partitioning. PLP also improves performance up to 40% and 18%, respectively, over the existing systems.
- R. Bayer and E. McCreight. Organization and maintenance of large ordered indices. In SIGFIDET, 107--141, 1970. Google Scholar
Digital Library
- E. A. Brewer. Towards robust distributed systems (abstract). In PODC, 7--7, 2000. Google ScholarDigital Library
- S. Chen. FlashLogging: exploiting flash devices for synchronous logging performance. In SIGMOD, 73--86, 2009. Google ScholarDigital Library
- C. Curino, E. Jones, Y. Zhang, and S. Madden. Schism: a workload-driven approach to database replication and partitioning. PVLDB, 3:48--57, 2010. Google ScholarDigital Library
- S. Das, S. Antony, D. Agrawal, and A. El Abbadi. Thread cooperation in multicore architectures for frequency counting over multiple data streams. PVLDB, 2:217--228, 2009. Google ScholarDigital Library
- D. J. DeWitt, S. Ghandeharizadeh, D. A. Schneider, A. Bricker, H. I. Hsiao, and R. Rasmussen. The Gamma database machine project. IEEE TKDE, 2(1):44--62, 1990. Google ScholarDigital Library
- G. Graefe. Sorting and indexing with partitioned B-trees. In CIDR, 1--13, 2003.Google Scholar
- S. Harizopoulos, D. J. Abadi, S. Madden, and M. Stonebraker. OLTP through the looking glass, and what we found there. In SIGMOD, 981--992, 2008. Google ScholarDigital Library
- P. Helland. Life beyond distributed transactions: an apostate's opinion. In CIDR, 132--141, 2007.Google Scholar
- M. D. Hill and M. R. Marty. Amdahl's law in the multicore era. Computer, 41:33--38, 2008. Google ScholarDigital Library
- I. Jaluta, S. Sippu, and E. Soisalon-Soininen. B-tree concurrency control and recovery in page-server database systems. ACM TODS, 31:82--132, 2006. Google ScholarDigital Library
- R. Johnson, I. Pandis, and A. Ailamaki. Improving OLTP scalability using speculative lock inheritance. PVLDB, 2(1):479--489, 2009. Google ScholarDigital Library
- R. Johnson, I. Pandis, N. Hardavellas, A. Ailamaki, and B. Falsafi. Shore-MT: a scalable storage manager for the multicore era. In EDBT, 24--35, 2009. Google ScholarDigital Library
- R. Johnson, I. Pandis, R. Stoica, M. Athanassoulis, and A. Ailamaki. Aether: a scalable approach to logging. PVLDB, 3:681--692, 2010. Google ScholarDigital Library
- E. P. Jones, D. J. Abadi, and S. Madden. Low overhead concurrency control for partitioned main memory databases. In SIGMOD, 603--614, 2010. Google ScholarDigital Library
- T. Lahiri, V. Srihari, W. Chan, N. MacNaughton, and S. Chandrasekaran. Cache fusion: Extending shared-disk clusters with shared caches. In VLDB, 683--686, 2001. Google ScholarDigital Library
- M.-L. Lee, M. Kitsuregawa, B. C. Ooi, K.-L. Tan, and A. Mondal. Towards self-tuning data placement in parallel database systems. In SIGMOD, 225--236, 2000. Google ScholarDigital Library
- D. Lomet, R. Anderson, T. K. Rengarajan, and P. Spiro. How the Rdb/VMS data sharing system became fast. Technical Report CRL-92-4, DEC, 1992.Google Scholar
- C. Mohan. ARIES/KVL: a key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. In VLDB, 392--405, 1990. Google ScholarDigital Library
- C. Mohan and F. Levine. ARIES/IM: an efficient and high concurrency index management method using write-ahead logging. In SIGMOD, 371--380, 1992. Google ScholarDigital Library
- M. Moir, D. Nussbaum, O. Shalev, and N. Shavit. Using elimination to implement scalable and lock-free FIFO queues. In SPAA, 253--262, 2005. Google ScholarDigital Library
- P. Muth, P. O'Neil, A. Pick, and G. Weikum. The LHAM log-structured history data access method. The VLDB Journal, 8:199--221, 2000. Google ScholarDigital Library
- I. Pandis, R. Johnson, N. Hardavellas, and A. Ailamaki. Data-oriented transaction execution. PVLDB, 3(1):928--939, 2010. Google ScholarDigital Library
- S. Somogyi, T. F. Wenisch, N. Hardavellas, J. Kim, A. Ailamaki, and B. Falsafi. Memory coherence activity prediction in commercial workloads. In WMPI, 37--45, 2004. Google ScholarDigital Library
- M. Stonebraker. The case for shared nothing. IEEE Database Eng. Bull., 9:4--9, 1986.Google Scholar
- M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era: (it's time for a complete rewrite). In VLDB, 1150--1160, 2007. Google ScholarDigital Library
- B. M. Beckmann and D. A. Wood. Managing wire delay in large chip-multiprocessor caches. In MICRO, 319--330, 2004. Google ScholarDigital Library
- N. Hardavellas, M. Ferdman, B. Falsafi, and A. Ailamaki. Reactive NUCA: near-optimal block placement and replication in distributed caches. In ISCA, 184--195, 2009. Google ScholarDigital Library
- N. Hardavellas, I. Pandis, R. F. Johnson, N. Mancheril, A. Ailamaki, and B. Falsafi. Database servers on chip multiprocessors: Limitations and opportunities. In CIDR, 79--87, 2007.Google Scholar
- I. Pandis, P. Tözün, M. Branco, D. Karampinas, D. Porobic, R. Johnson, and A. Ailamaki. A data-oriented transaction execution engine and supporting tools. In SIGMOD, 1237--1240, 2011. Google ScholarDigital Library
- S. Somogyi, T. F. Wenisch, A. Ailamaki, and B. Falsafi. Spatio-temporal memory streaming. In ISCA, 69--80, 2009. Google ScholarDigital Library
Index Terms
- PLP: page latch-free shared-everything OLTP
Recommendations
Use of PLP Cepstral Features for Phonetic Segmentation
IALP '13: Proceedings of the 2013 International Conference on Asian Language ProcessingPhonetic segmentation can find its potential application for Text-to-Speech (TTS) synthesis and Automatic Speech Recognition (ASR) systems. In this paper, we propose use of Perceptual Linear Prediction Cepstral Coefficients (PLPCC) feature for phonetic ...
Multitaper MFCC and PLP features for speaker verification using i-vectors
In this paper we study the performance of the low-variance multi-taper Mel-frequency cepstral coefficient (MFCC) and perceptual linear prediction (PLP) features in a state-of-the-art i-vector speaker verification system. The MFCC and PLP features are ...
Performance Analysis of Lip Synchronization Using LPC, MFCC and PLP Speech Parameters
CICN '10: Proceedings of the 2010 International Conference on Computational Intelligence and Communication NetworksMany multimedia applications and entertainment industry products like games, cartoons and film dubbing require speech driven face animation and audio-video synchronization. Only Automatic Speech Recognition system (ASR) does not give good results in ...
Comments