Visualizing the robustness of query execution

Details Visualizing the robustness of query execution Visualizing the robustness of query execution

2009-09-09

arxiv.org/abs/0909.1772v1

Computer Science

Databases

CIDR 2009

Scientific paper

In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time conditions (e.g., estimated predicate selectivities and anticipated memory availability). Robustness of query processing can be defined as the ability to handle unexpected conditions. Robustness of query execution, specifically, can be defined as the ability to process a specific plan efficiently in an unexpected condition. We focus on query execution (run-time), ignoring query optimization (compile-time), in order to complement existing research and to explore untapped potential for improved robustness in database query processing. One of our initial steps has been to devise diagrams or maps that show how well plans perform in the face of varying run-time conditions and how gracefully a system's query architecture, operators, and their implementation degrade in the face of adverse conditions. In this paper, we show several kinds of diagrams with data from three real systems and report on what we have learned both about these visualization techniques and about the three database systems

Affiliated with

Also associated with

No associations

Rating

Visualizing the robustness of query execution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Visualizing the robustness of query execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Visualizing the robustness of query execution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386757