Results 241 to 250 of about 2,495,219 (292)
Multi-Query Optimization for Subgraph Isomorphism Search
Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time approaches: Optimizing and answering each query separately. When multiple queries arrive at the same time, sequential processing is not always the most efficient.
Junhu Wang, Xuguang Ren
exaly +2 more sources
Given a query, there are many access plans that a database management sys-tem (DBMS) can follow to process it and produce its answer. All plans are equiv-alent in terms of their final output but vary in their cost, that is, the amount of time that they ...
Yannis E. Ioannidis
openaire +2 more sources
Multi-Objective Parametric Query Optimization
We propose a generalization of the classical database query optimization problem: multi-objective parametric query (MPQ) optimization. MPQ compares alternative processing plans according to multiple execution cost metrics.
Immanuel Trummer, Christoph Koch
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Vertica Query Optimizer: The case for specialized query optimizers
2014 IEEE 30th International Conference on Data Engineering, 2014The Vertica SQL Query Optimizer was written from the ground up for the Vertica Analytic Database. Its design and the tradeoffs we encountered during its implementation argue that the full power of novel database systems can only be realized with a carefully crafted custom Query Optimizer written specifically for the system in which it operates.
Nga Tran 0001 +4 more
openaire +2 more sources
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 ...
GUPTA, A, SUDARSHAN, S, VISHWANATHAN, S
openaire +2 more sources
Multidatabase Query Optimization
Distributed and Parallel Databases, 1997A multidatabase system (MDBS) allows the users to simultaneously access heterogeneous, and autonomous databases using an integrated schema and a single global query language. The query optimization problem in MDBSs is quite different from the query optimization problem in distributed homogeneous databases due to schema heterogeneity and autonomy of ...
Cem Evrendilek +3 more
openaire +2 more sources
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
Progressive Query Optimization for Federated Queries
2006Database Management Systems (DBMS) perform query plan selection by mathematically modeling the execution cost of candidate execution plans and choosing the cheapest query execution plan (QEP) according to that cost model. The cost model requires accurate estimates of the sizes of intermediate results of all steps in the QEP.
Stephan Ewen +3 more
openaire +1 more source

