Package edu.brown.designer

Examples of edu.brown.designer.DesignerVertex

99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
        agraph = AccessGraphGenerator.convertToSingleColumnEdges(catalog_db, agraph);

       
        // Make sure that there is at least one edge between DISTRICT and all other tables
        Table target = this.getTable("DISTRICT");
        DesignerVertex v0 = agraph.getVertex(target);
        assertNotNull(v0);
       
        String expected[] = { "ORDER_LINE", "STOCK" };
        for (String tbl_name : expected) {
            Table catalog_tbl = this.getTable(tbl_name);
            DesignerVertex v1 = agraph.getVertex(catalog_tbl);
            assertNotNull(v1);
           
            Collection<DesignerEdge> edges = agraph.findEdgeSet(v0, v1);
            assertNotNull(edges);
            if (edges.isEmpty()) {
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
        agraph.setVerbose(true);
       
        Table catalog_tbl = this.getTable("STOCK");
        Column catalog_col = this.getColumn(catalog_tbl, "S_W_ID");
       
        DesignerVertex v = agraph.getVertex(catalog_tbl);
        assertNotNull(v);
        Collection<DesignerEdge> edges = agraph.findEdgeSet(v, catalog_col);
        assertNotNull(edges);
        assert(agraph.getEdgeCount() != edges.size());
    }
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
179
180
        new AccessGraphGenerator(this.info, this.catalog_proc).generate(agraph1);
       
        // Make sure that all of the weights are the same
        for (DesignerEdge e0 : agraph0.getEdges()) {
            List<DesignerVertex> vertices0 = new ArrayList<DesignerVertex>(agraph0.getIncidentVertices(e0));
            DesignerVertex v1_0  = agraph1.getVertex(vertices0.get(0).getCatalogKey());
            assertNotNull("Missing vertex " + vertices0.get(0), v1_0);
            DesignerVertex v1_1  = agraph1.getVertex(vertices0.get(1).getCatalogKey());
            assertNotNull("Missing vertex " + vertices0.get(1), v1_1);
           
            DesignerEdge e1 = agraph1.findEdge(v1_0, v1_1);
            assertNotNull("Missing edge " + e0, e1);
           
View Full Code Here
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
        assert(this.agraph.getVertexCount() > 0);
        assert(this.agraph.getEdgeCount() > 0);
       
        // Make sure that there is an edge between STOCK and ORDER_LINE
        Table tbl0 = this.getTable("STOCK");
        DesignerVertex v0 = this.agraph.getVertex(tbl0);
        assertNotNull(v0);
       
        Table tbl1 = this.getTable("ORDER_LINE");
        DesignerVertex v1 = this.agraph.getVertex(tbl1);
        assertNotNull(v1);
       
        DesignerEdge edge = this.agraph.findEdge(v0, v1);
        assertNotNull("No edge exists between " + tbl0 + " and " + tbl1, edge);
    }
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
       
        // We should now have a complete graph between the following tables
        String tables[] = { "ORDER_LINE", "DISTRICT", "STOCK" };
        for (int i = 0; i < tables.length; i++) {
            Table t0 = this.getTable(tables[i]);
            DesignerVertex v0 = agraph.getVertex(t0);
            assertNotNull(v0);           
           
            for (int ii = i + 1; ii < tables.length; ii++) {
                Table t1 = this.getTable(tables[ii]);
                assertNotSame(t0, t1);
                DesignerVertex v1 = agraph.getVertex(t1);
                assertNotNull(v1);
                assertNotNull(agraph.findEdge(v0, v1));
            } // FOR
        } // FOR
    }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
        this.generator.generate(agraph);
        assert(agraph.getVertexCount() > 0);
       
        // Make sure it has a vertex for HISTORY
        Table catalog_tbl = this.getTable("HISTORY");
        DesignerVertex v = agraph.getVertex(catalog_tbl);
        assertNotNull(v);
       
        // And make sure that it has edges
        agraph.setVerbose(true);
        Collection<DesignerEdge> edges = agraph.getIncidentEdges(v);
        assertFalse(edges.isEmpty());
       
        Set<Table> expected = new HashSet<Table>();
        CollectionUtil.addAll(expected, this.getTable("WAREHOUSE"),
                                        this.getTable("DISTRICT"),
                                        this.getTable("CUSTOMER"));
        Set<Table> actual = new HashSet<Table>();
        for (DesignerEdge e : edges) {
            DesignerVertex other_v = agraph.getOpposite(v, e);
            assertNotNull(other_v);
            Table other_tbl = other_v.getCatalogItem();
            assertNotNull(other_tbl);
            if (other_tbl.equals(catalog_tbl)) {
                assertEquals(v, other_v);
            } else {
                assert(expected.contains(other_tbl)) : other_tbl;
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
//        System.err.println("Dumping AccessGraph to " + FileUtil.writeStringToFile("/tmp/single_tpcc.dot", GraphvizExport.export(single_agraph, "tpcc")));

        // Make sure that it has all of our tables except HISTORY
        for (Table catalog_tbl : catalogContext.getDataTables()) {
            if (catalog_tbl.getName().equalsIgnoreCase("HISTORY")) continue;
            DesignerVertex v = single_agraph.getVertex(catalog_tbl);
            assertNotNull(catalog_tbl.getName(), v);
            System.err.println(catalog_tbl + ": " + v);
        } // FOR
       
        // Make a new ColumnSet that combines all the ColumnSets of all edges in the original AccessGraph
        DesignerVertex v0, v1;
        Collection<DesignerEdge> edges;
        boolean found = false;
        for (Table catalog_tbl0 : catalog_db.getTables()) {
            try {
                v0 = agraph.getVertex(catalog_tbl0);
View Full Code Here
221
222
223
224
225
226
227
228
229
230
231
232
233
        };
       
        this.generator.generate(agraph);
        for (int i = 0, cnt = expected.length; i < cnt; i++) {
            Pair<Table, Table> search = expected[i];
            DesignerVertex v0 = agraph.getVertex(search.getFirst());
            assertNotNull("[" + i + "]: " + search.toString(), v0);
            DesignerVertex v1 = agraph.getVertex(search.getSecond());
            assertNotNull("[" + i + "]: " + search.toString(), v1);

            DesignerEdge found = agraph.findEdge(v0, v1);
            assertNotNull("[" + i + "]: " + search.toString() + "\n", found);
//            System.err.println("REMOVED: " + search + " [" + found + "]");
View Full Code Here
203
204
205
206
207
208
209
210
211
212
213
        // Gather all the information we need about each table
        for (Table catalog_tbl : PartitionerUtil.generateTableOrder(info, this.agraph, hints)) {

            // Ignore this table if it's not used in the AcessGraph
            DesignerVertex v = null;
            try {
                v = this.agraph.getVertex(catalog_tbl);
            } catch (IllegalArgumentException ex) {
                // IGNORE
            }
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
                    DependencyGraph dgraph = (DependencyGraph) this.getGraph();

                    if (agraph.containsVertex(element)) {
                        for (DesignerVertex child : dgraph.getSuccessors(element)) {
                            Table child_tbl = child.getCatalogItem();
                            DesignerVertex child_vertex = this.getGraph().getVertex(child_tbl);

                            if (agraph.containsVertex(child_vertex)) {
                                for (DesignerEdge edge : agraph.findEdgeSet(element, child_vertex)) {
                                    Double orig_weight = vertex_weights.get(child_tbl);
                                    if (orig_weight == null)
View Full Code Here
TOP

Related Classes of edu.brown.designer.DesignerVertex

  • edu.brown.catalog.CatalogInfo
  • edu.brown.designer.generators.AccessGraphGenerator
  • edu.brown.designer.generators.DependencyGraphGenerator
  • edu.brown.designer.generators.PartitionPlanTreeGenerator
  • edu.brown.designer.generators.ReplicationTreeGenerator
  • edu.brown.designer.generators.TestAccessGraphGenerator
  • edu.brown.designer.generators.TestAccessGraphGenerator2
  • edu.brown.designer.partitioners.ConstraintPropagator
  • edu.brown.designer.partitioners.HeuristicPartitioner
  • edu.brown.designer.partitioners.LNSPartitioner
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.