Three pointer-based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. Buhr, Goel, and Wai [11] have shown that data structures such as B-Trees, R-Trees and graph data structures can be implemented as efficiently and effectively in this environment as in a traditional environment using exp...

Given a graph G with weighted edges, and a subset of nodes T , the T -join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A i u 2 T . We describe the applications of the T -join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal re nement of nite element meshes. We suggest a practical algorithm ...

Recent work has demonstrated that the use of programmable GPUs can be advantageous during relational query processing on analytical workloads. In this paper, we take a closer look at graph problems such as finding all triangles and all four-cliques of a graph. In particular, we present two different join algorithms for the GPU. The first is an implementation of Leapfrog-Triejoin (LFTJ), a recen...

We prove that the ribbon graph polynomial of a embedded in an orientable surface is irreducible if and only neither disjoint union nor join graphs. This result analogous to fact Tutte connected non-separable.

Shema-free SQL takes into consideration two relaxations 1. Schema Relaxation: Users need not have to specify the exact name of the tables and attributes • Join Path: users need not have to specify the join path in the query Reducing user workload of writing SQL queries and knowing the complete database schema to query the RDBMS in order to get desired results Generation of Join Network (Interpr...

Given a graph G with weighted edges, and a subset of nodes T, the T-join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A ii u 2 T. We describe the applications of the T-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal reenement of nite element meshes. We suggest a practical algorithm for...

To expand query types under a set of integrity constraints for obtaining consistent answers over inconsistent databases, a computational theory is proposed based on first-order logic. According to directed join graphs of queries and their join completeness, computational complexities of CQA are PTIME if query types are key-key, nonkey-key, incomplete key-key with acyclic join. This paper presen...

We call a graph G O-graph if there is an optimal coloring of the set of vertices and an optimal (disjoint) covering with cliques such that any class of colors intersects any clique. In this paper, it has been established the relation to [p, q, r]-partite graphs and the fact that the O-graphs admit a k-clique-join.

Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum fractional packing of T -joins. Padberg-Rao’s algorithm finds a minimum capacity T -cut but it does not produce a T -join packing, we present a polynomial combinatorial algorithm for finding an optimal T -join packing.

Let L denote a set of additive hereditary graph properties. It is a known fact that a partially ordered set (La,⊆) is a complete distributive lattice. We present results when a join of two additive hereditary graph properties in (La,⊆) has a finite or infinite family of minimal forbidden subgraphs.