Sciweavers

315 search results - page 61 / 63
» Improving Performance by Branch Reordering
Sort
View
VLDB
2004
ACM
126views Database» more  VLDB 2004»
14 years 25 days ago
STEPS towards Cache-resident Transaction Processing
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
Stavros Harizopoulos, Anastassia Ailamaki
CP
2004
Springer
14 years 27 days ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
NTMS
2009
IEEE
14 years 2 months ago
Q-ESP: A QoS-Compliant Security Protocol to Enrich IPSec Framework
—IPSec is a protocol that allows to make secure connections between branch offices and allows secure VPN accesses. However, the efforts to improve IPSec are still under way; one ...
Mahmoud Mostafa, Anas Abou El Kalam, Christian Fra...
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
13 years 11 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
ICDE
2005
IEEE
134views Database» more  ICDE 2005»
14 years 1 months ago
Index Structures for Matching XML Twigs Using Relational Query Processors
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Kou...