Sciweavers

305 search results - page 9 / 61
» Including Group-By in Query Optimization
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetic algorithms for large join query optimization
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
Hongbin Dong, Yiwen Liang
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 7 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Analyzing Plan Diagrams of Database Query Optimizers
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
Naveen Reddy, Jayant R. Haritsa
ICDT
2010
ACM
180views Database» more  ICDT 2010»
14 years 5 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen