Sciweavers

85 search results - page 5 / 17
» From Total Order to Database Replication
Sort
View
SOSP
2007
ACM
15 years 6 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
ICARCV
2002
IEEE
166views Robotics» more  ICARCV 2002»
15 years 2 months ago
Similarity measure determination from NURBS-warping method
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
Kim Meng Liang, Mandava Rajeswari, Bee Ee Khoo
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
14 years 9 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
ECWEB
2004
Springer
225views ECommerce» more  ECWEB 2004»
15 years 3 months ago
Accelerating Database Processing at e-Commerce Sites
Abstract. Most e-commerce Web sites dynamically generate their contents through a three-tier server architecture composed of a Web server, an application server, and a database ser...
Seunglak Choi, Jinwon Lee, Su Myeon Kim, Junehwa S...
ICDE
2005
IEEE
260views Database» more  ICDE 2005»
15 years 11 months ago
A Comparative Evaluation of Transparent Scaling Techniques for Dynamic Content Servers
We study several transparent techniques for scaling dynamic content web sites, and we evaluate their relative impact when used in combination. Full transparency implies strong dat...
Cristiana Amza, Alan L. Cox, Willy Zwaenepoel