A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
Plan Selection based on Query Clustering
[chapter]
2002
VLDB '02: Proceedings of the 28th International Conference on Very Large Databases
Preserved Fulltext
Query similarity is evaluated based on a comparison of query structures and the associated table schemas and statistics, and a classifier is employed for efficient cluster assignments. ...
Our scheme groups similar queries into clusters and uses the optimizer-generated plan for the cluster representative to execute all future queries assigned to the cluster. ...
To the best of our knowledge, the work described here represents the first research initiative on clustering-based plan selection. ...
doi:10.1016/b978-155860869-6/50024-x
dblp:conf/vldb/GhoshPSH02
fatcat:4r6d7rxodncxbfidvjvimw6kqq
Green Query OptimizationTaming Query Optimization Overheads through Plan Recycling
[chapter]
2004
Proceedings 2004 VLDB Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
a decision-tree-based query classifier. ...
The tool groups similar queries into clusters and uses the optimizer-generated plan for the cluster representative to execute all future queries assigned to the cluster. ...
A new Plan Analyzer module, 2 The diagram is based on plan selections obtained with the IBM DB2 query optimizer. ...
doi:10.1016/b978-012088469-8/50140-6
fatcat:bzva3ksw45g35ekjgd2ha3xt24
A technique for parallel query optimization using MapReduce framework and a semantic-based clustering method
2021
PeerJ Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Query optimization is the process of identifying the best Query Execution Plan (QEP). The query optimizer produces a close to optimal QEP for the given queries based on the minimum resource usage. ...
To produce an effective query plan thus requires examining a large number of alternative plans. ...
The primary goal of the access plan recommendation approach is to reuse the previous query plans based on the likeness of query statements. ...
doi:10.7717/peerj-cs.580
pmid:34141897
pmcid:PMC8176525
fatcat:arq5tbi5vvcerjtg6lfvj6boa4
An analysis of execution plans in query optimization
2012
2012 International Conference on Communication, Information & Computing Technology (ICCICT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The process of selecting one execution plan from potentially many possible plans i s referred to as query optimization. ...
The paper describes the design of query optimizer w ith four basic phases such as Query Analysis, Index Selection Join Selection and Plan Selection. ...
If the query is non-trivial, the optimizer will perform cost-based calculation to select a plan. For this purpose, optimizer relies on statistics of the execution plan [7]. ...
doi:10.1109/iccict.2012.6398216
fatcat:xtywwxnba5hbzblsyc3y3e6654
PLASTIC
2003
Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The tool is based on the observation that even queries which differ in projection, selection and join predicates, as also in the base tables themselves, may still have identical plan templates, that is ...
Lastly, since the association of queries with clusters is based on database statistics, the plan choice for a given query is adaptive to the current state of the database. ...
doi:10.1145/872864.872867
fatcat:n3ig3g2cgnab7m3kp4mox53r7y
PLASTIC
2003
Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The tool is based on the observation that even queries which differ in projection, selection and join predicates, as also in the base tables themselves, may still have identical plan templates, that is ...
Lastly, since the association of queries with clusters is based on database statistics, the plan choice for a given query is adaptive to the current state of the database. ...
doi:10.1145/872757.872867
dblp:conf/sigmod/SengarH03
fatcat:jfeurs6zqrfshp2zzk67ime3r4
Parametric Plan Caching Using Density-Based Clustering
2012
2012 IEEE 28th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A better alternative is to harvest the optimizer's plan choice for different parameter values, populate the cache with promising query plans, and select a cached plan based upon current parameter values ...
The clustering algorithm is density-based, and it exploits locality-sensitive hashing as a pre-processing step so that clusters in the plan spaces can be efficiently stored in database histograms and queried ...
Based on the actual values of parameters, the appropriate plan is selected during query execution [3] . ...
doi:10.1109/icde.2012.57
dblp:conf/icde/AlucDB12
fatcat:kvbafoc3vnbpbejyzs5pidr2k4
Reducing Run-time Execution in Query Optimization
2014
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The order of accessing a source table is very important during query execution. The best execution plan from possible ones is presented by Query optimizer. ...
The paper discusses various stages of query optimization using execution plan. It gives the analysis of indexes, type of expressions & joins used in the execution plan of the query. ...
Otherwise, the optimizer will do cost based calculation to plan selection in case of non-trivial query. For carrying out this, optimizer depends upon on statistics of the execution plan [11] . ...
doi:10.5120/16795-6505
fatcat:be5j7vdumzeatkr5firw4e4roy
OPTIMISATION ANALYSIS OF TRANSACT-SQL QUERIES BASED ON INDEXES
2017
Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The object of the research were SELECT queries, which consequently returned the desired set of output data. ...
The article presents a discussion of the optimisation methods involving the modification of query syntax on the example of the use of indexes that served for the application of the methods in practice, ...
The aim of the article is to present the query optimisation in the Transact-SQL language, based on selected queries using indexes. ...
doi:10.5604/01.3001.0010.5210
fatcat:c3ixuuj6dvcjzmugppr5u4rffq
Efficient Optimization of Multiple SPARQL Queries
2013
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
rules for the clustered group and finally Query execution provide the final result of optimized query. ...
We investigate the foundations of SPARQL query optimization by grouping into individual clusters using common substructures in the multiple SPARQL queries, propose a comprehensive set of query rewriting ...
There may be many plans to find the best strategy. Cost based query optimizers evaluate the resource of various query plans and use the basis for plan selection using algorithms. ...
doi:10.9790/0661-08697101
fatcat:ddlrh7vg3fdd7j6qtjbyhmzxpq
The MemSQL query optimizer
2016
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
needs to be distribution-aware in choosing join plans, applying query rewrites, and costing plans. ...
These applications require not only rapid data ingest, but also quick answers to analytical queries operating on the latest data. ...
ACKNOWLEDGEMENTS We would like to thank the anonymous reviewers for their feedback on this paper. ...
doi:10.14778/3007263.3007277
fatcat:gbbm7sr6e5gnfiq2q4jrhimqs4
EFFICIENT APPROACH FOR VIEW SELECTION FOR DATA WAREHOUSE USING TREE MINING AND EVOLUTIONARY COMPUTATION
2018
Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. ...
There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. ...
The views have been selected based on a reduction in the combined query processing and view maintenance cost. ...
doi:10.7494/csci.2018.19.4.3006
fatcat:rq3djpx6s5duza7y7kwm6fnoia
Hybrid Metaheuristics Web Service Composition Model for QoS Aware Services
2022
Computer systems science and engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Followed by, the fuzzy subtractive clustering (FSC) will select the best composition plan from the available composite plans. ...
It aims to determine a set of location based services (LBS) which cover all client intended activities quantified in the query. ...
Based Optimal Composition Plan Selection Model Once the set of WS composition plans are generated, the FSC technique gets executed to choose an optimal web service from the existing ones. ...
doi:10.32604/csse.2022.020352
fatcat:6egjnfjmxneo5ojdtn66yxbalm
DESIGN OF FILE SYSTEM ARCHITECTURE WITH CLUSTER FORMATION ALONG WITH MOUNT TABLE
2014
International Journal of Research in Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The cluster formation is an intelligent formation which works on keyword based feature analysis on files. The related files are kept in one cluster. ...
Then upon selection of one particular file, the whole content of that file is displayed. ...
In the second phase the user query is processed and the keyword extraction is performed. Based on keyword analysis the cluster will be selected and the query is performed on that specific cluster. ...
doi:10.15623/ijret.2014.0306077
fatcat:nnetuhxm5nh4rebbzz4dcfe5za
A Distributed Stream Query Optimization Framework through Integrated Planning and Deployment
2009
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus, the selection of an optimal execution plan in such dynamic and networked computing systems must consider operator ordering, reuse, network placement, and search space reduction. ...
We argue that the static query optimization approach of "plan, then deployment" is inadequate for handling distributed queries involving multiple streams and node dynamics faced in distributed data stream ...
plan, both in terms of cluster coordinator selection and distributed query planning. ...
doi:10.1109/tpds.2008.232
fatcat:d6q5souktvfxxhmxu7vdya4swe
« Previous
Showing results 1 — 15 out of 88,065 results