Sciweavers

1168 search results - page 37 / 234
» Optimization strategies for complex queries
Sort
View
DAGSTUHL
2000
13 years 11 months ago
On the Competitive Complexity of Navigation Tasks
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
AMW
2009
13 years 11 months ago
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
Mônica Ribeiro Porto Ferreira, Agma J. M. Tr...
VLDB
1992
ACM
151views Database» more  VLDB 1992»
14 years 2 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu
DPD
2002
168views more  DPD 2002»
13 years 10 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
14 years 2 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar