Results 221 to 230 of about 198,739 (283)
MC3D: the Materials Cloud computational database of experimentally known stoichiometric inorganics.
Digit DiscovHuber SP +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
International Journal of Intelligent Information Technologies, 2013
Query optimization is an important aspect in designing database management systems, aimed to find an optimal query execution plan so that overall time of query execution is minimized. Multi join query ordering (MJQO) is an integral part of query optimizer. This paper aims to propose a solution for MJQO problem, which is an NP complete problem.
Mukul Joshi, Praveen Ranjan Srivastava
openaire +1 more source
Query optimization is an important aspect in designing database management systems, aimed to find an optimal query execution plan so that overall time of query execution is minimized. Multi join query ordering (MJQO) is an integral part of query optimizer. This paper aims to propose a solution for MJQO problem, which is an NP complete problem.
Mukul Joshi, Praveen Ranjan Srivastava
openaire +1 more source
Journal of Algorithms, 1993
Summary: Let \(\Gamma_ 0\) be a set of \(n\) halfspaces in \(E^ d\) (where the dimension \(d\) is fixed) and let \(m\) be a parameter, \(n\leq m\leq n^{\lfloor d/2\rfloor}\). We show that \(\Gamma_ 0\) can be preprocessed in time and space \(0(m^{1+\delta}\)) (for any fixed \(\delta>0\)) so that given a vector \(c\in E^ d\) and another set \(\Gamma_ q\)
openaire +1 more source
Summary: Let \(\Gamma_ 0\) be a set of \(n\) halfspaces in \(E^ d\) (where the dimension \(d\) is fixed) and let \(m\) be a parameter, \(n\leq m\leq n^{\lfloor d/2\rfloor}\). We show that \(\Gamma_ 0\) can be preprocessed in time and space \(0(m^{1+\delta}\)) (for any fixed \(\delta>0\)) so that given a vector \(c\in E^ d\) and another set \(\Gamma_ q\)
openaire +1 more source
2009
Complex queries are becoming commonplace with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across multiple such queries. The focus of this work is to speed up query execution by exploiting these common subexpressions.
Prasan Roy, S. Sudarshan
openaire +1 more source
Complex queries are becoming commonplace with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across multiple such queries. The focus of this work is to speed up query execution by exploiting these common subexpressions.
Prasan Roy, S. Sudarshan
openaire +1 more source
Foundations and Trends® in Databases
Summary: This survey presents recent progress on using machine learning techniques to improve query optimizers in database systems. Centering around a generic paradigm of learned query optimizers, this survey covers several lines of effort on rebuilding or aiding important components in query optimizers (i.e., cardinality estimators, cost models, and ...
Ding, Bolin, Zhu, Rong, Zhou, Jingren
openaire +2 more sources
Summary: This survey presents recent progress on using machine learning techniques to improve query optimizers in database systems. Centering around a generic paradigm of learned query optimizers, this survey covers several lines of effort on rebuilding or aiding important components in query optimizers (i.e., cardinality estimators, cost models, and ...
Ding, Bolin, Zhu, Rong, Zhou, Jingren
openaire +2 more sources