Download the full-sized PDF of Distributed Query Scheduling in The Context of DIOM: An ExperimentDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Computing Science, Department of


This file is in the following collections:

Technical Reports (Computing Science)

Distributed Query Scheduling in The Context of DIOM: An Experiment Open Access


Author or creator
Rachine, Kurill
Additional contributors
query optimization distributed object java
Type of item
Computing Science Technical Report
Computing science technical report ID
Technical report TR97-03. One of the key issues for query processing in distributed open environments is the query scheduling problem. Given a user query, after we know that there are n sources that are relevant to the answer of this query, the first issue we need to address is how to decompose the query into n subqueries, each targeting at one single source. The second issue is how to synchronize these n subqueries in the presence of inter-site joins. The third issue is how to package and assemble the results from n information sources according to the original query posed by the user. In this thesis, we discuss the first two issues in the context of DIOM, a distributed and interoperable query mediation system [L.Liu, Distributed and Parallel DB, Vol. 5, No. 2, 1997] Our main contribution is the systematic development of the two-tier distributed query scheduling framework that produces the relatively best query schedule according to the given combination of cost parameters, including the total query response time, the local query processing cost, and the communication cost. Our main focus is on queries that contain inter-site joins. The first tier is called the heuristic-driven query processing, which produces a heuristic-based optimal schedule. The second tier is referred to as the cost-driven query processing, which generates a cost-based optimal schedule. We implement a subset of our query scheduling algorithms in Java accessible from any Java-compliant GUI viewer such as Netscape 3.0. The URL for the demo is The most interesting features of our Java implementation is the functionality to allow users to trace the query scheduling process through trace program interface and the trace logs.
Date created
License information
Creative Commons Attribution 3.0 Unported

Citation for previous publication

Link to related item

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 2281799
Last modified: 2015:10:12 13:04:01-06:00
Filename: TR97-03.pdf
Original checksum: b93f46318aba06647b84dfb56d423d41
Well formed: true
Valid: true
Page count: 95
Activity of users you follow
User Activity Date