Examples of edu.brown.utils.PredicatePairs.debug()

edu.brown.utils.PredicatePairs.debug()

            PredicatePairs cset = table_csets.get(table_pair);


            if (t) {
                LOG.trace("Vertex0: " + vertex0.getCatalogKey());
                LOG.trace("Vertex1: " + vertex0.getCatalogKey());
                LOG.trace("ColumnSet:\n" + cset.debug() + "\n");
            }


            DesignerEdge edge = this.addEdge(agraph, AccessType.PARAM_JOIN, cset, vertex0, vertex1);
            if (!this.multi_stmt_edge_xref.containsKey(edge)) {
                this.multi_stmt_edge_xref.put(edge, new HashSet<Set<Statement>>());

View Full Code Here

            // key using all the columdns referenced by in the SCAN predicates
            for (Table catalog_fkey_tbl : fkey_column_xrefs.keySet()) {
                DesignerVertex other_vertex = agraph.getVertex(catalog_fkey_tbl);
                PredicatePairs implicit_cset = fkey_column_xrefs.get(catalog_fkey_tbl);
                if (t)
                    LOG.trace("\t" + catalog_tbl + "->" + catalog_fkey_tbl + "\n" + implicit_cset.debug());
                Collection<DesignerEdge> edges = agraph.findEdgeSet(vertex, other_vertex);
                if (edges.isEmpty()) {
                    this.addEdge(agraph, AccessType.IMPLICIT_JOIN, implicit_cset, vertex, other_vertex, catalog_stmt0);
                    // Even though we don't need to create a new edge, we still
                    // need to know that

View Full Code Here

        for (DesignerEdge edge : agraph.getEdges()) {
            Collection<DesignerVertex> vertices = agraph.getIncidentVertices(edge);
            PredicatePairs other_cset = (PredicatePairs) edge.getAttribute(EdgeAttributes.COLUMNSET.name());
            if (vertices.contains(v0) && vertices.contains(v1) && cset.equals(other_cset)) {
                if (t)
                    LOG.trace("FOUND DUPLICATE COLUMN SET: " + other_cset.debug() + "\n" + cset.toString() + "\n[" + edge.hashCode() + "] + " + cset.size() + " == " + other_cset.size() + "\n");
                new_edge = edge;
                break;
            }
        } // FOR
        if (new_edge == null) {

View Full Code Here

                continue;
            for (DesignerEdge e : edges) {
                PredicatePairs cset = e.getAttribute(agraph, AccessGraph.EdgeAttributes.COLUMNSET);
                assert (cset != null) : e.debug();
                Collection<Column> cols = cset.findAllForParent(Column.class, catalog_tbl);
                assert (cols != null) : catalog_tbl + "\n" + cset.debug();
                used_cols.addAll(cols);
            }
            int num_cols = used_cols.size();


            // Picking columns + repl

View Full Code Here

            // sb.append(String.format("\n => %-15s%s", entry.getKey()+":",
            // entry.getValue().toString()));
            // }
            PredicatePairs cset = e.getAttribute(EdgeAttributes.COLUMNSET.name());
            assert (cset != null);
            sb.append("\n").append(cset.debug());
        }
        return (sb.toString());
    }
}

View Full Code Here

TOP

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.