Nicolas Bruno
Abstract
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource management, fault tolerance, and load balancing. In this paper we propose query slicing as a novel mechanism to do such decomposition. We study different ways to extend a traditional query optimizer to enable query slicing and experimentally evaluate the benefits of each approach.
- S. Borzsonyi, D. Kossmann, and K. Stocker. The skyline operator. In Proceedings of the International Conference on Data Engineering (ICDE), 2001. Google Scholar
Digital Library
- N. Bruno, C. Galindo-Legaria, and M. Joshi. Polynomial heuristics for query optimization. In Proceedings of the International Conference on Data Engineering (ICDE), 2010.Google ScholarCross Ref
- B. Chandramouli, C. Bond, S. Babu, and J. Yang. Query suspend and resume. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), 2007. Google ScholarDigital Library
- S. Chaudhuri et al. Stop-and-restart style execution for long running decision support queries. In Proceedings of the International Conference on Very Large Databases (VLDB), 2007. Google ScholarDigital Library
- S. Chaudhuri and V. Narasayya. Automating statistics management for query optimizers. In Proceedings of the 16th International Conference on Data Engineering, 2000. Google ScholarDigital Library
- D. J. DeWitt and J. Gray. Parallel database systems: The future of high performance database systems. In Communications of the ACM, 35(6), 1992. Google ScholarDigital Library
- S. Ganguly, W. Hasan, and R. Krishnamurthy. Query optimization for parallel execution. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), 1992. Google ScholarDigital Library
- W. Hasan and R. Motwani. Coloring away communication in parallel query optimization. In Proceedings of the International Conference on Very Large Databases (VLDB), 1995. Google ScholarDigital Library
- S. Krompass, U. Dayal, H. A. Kuno, and A. Kemper. Dynamic workload management for very large data warehouses: Juggling feathers and bowling balls. In Proceedings of the International Conference on Very Large Databases (VLDB), 2007. Google ScholarDigital Library
- S. Krompass et al. Managing long-running queries. In Proceedings of the International Conference on Extending Database Technology (EDBT), 2009. Google ScholarDigital Library
- Microsoft Corporation. SQL Server 2008 Books Online. Accessible at http://msdn.microsoft.com/en-us/library/ms190419.aspx.Google Scholar
- K. A. Ross and J. Cieslewicz. Optimal splitters for database partitioning with size bounds. In Proceedings of the International Conference on Database Theory, 2009. Google ScholarDigital Library
- P. G. Selinger et al. Access path selection in a relational database management system. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), 1979. Google ScholarDigital Library
- C. D. Weissman and S. Bobrowski. The design of the Force.com MultiTenant Internet Application Development Platform. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), 2009. Google ScholarDigital Library
- W. Yan and P. Larson. Eager aggregation and lazy aggregation. In Proceedings of the International Conference on Very Large Databases (VLDB), 1995. Google ScholarDigital Library
- C. Yang et al. Osprey: Implementing mapreduce-style fault tolerance in a shared-nothing distributed database. In Proceedings of the International Conference on Data Engineering (ICDE), 2010.Google ScholarCross Ref
Index Terms
- Slicing long-running queries
Recommendations
Managing long-running queries
EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database TechnologyBusiness Intelligence query workloads that run against very large data warehouses contain queries whose execution times range, sometimes unpredictably, from seconds to hours. The presence of even a handful of long-running queries can significantly slow ...
Reducing long queries using query quality predictors
SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrievalLong queries frequently contain many extraneous terms that hinder retrieval of relevant documents. We present techniques to reduce long queries to more effective shorter ones that lack those extraneous terms. Our work is motivated by the observation ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Comments