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.
Filters
A Model for Building Dynamic Indexes & Storage and Re-use of Optimal Query Plans Generated thru Progressive Optimization (POP)
2012
International Journal of Machine Learning and Computing
Preserved Fulltext
This paper proposes a Model for building Dynamic Indexes & Storage and Re-Use of Optimal Query plans generated thru Progressive Optimization (POP) for performance gains. ...
and also store and re-use of Optimal Query Plans generated thru Progressive Query Optimization (POP). ...
Storing and re-using of Optimal Query plans that are generated by POP [1, 2] . ...
doi:10.7763/ijmlc.2012.v2.170
fatcat:3ivwkevj6ffa5dcwyrqovtivvm
Dynamic query re-optimization
Proceedings. Eleventh International Conference on Scientific and Statistical Database Management
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 2007; you can also visit the original URL.
The file type is application/pdf.
To r emedy this situation, we have designed a novel approach to re-optimize suboptimal query plan con gurations onthe-y with Conquest | an extensible and distributed query processing system. ...
A dynamic optimizer considers recon guration cost as well as execution cost in determining the best query plan con guration. Experimental results are p r esented. ...
Overview
Dynamic Re-optimization Dynamic optimization mechanisms use up-to-date system con guration, system loads, and query execu-tion information to re-optimize query execution plans on-the-y. ...
doi:10.1109/ssdm.1999.787642
dblp:conf/ssdbm/NgWMN99
fatcat:wc35smtnv5gzdmt33zk6u773la
Efficient mid-query re-optimization of sub-optimal query execution plans
1998
Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD '98
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.
For a number of reasons, even the best query optimizers can very often produce sub-optimal query execution plans, leading to a significant degradation of performance. ...
In this paper, we describe an algorithm that detects sub-optimality of a query execution plan during query execution and attempts to correct the problem. ...
However, there are a number of queries for which Dynamic Re-Optimization does not help. ...
doi:10.1145/276304.276315
dblp:conf/sigmod/KabraD98
fatcat:ufw4pdeglfdmlfcw557ij7tjp4
Efficient mid-query re-optimization of sub-optimal query execution plans
1998
SIGMOD record
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.
For a number of reasons, even the best query optimizers can very often produce sub-optimal query execution plans, leading to a significant degradation of performance. ...
In this paper, we describe an algorithm that detects sub-optimality of a query execution plan during query execution and attempts to correct the problem. ...
However, there are a number of queries for which Dynamic Re-Optimization does not help. ...
doi:10.1145/276305.276315
fatcat:2teapr2s7ndexmlzndvi47r2oy
Efficient optimization and processing for distributed monitoring and control applications
2012
Proceedings of the on SIGMOD/PODS 2012 PhD Symposium - PhD '12
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 2015; you can also visit the original URL.
The file type is application/pdf.
, and 3) as ongoing work, incorporating the cost estimation of plan switching during query re-optimization. ...
In particular, we make the following contributions: 1) supporting the maintenance of recursive queries over distributed data streams, 2) enabling full-fledged cost-based incremental query re-optimization ...
of plan switching during query re-optimization. ...
doi:10.1145/2213598.2213615
dblp:conf/sigmod/Liu12
fatcat:6hzc4ilrcbap5b75oc6uej74he
Revisiting Runtime Dynamic Optimization for Join Queries in Big Data Management Systems
[article]
2020
arXiv
pre-print
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.
Other Versions
The intermediate result created from each stage is used to re-optimize the remaining query. ...
Query Optimization remains an open problem for Big Data Management Systems. ...
Particularly, the four joins introduce two re-optimization points before the remaining query has only two joins and there is no need for further re-optimization. ...
arXiv:2010.00728v2
fatcat:lk4fldfrovewvncqstto4qyegq
Integrating clusters created offline with query-specific clusters for document retrieval
2009
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '09
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.
Previous work on cluster-based document retrieval has used either static document clusters that are created offline, or query-specific (dynamic) document clusters that are created from top-retrieved documents ...
The value of λ is chosen for each re-ranking method from {0, 0.1, . . . , 0.9} to optimize p@5. ...
RETRIEVAL FRAMEWORK Let q, d, and D denote a query, a document, and a corpus, respectively. Dynamic clusters have been used for the re-ranking task [6, 4, 2] . ...
doi:10.1145/1571941.1572088
dblp:conf/sigir/MeisterKK09
fatcat:zzyknmmk35babmllmb6kqeeaye
Evolution of Query Optimization Methods
[chapter]
2009
Lecture Notes in 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 2017; you can also visit the original URL.
The file type is application/pdf.
Query optimization is the most critical phase in query processing. ...
We point out a set of parameters to characterize and compare query optimization methods, mainly: (i) size of the search space, (ii) type of method (static or dynamic), (iii) modification types of execution ...
of resource allocation, and (iii) the dynamic query re-optimization. ...
doi:10.1007/978-3-642-03722-1_9
fatcat:uzhmfy5iq5gajodcpj6ixpj5qy
Continuous Query for QoS-Aware Automatic Service Composition
2012
2012 IEEE 19th International Conference on Web Services
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.
In this paper, we propose an event driven continuous query algorithm for QoS-aware automatic service composition problem to cope with different types of dynamic services. ...
Therefore, a support for efficiently handling "continuous" service composition queries is desired. ...
services in a random order, and re-query approach (Re-Query) that we re-execute one-time query whenever a dynamic service is reported. ...
doi:10.1109/icws.2012.44
dblp:conf/icws/JiangHLGL12
fatcat:lnfcv66oqvdp5fcpfdzmb55qye
Database Placement On Large-Scale Systems
2007
Zenodo
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.
In this paper, we propose a dynamic database placement policy that depends on query patterns and Grid sites capabilities. ...
The obtained results show that dynamic database placement can significantly improve the performance of distributed query processing. ...
Section 2 discusses the new challenges that arise when we integrate database placement policies with query optimization in large-scale and dynamic systems. ...
doi:10.5281/zenodo.1062219
fatcat:paz6arsp3faovau57njosipela
Dynamic information retrieval optimization using mobile agents
2003
Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '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 2017; you can also visit the original URL.
The file type is application/pdf.
These methods involve re-writing of the query execution graph so each mobile agent retrieves its requested data in an optimized order, thus minimizing total data transfer size. ...
We have developed a system by which the advantages of mobile agents are leveraged to optimize data retrieval by dynamically optimizing the retrieval strategy as it is carried out. ...
We have enhanced ACQUIRE to a system in which the advantages of mobile agents are leveraged to optimize data retrieval by dynamically optimizing the retrieval strategy as it is carried out. ...
doi:10.1145/860722.860749
fatcat:73c5ofrzrjhh7lth7zaqv6uawy
Dynamic information retrieval optimization using mobile agents
2003
Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '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 2017; you can also visit the original URL.
The file type is application/pdf.
These methods involve re-writing of the query execution graph so each mobile agent retrieves its requested data in an optimized order, thus minimizing total data transfer size. ...
We have developed a system by which the advantages of mobile agents are leveraged to optimize data retrieval by dynamically optimizing the retrieval strategy as it is carried out. ...
We have enhanced ACQUIRE to a system in which the advantages of mobile agents are leveraged to optimize data retrieval by dynamically optimizing the retrieval strategy as it is carried out. ...
doi:10.1145/860575.860749
dblp:conf/atal/DasSW03
fatcat:vu3o6tmbsfeijcjihsrbxwfaqq
RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking
[article]
2021
arXiv
pre-print
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.
During the dynamic distillation, the retriever and the re-ranker can be adaptively improved according to each other's relevance information. ...
A major contribution is that we introduce the dynamic listwise distillation, where we design a unified listwise training approach for both the retriever and the re-ranker. ...
Finally, we preform dynamic listwise distillation to jointly optimize the retriever and re-ranker following Section 3.2. ...
arXiv:2110.07367v1
fatcat:7ahhprvsgzeadastbndp4qavpa
Decentralized Dynamic Query Optimization based on Mobiles Agents for Large Scale Data Integration Systems
2012
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.
In this paper, we propose an execution model based on mobile agents for the distributed dynamic query optimization. ...
The query processing in large scale distributed mediations systems raises new problems and presents real challenges: efficiency of access, communication, confidentiality of access, availability of data ...
scheduling, (iii): re-optimization, and (iv) uses of dynamic operators. ...
doi:10.5120/9710-4172
fatcat:67fbnnwlnbhk3j4giwlbw2b42u
JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing
[article]
2022
arXiv
pre-print
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.
This paper contributes new methods for: (1) efficient initialization of the data synopsis in the presence of incoming data, (2) maintenance of the data synopsis under insertions/deletions, and (3) re-optimization ...
We present JanusAQP, a new dynamic AQP system, which supports SUM, COUNT, AVG, MIN, and MAX queries under insertions and deletions to the dataset. ...
Even classical stratified samples may have to be periodically re-optimized and re-balanced based on query and workload shifts [4] . ...
arXiv:2204.09235v1
fatcat:phtkbg7gyvauhf22isphf7cyr4
« Previous
Showing results 1 — 15 out of 94,980 results