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
Date
1997-01-01
Author
Evrendilek, C
Doğaç, Asuman
Nural, S
Ozcan, F
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
51
views
0
downloads
Cite This
A 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 local database systems.
Subject Keywords
Multidatabases
,
Query optimization
,
Heterogeneity
URI
https://hdl.handle.net/11511/62876
Journal
DISTRIBUTED AND PARALLEL DATABASES
DOI
https://doi.org/10.1023/a:1008674905987
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Improving the performance of Hadoop/Hive by sharing scan and computation tasks
Özal, Serkan; Toroslu, İsmail Hakkı; Doğaç, Asuman; Department of Computer Engineering (2013)
MapReduce is a popular model of executing time-consuming analytical queries as a batch of tasks on large scale data. During simultaneous execution of multiple queries, many oppor- tunities can arise for sharing scan and/or computation tasks. Executing common tasks only once can reduce the total execution time of all queries remarkably. Therefore, we propose to use Multiple Query Optimization (MQO) techniques to improve the overall performance of Hadoop Hive, an open source SQL-based distributed warehouse sy...
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...
Using object-oriented materialized views to answer selection-based complex queries
Alhajj, R; Polat, Faruk (1999-09-01)
Presented in this paper is a model that utilizes existing materialized views to handle a wide range of complex selection-based queries, including linear recursive queries. Such queries are complex because it is almost impossible for naive users to predict the formulation of their predicate expressions. Object variables bound to objects in the result of a query are allowed to appear in the predicate of that query. Also, the predicate definition is extended to make it possible to have in the output only a sub...
HyGraph: a subgraph isomorphism algorithm for efficiently querying big graph databases
Asiler, Merve; Yazıcı, Adnan; George, Roy (2022-04-01)
The big graph database provides strong modeling capabilities and efficient querying for complex applications. Subgraph isomorphism which finds exact matches of a query graph in the database efficiently, is a challenging problem. Current subgraph isomorphism approaches mostly are based on the pruning strategy proposed by Ullmann. These techniques have two significant drawbacks- first, they are unable to efficiently handle complex queries, and second, their implementations need the large indexes that require ...
Automated integration of real-time and non-real-time defense systems
Dalkiran, Emre; Onel, Tolga; Oğuztüzün, Mehmet Halit S.; Demir, Kadir Alpaslan (2021-04-01)
Various application domains require the integration of distributed real-time or near-real-time systems with non-real-time systems. Smart cities, smart homes, ambient intelligent systems, or network-centric defense systems are among these application domains. Data Distribution Service (DDS) is a communi-cation mechanism based on Data-Centric Publish-Subscribe (DCPS) model. It is used for distributed systems with real-time operational constraints. Java Message Service (JMS) is a messaging standard for enterpr...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Evrendilek, A. Doğaç, S. Nural, and F. Ozcan, “Multidatabase query optimization,”
DISTRIBUTED AND PARALLEL DATABASES
, pp. 77–114, 1997, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62876.