Results 11 to 20 of about 2,093,284 (296)

The $$\theta $$-Join as a Join with $$\theta $$ [PDF]

open access: yes, 2020
We present an algebra for the classical database operators. Contrary to most approaches we use (inner) join and projection as the basic operators. Theta joins result by representing theta as a database table itself and defining theta-join as a join with that table. The same technique works for selection.
Desharnais, Jules, Möller, Bernhard
openaire   +2 more sources

Wander Join [PDF]

open access: yesProceedings of the 2016 International Conference on Management of Data, 2016
Joins are expensive, and online aggregation over joins was proposed to mitigate the cost, which offers a nice and flexible tradeoff between query efficiency and accuracy in a continuous, online fashion. However, the state-of-the-art approach, in both internal and external memory, is based on ripple join, which is still very expensive and may also need ...
Feifei Li 0001   +3 more
openaire   +1 more source

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

open access: yesData & Knowledge Engineering, 1998
This article was already published in ibed. 28, No. 3, 277-298 (1998).
Hui Lei 0001, Kenneth A. Ross
openaire   +3 more sources

Model-Driven Development of Web APIs to Access Integrated Tabular Open Data

open access: yesIEEE Access, 2020
More and more governments around the world are publishing tabular open data, mainly in formats such as CSV or XLS(X). These datasets are mostly individually published, i.e.
Cesar Gonzalez-Mora   +4 more
doaj   +1 more source

Flat Committed Join in Join

open access: yesElectronic Notes in Theoretical Computer Science, 2004
Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e. processes without sub-negotiations) can be encoded in the ordinary Join calculus by exploiting a distributed two-phase commit protocol.
BRUNI, ROBERTO   +2 more
openaire   +2 more sources

Fast joins using join indices

open access: yesThe VLDB Journal The International Journal on Very Large Data Bases, 1999
Two new algorithms, "Jive-join'" and "Slam-join," are proposed for computing the join of two relations using a join index. The algorithms are duals: Jive-join range-partitions input relation tuple-ids then processes each partition, while Slam-join forms ordered runs of input relation tuple-ids and then merges the results.
Li, Zhe, Ross, Kenneth A.
openaire   +2 more sources

On Noncommutative Joinings [PDF]

open access: yesInternational Mathematics Research Notices, 2017
This paper extends the classical theory of joinings of measurable dynamical systems to the noncommutative setting from several interconnected points of view. Among these is a particularly fruitful identification of joinings with equivariant quantum channels between $W^{\ast}$-dynamical systems that provides noncommutative generalizations of many ...
Bannon, Jon P.   +2 more
openaire   +3 more sources

On partial inverse operations in the class of preradicals of modules

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
In the present work two partial operations in the class of preradicals ℙℝ of the category R-Mod of left R-modules are defined and investigated. They are inverse operations for product with respect to meet and coproduct with respect to join.
Jardan Ion
doaj   +1 more source

On the edge chromatic vertex stability number of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
For an arbitrary invariant [Formula: see text] of a graph G, the [Formula: see text]vertex stability number [Formula: see text] is the minimum number of vertices of G whose removal results in a graph [Formula: see text] with [Formula: see text] or with ...
Saeid Alikhani, Mohammad R. Piri
doaj   +1 more source

Results on Laplacian spectra of graphs with pockets

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
Let be simple connected graphs on and vertices, respectively. Let be a specified vertex of and . Then the graph obtained by taking one copy of and copies of and then attaching the th copy of to the vertex , , at the vertex of (identify with the vertex of
Sasmita Barik, Gopinath Sahoo
doaj   +1 more source

Home - About - Disclaimer - Privacy