Sciweavers

1611 search results - page 159 / 323
» Queries Independent of Updates
Sort
View
SIGMOD
2006
ACM
128views Database» more  SIGMOD 2006»
16 years 4 months ago
Temporal aggregates and temporal universal quantification in standard SQL
Although it has been acknowledged for many years that querying and updating time-varying information using standard (i.e., non-temporal) SQL is a challenging task, the proposed te...
Esteban Zimányi
ISORC
2008
IEEE
15 years 11 months ago
Push-Pull Interest Management for Virtual Worlds
Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in ...
Rob Minson, Georgios K. Theodoropoulos
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
15 years 9 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
16 years 4 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
BTW
2005
Springer
113views Database» more  BTW 2005»
15 years 10 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...