Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of physical particles), we develop a stabilizer formalism using abelian hypergroups and an associated classical simulation theorem (a la Gottesman-Knill). Using these tools, we develop the first provably efficient quantu...

A discrete DJS-hypergroup is constructed in connection with the linearization formula for the product of two spherical elements for a quantum Gelfand pair of two compact quantum groups. A similar construction is discussed for the case of a generalized quantum Gelfand pair, where the role of the quantum subgroup is taken over by a two-sided coideal in the dual Hopf algebra. The paper starts with...

One of the approaches for integrating object-oriented programs with databases is to instantiate objects from relational databases by evaluating view queries. In that approach, it is often necessary to evaluate some joins of the query by left outer joins to prevent information loss caused by the tuples discarded by inner joins. It is also necessary to lter some relations with selection condition...

the aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $s_{h}$ and  $t_{h},$ respectively. it is shown that $t_{h}=s_{h}$ if and only if $beta=beta^{*}.$ we also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.

Multi-way joins improve performance by avoiding extra I/Os from multiple partitioning steps. There are several multi-way join algorithms proposed, and the research results are encouraging. However, commercial database systems are not currently using multi-way joins. Practical issues include modifying the optimizer and execution system to support multi-way operators and ensuring robust and relia...

One of the collection joins types in Object Oriented Database (OODB) is collection equi-join. The main feature of collection joins is that they involve collection types. In this paper we present our experience in implementing collection equi-join algorithms by using Message Passing Interface (MPI). In particular, it layouts the fundamental techniques that are used in the implementation and that...

A formal model of the structure of information is presented in five axioms which define identity, containment, and joins of infons. Joins are shown to be commutative, associative, provide inverses of infons, and, potentially, have many identity elements, two of which are multiplicative and additive. Those two types of join are distributive. The other identity elements are for operators on entwi...

The results of a survey among a group of users of a Data-Base-Management-System (DBMS) that runs on personal computers and the results of several experimental studies indicate that specific support is necessary for this group of users in the form of the interface concept of active joins. An active join, presented in a list on the interface, enables end-users to manipulate data records by direct...

The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of executing path expressions is pointer chasing of precomputed joins. However it has been previously shown that converting implicit joins to explicit joins during the optimization phase may yield better execution plans. A path exp...

The object oriented database management systems store ref erences to objects implicit joins precomputed joins and use path ex pressions in query languages One way of executing path expressions is pointer chasing of precomputed joins However it has been previously shown that converting implicit joins to explicit joins during the opti mization phase may yield better execution plans A path express...