Sciweavers

491 search results - page 12 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
ECCB
2005
IEEE
14 years 1 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
SPIRE
2010
Springer
13 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
BTW
2009
Springer
99views Database» more  BTW 2009»
13 years 10 months ago
A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator
: Very recently, Cao et al. presented the MAPLE approach, which accelerates queries with multiple instances of the same relation by sharing their scan operator. The principal idea ...
Thomas Neumann, Guido Moerkotte
VLDB
1997
ACM
97views Database» more  VLDB 1997»
13 years 11 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
VLDB
1992
ACM
103views Database» more  VLDB 1992»
13 years 11 months ago
Temporal Query Processing and Optimization in Multiprocessor Database Machines
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...
T. Y. Cliff Leung, Richard R. Muntz