An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Evaluation of database access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Principles of Database Systems
Principles of Database Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A new way to compute the product and join of relations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Heuristic algorithms for distributed query processing
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Query optimization in a memory-resident domain relational calculus database system
ACM Transactions on Database Systems (TODS)
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On the optimality of strategies for multiple join
Journal of the ACM (JACM)
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Rapid bushy join-order optimization with Cartesian products
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Optimizing queries over multimedia repositories
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Cost-based optimization for magic: algebra and implementation
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Adaptive Join Algorithms in Dynamic Distributed Databases
Distributed and Parallel Databases
Multidatabase Query Optimization
Distributed and Parallel Databases
On the complexity of generating optimal plans with cross products (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query-based debugging of object-oriented programs
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Optimization techniques for queries with expensive methods
ACM Transactions on Database Systems (TODS)
Query Optimization in Multidatabase Systems
Distributed and Parallel Databases
On the optimality of strategies for multiple joins
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Correcting execution of distributed queries
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
A threshold mechanism for distributed query processing
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
On the complexity of approximate query optimization
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query Optimization in Distributed Relational Databases
Journal of Heuristics
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Large Join Optimization on a Hypercube Multiprocessor
IEEE Transactions on Knowledge and Data Engineering
Optimizing Large Join Queries in Mediation Systems
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On Minimum Edge Ranking Spanning Trees
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Optimizing Queries on Compressed Bitmaps
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Extending the Search Strategy in a Query Optimizer
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Blackboard Architecture for Query Optimization in Object Bases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
A Multi-query Optimizer for Monet
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
Minimum Edge Ranking Spanning Trees of Threshold Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Heuristic and randomized optimization for the join ordering problem
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting common subqueries for complex query optimization
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Optimizing large star-schema queries with snowflakes via heuristic-based query rewriting
CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
Static optimization of conjunctive queries with sliding windows over infinite streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
Operator scheduling in data stream systems
The VLDB Journal — The International Journal on Very Large Data Bases
On the Optimal Ordering of Maps and Selections under Factorization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Synopses for query optimization: a space-complexity perspective
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Proceedings of the 14th ACM international conference on Information and knowledge management
Synopses for query optimization: A space-complexity perspective
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Scalable computation of acyclic joins
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Minimum edge ranking spanning trees of split graphs
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
GrubJoin: An Adaptive, Multi-Way, Windowed Stream Join with Time Correlation-Aware CPU Load Shedding
IEEE Transactions on Knowledge and Data Engineering
Foundations and Trends in Databases
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
Query simplification: graceful degradation for join-order optimization
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Preventing bad plans by bounding the impact of cardinality estimation errors
Proceedings of the VLDB Endowment
A new look at generating multi-join continuous query plans: A qualified plan generation problem
Data & Knowledge Engineering
A novel hybrid algorithm for join ordering problem in database queries
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Parallel query processing and edge ranking of graphs
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
On the optimal ordering of maps, selections, and joins under factorization
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Efficient object querying for java
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms (TALG)
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
An evolutionary multi-agent system for database query optimization
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.01 |
Using the nested loops method, this paper addresses the problem of minimizing the number of page fetches necessary to evaluate a given query to a relational database. We first propose a data structure whereby the number of page fetches required for query evaluation is substantially reduced and then derive a formula for the expected number of page fetches. An optimal solution to our problem is the nesting order of relations in the evaluation program, which minimizes the number of page fetches. Since the minimization of the formula is NP-hard, as shown in the Appendix, we propose a heuristic algorithm which produces a good suboptimal solution in polynomial time. For the special case where the input query is a “tree query,” we present an efficient algorithm for finding an optimal nesting order.