An optimization of queries in distributed database systems

This paper addresses the processing of a query in distributed database systems using a sequence of semijoins. The objective is to minimize the intersite data traffic incurred by a distributed query. A method is developed which accurately and efficiently estimates the size of an intermediate result of a query. This method provides the basis of the query optimization algorithm. Since the distributed query optimization problem is known to be intractable, a heuristic algorithm is developed to determine a low-cost sequence of semijoins. The cost comparison with an existing algorithm is provided. The complexity of the main features of the algorithm is analytically derived. The scheduling time for sequences of semijoins is measured for example queries using the PASCAL program which implements the algorithm. All rights of reproduction in any form reserved.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26357/1/0000444.pd

On the Handling of Continuous-Valued Attributes in Decision Tree Generation

We present a result applicable to classification learning algorithms that generate decision trees or rules using the information entropy minimization heuristic for discretizing continuous-valued attributes. The result serves to give a better understanding of the entropy measure, to point out that the behavior of the information entropy heuristic possesses desirable properties that justify its usage in a formal sense, and to improve the efficiency of evaluating continuous-valued attributes for cut value selection. Along with the formal proof, we present empirical results that demonstrate the theoretically expected reduction in evaluation effort for training data sets from real-world domains.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46964/1/10994_2004_Article_422458.pd

Subgoal ordering and goal augmentation for heuristic problem solving

http://deepblue.lib.umich.edu/bitstream/2027.42/5685/5/bac5059.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/5685/4/bac5059.0001.001.tx

A system for the solution of simple stochastic networks

http://deepblue.lib.umich.edu/bitstream/2027.42/5689/5/bac5224.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/5689/4/bac5224.0001.001.tx

A relational model of data for the determination of optimum computer storage structures

http://deepblue.lib.umich.edu/bitstream/2027.42/7212/5/bad1089.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/7212/4/bad1089.0001.001.tx

Network models for the conversational design of Stochastic service systems : technical report 13.

http://deepblue.lib.umich.edu/bitstream/2027.42/8182/5/bad7136.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/8182/4/bad7136.0001.001.tx

A methodology for the administration of databases

http://deepblue.lib.umich.edu/bitstream/2027.42/6953/5/bad0530.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/6953/4/bad0530.0001.001.tx

The optimal design of central processor data paths

http://deepblue.lib.umich.edu/bitstream/2027.42/6505/5/bac8525.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/6505/4/bac8525.0001.001.tx

Network models for the conversational design of Stochastic service systems : technical report SEL-68-30.

http://deepblue.lib.umich.edu/bitstream/2027.42/8181/5/bad7546.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/8181/4/bad7546.0001.001.tx