نتایج جستجو برای: generalized join
تعداد نتایج: 181786 فیلتر نتایج به سال:
DEFINITION Spatial join operation is used to combine two or more datasets with respect to a spatial predicate. The predicate can be a combination of directional, distance, and topological spatial relations. In the case of nonspatial joins, the joining attributes must be of the same type, but for spatial joins they can be of different types. Usually each spatial attribute is represented by its m...
i.p.s. hypergroups are canonical hypergroups such that$[forall(a,x),a+xni x]longrightarrow[a+x=x].$i.p.s. hypergroups were investigated in [1], [2], [3], [4] and it was proved thatif the order is less than 9, they are strongly canonical (see [13]). in this paperwe obtain the sequences of fuzzy sets and of join spaces determined (see [8])by all i.p.s. hypergroups of order seven. for the meaning ...
let $g$ be a graph without an isolated vertex, the normalized laplacian matrix $tilde{mathcal{l}}(g)$is defined as $tilde{mathcal{l}}(g)=mathcal{d}^{-frac{1}{2}}mathcal{l}(g) mathcal{d}^{-frac{1}{2}}$, where $mathcal{d}$ is a diagonal matrix whose entries are degree of vertices of $g$. the eigenvalues of$tilde{mathcal{l}}(g)$ are called as the normalized laplacian ...
Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast an ordinary graph, which each edge connects exactly two vertices, (or, “hyperedge”) can join any number of vertices a hypergraph. Hypergraphs been used problems biology, chemistry, image processing, wireless networks, more. the current...
The correlations between the physico-chemical properties of a chemical structure and its molecular structure-properties are used in quantitative structure-activity property relationship studies (QSAR/QSPR) by using graph-theoretical analysis techniques. It is well known that some structure-property studies, eccentric distance sum, better than corresponding values obtained Wiener index. In this ...
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross. Stripe-join makes a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identiiers but no input tuples. Stripe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید