The Experts below are selected from a list of 33321 Experts worldwide ranked by ideXlab platform
Antonio Cisternino - One of the best experts on this subject based on the ideXlab platform.
-
Reflection - Template Metaprogramming an Object Interface to Relational Tables
Lecture Notes in Computer Science, 2001Co-Authors: Giuseppe Attardi, Antonio CisterninoAbstract:We present a general technique to support reflection in C++, exploiting template metaprogramming techniques. The technique is used for building an object interface to relational Database Tables. By just annotating a class definition with meta information, such as storage attributes or index properties of fields, a programmer can define objects that can be stored, fetched or searched in a Database Table. A high-performance, full text search engine has been built with this technique.
-
GCSE - Reflection Support by Means of Template Metaprogramming
Lecture Notes in Computer Science, 2001Co-Authors: Giuseppe Attardi, Antonio CisterninoAbstract:The C++ language has only a limited runtime type information system, which doesn't provide full reflection capabilities. We present a general mechanism to support reflection, exploiting template metaprogramming techniques. Two solutions are presented: a static one where metaclass information is only available at compile time to produce class specific code; and a dynamic one where metaclass objects exist at runtime. As a case study of technique we show how to build an object interface to relational Database Tables. By just annotating a class definition with meta information, such as storage attributes or index properties of fields, a programmer can define objects that can be stored, fetched or searched in a Database Table. This approach has been used in building a high-performance, full text search engine.
Guillaume Pierre - One of the best experts on this subject based on the ideXlab platform.
-
globetp template based Database replication for scalable web applications
The Web Conference, 2007Co-Authors: Tobias Groothuyse, Swaminathan Sivasubramanian, Guillaume PierreAbstract:Generic Database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every Database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a Database can help, as UDI queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve Database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides Database Table placements that produce significant improvements in Database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.
-
WWW - Globetp: template-based Database replication for scalable web applications
Proceedings of the 16th international conference on World Wide Web - WWW '07, 2007Co-Authors: Tobias Groothuyse, Swaminathan Sivasubramanian, Guillaume PierreAbstract:Generic Database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every Database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a Database can help, as UDI queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve Database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides Database Table placements that produce significant improvements in Database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.
Giuseppe Attardi - One of the best experts on this subject based on the ideXlab platform.
-
Reflection - Template Metaprogramming an Object Interface to Relational Tables
Lecture Notes in Computer Science, 2001Co-Authors: Giuseppe Attardi, Antonio CisterninoAbstract:We present a general technique to support reflection in C++, exploiting template metaprogramming techniques. The technique is used for building an object interface to relational Database Tables. By just annotating a class definition with meta information, such as storage attributes or index properties of fields, a programmer can define objects that can be stored, fetched or searched in a Database Table. A high-performance, full text search engine has been built with this technique.
-
GCSE - Reflection Support by Means of Template Metaprogramming
Lecture Notes in Computer Science, 2001Co-Authors: Giuseppe Attardi, Antonio CisterninoAbstract:The C++ language has only a limited runtime type information system, which doesn't provide full reflection capabilities. We present a general mechanism to support reflection, exploiting template metaprogramming techniques. Two solutions are presented: a static one where metaclass information is only available at compile time to produce class specific code; and a dynamic one where metaclass objects exist at runtime. As a case study of technique we show how to build an object interface to relational Database Tables. By just annotating a class definition with meta information, such as storage attributes or index properties of fields, a programmer can define objects that can be stored, fetched or searched in a Database Table. This approach has been used in building a high-performance, full text search engine.
Tobias Groothuyse - One of the best experts on this subject based on the ideXlab platform.
-
globetp template based Database replication for scalable web applications
The Web Conference, 2007Co-Authors: Tobias Groothuyse, Swaminathan Sivasubramanian, Guillaume PierreAbstract:Generic Database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every Database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a Database can help, as UDI queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve Database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides Database Table placements that produce significant improvements in Database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.
-
WWW - Globetp: template-based Database replication for scalable web applications
Proceedings of the 16th international conference on World Wide Web - WWW '07, 2007Co-Authors: Tobias Groothuyse, Swaminathan Sivasubramanian, Guillaume PierreAbstract:Generic Database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every Database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a Database can help, as UDI queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve Database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides Database Table placements that produce significant improvements in Database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.
Swaminathan Sivasubramanian - One of the best experts on this subject based on the ideXlab platform.
-
globetp template based Database replication for scalable web applications
The Web Conference, 2007Co-Authors: Tobias Groothuyse, Swaminathan Sivasubramanian, Guillaume PierreAbstract:Generic Database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every Database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a Database can help, as UDI queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve Database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides Database Table placements that produce significant improvements in Database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.
-
WWW - Globetp: template-based Database replication for scalable web applications
Proceedings of the 16th international conference on World Wide Web - WWW '07, 2007Co-Authors: Tobias Groothuyse, Swaminathan Sivasubramanian, Guillaume PierreAbstract:Generic Database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every Database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a Database can help, as UDI queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve Database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides Database Table placements that produce significant improvements in Database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.
