Join enumeration in a memory-constrained environment

@article{Bowman2000JoinEI,
  title={Join enumeration in a memory-constrained environment},
  author={Ivan T. Bowman and G. Paulley},
  journal={Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)},
  year={2000},
  pages={645-654}
}
  • Ivan T. Bowman, G. Paulley
  • Published 2000
  • Computer Science
  • Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
In today's computing environment, database technology can be found on virtually any device, from traditional mainframes to cellular phones. Sophisticated applications, whether enterprise information portals or sales force automation systems, can 'push' much of their complexity into the database itself; indeed, this represents one of the main benefits of database technology. The challenge, however, is to support these complex applications, and the queries they generate, on small computing… Expand
Thinking Big About Tiny Databases
Recent advances in device technology and connectivity have paved the way for next generation applications that are data-driven, where data can reside anywhere, can be accessed at any time, from anyExpand
Optimization Strategy of Top-Down Join Enumeration on Modern Multi-Core CPUs
TLDR
This paper proposes a comprehensive and practical framework for parallelizing top-down dynamic programming query optimization with complex non-inner join in the multi-core processor architecture, referred as PTDhyp and implements such a search strategy that can improve optimization time effective compared to known existing algorithms. Expand
Optimization Strategy of Bidirectional Join Enumeration in Multi-Core CPUS
TLDR
This paper combined the enhancements of two approaches and proposes a comprehensive and practical algorithm based graph-traversal driven, referred to here as DPbid, for parallelizing query optimization in the multi-core processor architecture that can improve optimization time effective compared to known existing algorithms. Expand
Optimal top-down join enumeration
TLDR
This work describes a top-down join enumeration algorithm that is optimal with respect to the join graph and presents performance results demonstrating that a combination of optimal enumeration with search strategies such as branch-and-bound yields an algorithm significantly faster than those previously described in the literature. Expand
Recording Provenance for SQL Queries and Updates
TLDR
It is illustrated how SQL Anywhere’s embeddability features work in concert to provide a robust data management solution in zero-administration environments. Expand
SQL Anywhere: An Embeddable DBMS
TLDR
It is illustrated how SQL Anywhere’s embeddability features work in concert to provide a robust data management solution in zero-administration environments. Expand
Deriving Predicate Statistics for Logic Rules
TLDR
The present paper extends SDP to general rules and n-ary predicates, which also handles negation and mutual recursions as well as other operations. Expand
SQL Anywhere: A Holistic Approach to Database Self-management
TLDR
It is illustrated how the various self-management features of SQL Anywhere work in concert to provide a robust data management solution in zero-administration environments. Expand
Subquery Plan Reuse based Query Optimization
TLDR
This paper proposes a scheme to reduce the search space of Dynamic Programming based on reuse of query plans among similar subqueries and generates the cover set of similar subgraphs present in the query graph. Expand
The CLOCK Data-Aware Eviction Approach: Towards Processing Linked Data Streams with Limited Resources
TLDR
The goal of this paper is to show that datadriven eviction outperforms today’s dominant data-agnostic approaches such as first-in-first-out or random deletion. Expand
...
1
2
...

References

SHOWING 1-10 OF 42 REFERENCES
The Optimization of Queries in Relational Databases
A fully implemented system for optimizing and executing queries for relational databases is described. The system optimizes n-table, equi-join queries written in QUEL, the query language supported byExpand
Measuring the Complexity of Join Enumeration in Query Optimization
TLDR
This paper describes and measures the performance of the Starburst join enumerator, which can parameterically adjust for each query the space of join sequences that arc evaluated by the optimizer to allow or disallow composite tables as the inner operand of a join. Expand
Fundamental techniques for order optimization
TLDR
Novel optimization techniques for pushing down sorts in joins, minimizing the number of sorting columns, and detecting when sorting can be avoided because of predicates, keys, or indexes are described. Expand
Optimization of Queries Including ADT Functions
TLDR
An optimization method that takes ADT selections as well as @ins into consideration is proposed and it is shown that this method will find query execution plans superior to those obtained by the conventional heuristics, in particular, whenADT selections are considerably more costly than joins. Expand
Index scans using a finite LRU buffer: a validated I/O model
TLDR
A model for these more practical situations is presented and a formula derived for estimating the performance of an index scan is presented, giving a closed-form approximation that is easy to compute. Expand
Query optimization by simulated annealing
TLDR
A query optimization algorithm based on simulated annealing, which is a probabilistic hill climbing algorithm for optimizing complex non-recursive queries that arise in the study of linear recursion. Expand
Optimizing the performance of a relational algebra database interface
An approach for implementing a “smart” interface to support a relational view of data is proposed. The basic idea is to employ automatic programming techniques so that the interface analyzes andExpand
Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections
TLDR
This work presents a formally derived and correct dynamic programming algorithm to compute optimal bushy processing trees for queries with expensive predicates and introduces unique solutions for efficiently computing the cost of the intermediate plans and for saving memory space by utilizing bitvector contraction. Expand
Randomized algorithms for optimizing large join queries
TLDR
A new Two Phase Optimization algorithm is inspired, which is a combination of Simulated Annealing and Iterative Improvement, which outperforms the original algorithms in terms of both output quality and running time. Expand
The Complexity of Transformation-Based Join Enumeration
TLDR
This paper proposes a scheme within the generic transformation-based framework to avoid the generation of duplicates, and shows an improvement of up to a factor of 5 in the optimization of a query with 8 tables, when duplicates are avoided rather than detected. Expand
...
1
2
3
4
5
...