Filters








1,678,647 Hits in 3.3 sec

Join indices

Patrick Valduriez
1987 ACM Transactions on Database Systems  
For most of the joins, updates to join indices incur very little overhead.  ...  Finally, the analysis of the join algorithm using join indices shows its excellent performance.  ...  We now give a brief comparison of the performance of a join using join indices and a join using indices on join attributes as proposed in [4] .  ... 
doi:10.1145/22952.22955 fatcat:r3ptpoclt5bdxahxewyb6s2mga

Fast joins using join indices

Zhe Li, Kenneth A. Ross
1999 The VLDB journal  
Two new algorithms, "Jive join" and "Slam join," are proposed for computing the join of two relations using a join index.  ...  For large input relations, our algorithms perform significantly better than Valduriez's algorithm, the TID join algorithm, and hash join algorithms.  ...  Ross: Fast joins using join indices recursion applied to Jive join and Slam join. Thanks also to Mike Carey for clarifying some of the details of Haas et al. (1993 Haas et al. ( , 1997 .  ... 
doi:10.1007/s007780050071 fatcat:oyz4woieuvh5nbq33h7o65muc4

Faster joins, self-joins and multi-way joins using join indices

Hui Lei, Kenneth A. Ross
1999 Data & Knowledge Engineering  
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 b y L i a n d R oss.  ...  Stripe-join is particularly e cient for self-joins.  ...  Following 8], we assume that separate disks are used to store (a) join indices, (b) temporary les, (c) input relations, and (d) the output result.  ... 
doi:10.1016/s0169-023x(98)00031-7 fatcat:5khh5jp4jrd7tcqxtrpxmjplv4

Faster joins, self-joins and multi-way joins using join indices

Hui Lei, Kenneth A. Ross
1998 Data & Knowledge Engineering  
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 b y L i a n d R oss.  ...  Stripe-join is particularly e cient for self-joins.  ...  Following 8], we assume that separate disks are used to store (a) join indices, (b) temporary les, (c) input relations, and (d) the output result.  ... 
doi:10.1016/s0169-023x(98)00025-1 fatcat:g66ri3bz3fbcxdjcxyhydnhgzu

Multi-table joins through bitmapped join indices

Patrick O'Neil, Goetz Graefe
1995 SIGMOD record  
The method presented in this note uses join indices with compressed bitmap representations, which allow predicates restricting columns of descriptive tables to determine an answer set (or foundsef) in  ...  the central detail table; the method uses different predicates on different descriptive tables in combination to restrict the detail table through compressed bitmap representations of join indices, and  ...  Join Indices and Domain Indices Of course, join indices can be generalized from two tables to multiple tables.  ... 
doi:10.1145/211990.212001 fatcat:ppp2ucof5vdq3lxweogg73r5fe

Szeged-type indices of subdivision vertex-edge join (SVE-join)

Syed Sheraz Asghar, Muhammad Ahsan Binyamin, Yu-Ming Chu, Shehnaz Akhtar, Mehar Ali Malik
2020 Main Group Metal Chemistry  
index, edge Padmakar-Ivan (PIe ) index, edge Szeged (Sze ) index, weighted vertex Padmakar-Ivan (wPIv ) index, and weighted vertex Szeged (wSzv ) index of a graph product called subdivision vertex-edge join  ...  In this paper we study several Szeged-type topological indices of SVE-join of graphs. First we introduce the basic definitions of these indices and notations in the next section.  ...  Edge Padmakar-Ivan and edge Szeged indices In this section, we calculate the edge PI and edge Szeged indices of SVE join of graphs. Theorem 6.3 Let Γ 1 , Γ 2 , and Γ 3 be three graphs.  ... 
doi:10.1515/mgmc-2021-0011 fatcat:wy3ubnelarha5oljyan7taj454

The Kirchhoff indices of join networks

Enrique Bendito, Ángeles Carmona, Andrés M. Encinas
2012 Discrete Applied Mathematics  
In particular, this allows us to express the Kirchhoff index with respect to a value λ ≥ 0 and a weight ω of the join network in terms of the Kirchhoff indices of the factors.  ...  Moreover, we obtain a full description of the eigenvalues and the corresponding eigenfunctions for a positive semi-definite Schrödinger operator on a join network.  ...  Here we show that this generalization is essential to obtain the expression for the Kirchhoff index of a join network in terms of the Kirchhoff indices of the factors.  ... 
doi:10.1016/j.dam.2011.09.017 fatcat:d76xiahmvrcgjlzicptzhqsurq

Join decomposition based on fragmented column indices

E. Ivanova, L. B. Sokolinsky
2016 Lobachevskii Journal of Mathematics  
The paper is devoted to the issue of decomposition of the join relational operator with the aid of distributed column indices.  ...  Column indices are the new kind of index structures, which exploits "key-value" technics. The paper describes the methods of column index fragmentation based on domain intervals.  ...  Section 4 describes a method of decomposing natural join of two relations based on domain-interval fragmentation of column indices built for the join attributes.  ... 
doi:10.1134/s1995080216030136 fatcat:fvlve2fzavbodamzbbsuharzbe

Zagreb-Type Indices of R-Vertex Join and R-Edge Join of Graphs

