Results 1 to 10 of about 32,125 (165)
Pipelining in multi-query optimization [PDF]
Journal of Computer and System Sciences, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nilesh Dalvi +3 more
openalex +5 more sources
Query optimization at the crossroads [PDF]
Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97, 1997 Surajit Chaudhuri
openalex +4 more sources
Optimal Divide and Query [PDF]
, 2011 This work has been partially supported by the Spanish Ministerio de Ciencia e Innovación under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052.
Insa Cabrera, David +1 more
openaire +2 more sources
Query Optimization in an OODBMS [PDF]
, 1993 It is clearly crucial for the success of object—oriented databases to find efficient implementations that improve on the performance of relational systems, rather than being powerful in terms of modeling and features, but just too slow to be used. This paper describes the mapping of COCOON to DASDBS, a nested relational database kernel system, as an ...
Rich, Christian, Scholl, Marc H.
openaire +3 more sources
Semantic Optimization of Conjunctive Queries [PDF]
Journal of the ACM, 2020 This work deals with the problem of semantic optimization of the central class of conjunctive queries (CQs). Since CQ evaluation is NP-complete, a long line of research has focussed on identifying fragments of CQs that can be efficiently evaluated.
Barcelo P. +3 more
openaire +4 more sources
Proceedings of the VLDB Endowment, 2019 Query optimization is one of the most challenging problems in database systems. Despite the progress made over the past decades, query optimizers remain extremely complex components that require a great deal of hand-tuning for specific workloads and datasets. Motivated by this shortcoming and inspired by recent advances in applying machine
Marcus, Ryan +7 more
openaire +5 more sources
XPath whole query optimization [PDF]
Proceedings of the VLDB Endowment, 2010 Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown that tree automata can be used as a general framework for fine grained XML query optimization.
Kim Nguyen, Sebastian Maneth
openaire +3 more sources
Ontological queries: Rewriting and optimization
2011 IEEE 27th International Conference on Data Engineering, 2011 Ontological queries are evaluated against an enterprise ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization. Query rewriting consists of the compilation of an
Georg Gottlob +2 more
openaire +3 more sources
Query optimization for dynamic imputation [PDF]
Proceedings of the VLDB Endowment, 2017 Missing values are common in data analysis and present a usability challenge. Users are forced to pick between removing tuples with missing values or creating a cleaned version of their data by applying a relatively expensive imputation strategy. Our system, ImputeDB, incorporates imputation into a cost-based query optimizer, performing necessary ...
Cambronero, José +3 more
openaire +3 more sources
Optimization of distributed tree queries
Journal of Computer and System Sciences, 1984 In this paper the problem of finding an optimum strategy of semi-joins for solving tree queries is studied under the objective of total time minimization. Tree queries that are conjunctions of equi-join clauses such that any two relations in the query have at most one attribute in common are considered.
Clement Yu +2 more
openaire +1 more source