Learn More
We consider the problem of finding a spanning tree that maximizes the number of leaves (MaxLeaf). We provide a 3/2-approximation algorithm for this problem when restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(G), and construct a tree with at least (n−x(G)+4)/3(More)
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum diierence between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly-sharp bounds on the change in edge-bandwidth(More)
Business Data always growth from kilo byte, mega byte, giga byte, tera byte, peta byte, and so far. There is no way to avoid this increasing rate of data till business still running. Because of this issue, database tuning be critical part of a information system. Tuning a database in a cost-effective manner is a growing challenge. The total cost of(More)
Database administrators should be aware of resource usages to maintain database system performance. As database applications become more complex and diverse, managing database systems becomes too costly and prone to error. Autonomic database tuning becomes more important than ever. One of the major issues to address in regards to ORACLE database performance(More)
The efficient use of primary memory is one of the major key for the good performance achieved from the any kind of server. The management of the various components stored in the main memory is the key challenge to get the desired throughput from an application running on the server. As we know the DBMS mostly works on client-server architecture. So the(More)