Results 41 to 50 of about 4,751,671 (372)
ReoptSMART: A Learning Query Plan Cache [PDF]
, 2008 The task of query optimization in modern relational database systems is important but can be computationally expensive. Parametric query optimization(PQO) has as its goal the prediction of optimal query execution plans based on historical results ...
Fan, Wei +5 more
core +2 more sources
Enhancing MongoDB query performance through index optimization [PDF]
E3S Web of ConferencesThis article delves into the critical aspect of enhancing query performance in MongoDB through meticulous index optimization. It begins with an introduction to MongoDB's unique document-oriented data storage approach and its inherent scalability, which ...
Nuriev Marat +4 more
doaj +1 more source
Simulation Subsumption or Déjà vu on the Web [PDF]
, 2008 Simulation unification is a special kind of unification adapted to retrieving semi-structured data on the Web. This article introduces simulation subsumption, or containment, that is, query subsumption under simulation unification. Simulation subsumption
A. Klug +6 more
core +2 more sources
Pipelining in multi-query optimization [PDF]
Journal of Computer and System Sciences, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DALVI, NILESH N +3 more
openaire +2 more sources
Multi-Query Optimization in Wide-Area Streaming Analytics
ACM Symposium on Cloud Computing, 2018 Wide-area data analytics has gained much attention in recent years due to the increasing need for analyzing data that are geographically distributed.
A. Jonathan, A. Chandra, J. Weissman
semanticscholar +1 more source
SPARQL Query Optimization Based on Longest Property Path Filtering [PDF]
Jisuanji gongcheng, 2018 A large number of intermediate results during executing SPARQL query greatly affect the query efficiency.For this,a query optimization method with two phases is proposed.In the first phase,it divides a query that contains the same variable into a block ...
LIN Xiaoqing,ZHANG Fu,CHENG Jingwei
doaj +1 more source
Optimization with Uniform Size Queries [PDF]
Algorithmica, 2016 Let \(f\) be a nonnegative, monotone, submodular set function over an \(n\)-element set \(U\). A \textit{value query} to \(f\) is a set \(S \subseteq U\) and its \textit{reply} is the value \(f(S)\). The authors study the following computational problem: given a positive integer \(k\) and \(f\) as above which can only be accessed using value queries of
Feige, Uriel, Tennenholtz, Moshe
openaire +1 more source
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 +3 more sources
Approximation schemes for many-objective query optimization [PDF]
SIGMOD Conference, 2014 The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conflicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario.
Immanuel Trummer, Christoph E. Koch
semanticscholar +1 more source
Trade-Offs Computing Minimum Hub Cover Toward Optimized Labeled Graph Query Processing
Online Academic Journal of Information Technology, 2018 As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization.
Hasan M. Jamil +3 more
doaj +1 more source