Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Dynamic query optimization on a distributed object management platform
Download
056760.pdf
Date
1996
Author
Özcan, Fatma
Metadata
Show full item record
Item Usage Stats
62
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/11690
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Dynamic constraint satisfaction algorithm for reconfiguration of feature models
Entekhabi, Sina; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2018)
Dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. Features are assumed to be mapped to system's components that realize them. A feature model corresponds to a constraint satisfaction problem (CSP), and determines the ...
Dynamic constraint satisfaction algorithm for online feature model reconfiguration
Oğuztüzün, Mehmet Halit S.; Entekhabi, Sina (2019-07-01)
Dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. An emerging situation in the environment can lead to some relevant changes to the current configuration: some features must be activated, and some must be deactivated....
DYNAMIC ANALYSIS AND INTERPRETER IMPLEMENTATION OF REAL TIME RULE BASED DSL WITH CEP CAPABILITY
Özcan, Muhammet Oğuz; Doğru, Ali Hikmet (2015-11-01)
Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Database Queries
Dokeroglu, Tansel; Coşar, Ahmet (2011-09-28)
In this paper, we introduce and evaluate a new query optimization algorithm based on Dynamic Programming (DP) and Ant Colony Optimization (ACO) metaheuristic for distributed database queries. DP algorithm is widely used for relational query optimization, however its memory, and time requirements are very large for the query optimization problem in a distributed database environment which is an NP-hard combinatorial problem. Our aim is to combine the power of DP with heuristic approaches so that we can have ...
Dynamic programming for a Markov-switching jump-diffusion
Azevedo, N.; Pinheiro, D.; Weber, Gerhard Wilhelm (Elsevier BV, 2014-09-01)
We consider an optimal control problem with a deterministic finite horizon and state variable dynamics given by a Markov-switching jump-diffusion stochastic differential equation. Our main results extend the dynamic programming technique to this larger family of stochastic optimal control problems. More specifically, we provide a detailed proof of Bellman's optimality principle (or dynamic programming principle) and obtain the corresponding Hamilton-Jacobi-Belman equation, which turns out to be a partial in...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. Özcan, “Dynamic query optimization on a distributed object management platform,” Middle East Technical University, 1996.