Jianxin Wei, Muhammad Imran, Muhamamd Azhar Iqbal, Muhammad Asad Zaighum
2020 Journal of Chemistry  
In this paper, we study Zagreb indices and several other Zagreb-type indices including the general Randić index, sum-connectivity index, F-index, and Zagreb coindices of R-vertex and edge join of two arbitrary  ...  The Zagreb indices are amongst the oldest molecular descriptors, and their properties have been extensively studied and applied in QSAR/QSPR studies.  ...  Zagreb Indices of R-Graphs and R-Vertex and Edge Join of Graphs Theorem 1. e first Zagreb index of graph R(G) is given by M 1 (R(G)) � 2M 1 (G) + 4m. (21) Proof.  ... 
doi:10.1155/2020/9767128 fatcat:bipu5fi7f5gdhp5ptx5ta5apmm

Inequalities for cd -Indices of Joins and Products of Polytopes

Richard Ehrenborg, Harold Fox
2003 Combinatorica  
We first consider the problem of computing the cdindex of the free join of two polytopes knowing the cd-indices of each polytope.  ...  In Section 8 we prove our main inequality which relates the cd-indices between the free join of polytopes and the Cartesian product. It is: for U , V and W three polytopes; see Theorem 8.2.  ...  Assume that the respective cd-indices are greater than or equal to the cd-indices of the Boolean algebra of the same rank, that is, Ψ(P ) ≥ Ψ(B m ) and Ψ(Q) ≥ Ψ(B n ).  ... 
doi:10.1007/s00493-003-0026-z fatcat:e4iqzdg3pnblzb7ioigyhcjkji

An Efficient Multi Join Algorithm Utilizing A Lattice Of Double Indices

Hanan A. M. Abd Alla, Lilac A. E. Al-Safadi
2008 Zenodo  
The lattice of the join indices can be fitted into the main memory to reduce time complexity of the multi join algorithm.  ...  Otherwise, it will be used along with other join indices of other relations to build a lattice to be used in multi-join operations with minimal I/O requirements.  ...  The lattice of the join indices can be fitted into the main memory to reduce time complexity of the multi join algorithm.  ... 
doi:10.5281/zenodo.1332819 fatcat:ukooad7ljnd4lfx7jx3i72l75m

V Locking Protocol for Materialized Aggregate Join Views on B-Tree Indices [chapter]

Gang Luo
2010 Lecture Notes in Computer Science  
To increase concurrency during such maintenance, we previously proposed the V locking protocol for materialized aggregate join views and showed how to implement it on hash indices.  ...  In this paper, we address the thorny problem of implementing the V locking protocol on B-tree indices.  ...  To implement value locks for join views on B-tree indices with high concurrency, we can use the latches in the latch pool and treat join views in the same way as aggregate join views.  ... 
doi:10.1007/978-3-642-14246-8_72 fatcat:ebsvtwpcwzebbflom7oe6bcj6e

Decomposition of natural join based on domain-interval fragmented column indices

Elena Ivanova, Leonid Sokolinsky
2015 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)  
The paper describes decomposition of natural join relational operator based on the column indices and domaininterval fragmentation.  ...  Column indices and domain-interval fragmentation were evaluated using this prototype. We performed natural join operator over fragmented column indices .  ...  CONCLUSIONS In this article, we presented a decomposition of the natural join operator based on the column indices and the domain-interval fragmentation.  ... 
doi:10.1109/mipro.2015.7160266 dblp:conf/mipro/IvanovaS15 fatcat:rrfa6k3e5naqhi6kjmmuacm2n4

Join products and indices of k-fields over differentiable fiber bundles

Nancy de Souza Cardim, Maria Hermı́nia de P.L. Mello, Duane Randall, Mário Olivero Marques da Silva
2004 Topology and its Applications  
We use the intrinsic join product to express the index of a k-field with finite singularities over the total space of a smooth fiber bundle F → E → B as the product of the indices of k-fields with finite  ...  The indices of k-fields with finite singularities on a smooth closed manifold M n are expressed precisely in terms of generators of π n−1 (V n,k ) for 1 < k 4 when the indices depend only on the oriented  ...  In Section 2 we prove the following theorem: Theorem 1 (Join of Indices). Let F → E → B be a locally trivial differentiable fiber bundle where F , E and B are closed manifolds.  ... 
doi:10.1016/j.topol.2003.08.008 fatcat:oe6xlyuai5cptj2pp4lucbaoba

An efficient evaluation of a fuzzy equi-join using fuzzy equality indicators

Weining Zhang, Ke Wang
2000 IEEE Transactions on Knowledge and Data Engineering  
Experiment results from our preliminary simulation of the algorithm show a significant improvement of efficiency when FE indicators are used with the sort±merge join algorithm.  ...  A sort±merge join algorithm based on a partial order of intervals is used to evaluate the fuzzy equi-join.  ...  Intuitively, if f is an FE indicator over the domain of the join attributes of a fuzzy equi±join, by assigning intervals to join attribute values using f, it guarantees that after sorting according to  ... 
doi:10.1109/69.842264 fatcat:eedfz3m6mfbs7lab7pltjskiqi
« Previous Showing results 1 — 15 out of 1,678,647 results