Results 271 to 280 of about 202,389 (329)
IFNg_DeepKG: A Novel Model for Identifying Interferon-Gamma-Inducing Epitopes Using Knowledge Graph RAG in Biomedical Applications. [PDF]
J Chem Inf ModelLe VT, Yuune JPT, Ou YY.
europepmc +1 more source
LINEAR PROGRAMMING OPTIMIZATION OF QUERY ALLOCATION IN A DISTRIBUTED CEP SYSTEM
, 2012 Annica Ivert, Bachelor Thesis
openalex +1 more source
Adapting Query Optimization Techniques for Efficient Intrusion Alert Correlation
, 2002 Peng Ning, Dayi Xu
openalex +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
Optimizing query rewriting for multiple queries
Proceedings of the Ninth International Workshop on Information Integration on the Web, 2012We present an scalable algorithm for answering multiple conjunctive queries using views. This is an important problem in query optimization, data integration and ontology-based data access. Since rewriting one conjunctive query using views is an NP-hard problem, we develop an approach where answering n queries takes less than n times the cost of ...
George Konstantinidis, José Luis Ambite
openaire +1 more source
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, 2009
Query Optimization is expected to produce good execution plans for complex queries while taking relatively small optimization time. Moreover, it is expected to pick the execution plans with rather limited knowledge of data and without any additional input from the application.
openaire +1 more source
Query Optimization is expected to produce good execution plans for complex queries while taking relatively small optimization time. Moreover, it is expected to pick the execution plans with rather limited knowledge of data and without any additional input from the application.
openaire +1 more source
Query scheduling in multi query optimization
Proceedings 2001 International Database Engineering and Applications Symposium, 2002Complex queries are becoming commonplace, with the growing use of decision support systems. Decision support queries often have a lot of common sub-expressions within each query, and queries are often run as a batch. Multi query optimization aims at exploiting common sub-expressions, to reduce the evaluation cost of queries, by computing them once and ...
A. Gupta, S. Sudarshan, S. Vishwanathan
openaire +1 more source