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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Multidatabase query optimization
Download
056563.pdf
Date
1996
Author
Evrendilek, Cem
Metadata
Show full item record
Item Usage Stats
114
views
200
downloads
Cite This
Subject Keywords
Distributed data bases.
,
Query optimization.
URI
https://hdl.handle.net/11511/1040
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
An Evolutionary Genetic Algorithm for Optimization of Distributed Database Queries
Sevinc, Ender; Coşar, Ahmet (2011-05-01)
High-performance low-cost PC hardware and high-speed LAN/WAN technologies make distributed database (DDB) systems an attractive research area where query optimization and DDB design are the two important and related problems. Since dynamic programming is not feasible for optimizing queries in a DDB, we propose a new genetic algorithm (GA)-based query optimizer (new genetic algorithm (NGA)) and compare its performance with random and optimal (exhaustive) algorithms. We perform experiments on a synthetic data...
Manipulation of history and language in three dystopias
Ersoy, Duygu; Deveci, Cem; Department of Political Science and Public Administration (2006)
In this study, the manipulations of history and language in the dystopias of “Nineteen Eighty-Four” by George Orwell, “We” by Yevgeni Zamyatin and “Brave New World” by Aldous Huxley are examined. The principal aim of this investigation is to demonstrate that in these imaginary societies absolute stability is achieved through the manipulations of these two domains. The thesis argues that if the domains of history and language are not taken under control, they are to provide the subjects with the standard of ...
A critical examination of two "socialist" utopias: "Looking Backward" and "News From Nowhere"
Koç, Yasemin; Deveci, Cem; Department of Political Science and Public Administration (2008)
This study examines two ‘socialist’ utopias of the late 19th century: W. Morris’s News from Nowhere and E. Bellamy’s Looking Backward. The major concern is to question the validity of title ‘socialist’ for these two texts. The reference points for such an analysis are: modernity, Marxism of the late 19th century and the practice of discipline. In this context, the intention is to find out ruptures and continuities with respect to the central ideas of socialism and basic premises of modernity. The study expl...
Oblivious video watermaking using temporal sensitivity of HVS
Koz, A; Alatan, Abdullah Aydın (2004-04-30)
An oblivious video watermarking method is presented based on the temporal sensitivity of Human Visual System (HVS). The method exploits the temporal contrast thresholds of HVS to determine the maximum strength of watermark, which still gives imperceptible distortion after watermark insertion. Compared to other approaches in the literature, the method guarantees to avoid flickering problem in the watermarked video and gives better robustness results to video distortions, such as additive Gaussian noise, H.26...
A Cost-Aware Strategy for Query Result Caching in Web Search Engines
Altıngövde, İsmail Sengör; Ulusoy, Oezguer (2009-01-01)
Search engines and large scale IR systems need to cache query results for efficiency and scalability purposes. In this study, we propose to explicitly incorporate the query costs in the static caching policy. To this end, a query’s cost is represented by its execution time, which involves CPU time to decompress the postings and compute the query-document similarities to obtain the final top-N answers. Simulation results using a large Web crawl data and a real query log reveal that the proposed strategy impr...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Evrendilek, “Multidatabase query optimization,” Ph.D. - Doctoral Program, Middle East Technical University, 1996.