The information to be stored in databases in not always precise. A related issue is the handling of imperfect, flexible or vague queries. M. Kifer and V. S. Subrahmanian introduced generalized annotated logic programs (GAP) which unify and generalize various results and treatments of quantitative Datalog based model theoretic semantic. In this paper we discuss the problem of appropriate proof t...

We consider a system of two parallel queues sharing a common arrival process, where the arriving customers select which queue to join based on a generalized Join the Shortest Queue ( ) policy. We assume that both servers run at the same speed. However, we assume that departing customers face some additional delay after leaving the system, and that this downstream delay is different between the ...

In this paper, we prove that the generalized Brézin–Gross– Witten tau-function is a hypergeometric solution of BKP hierarchy with simple weight generating function. We claim it describes spin version strictly monotone Hurwitz numbers. A family tau-functions hierarchy, corresponding to rational functions, investigated. particular, cut-and-join operators are constructed, and explicit description ...

Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works on privacy-preserving data-query in database, only few works deal with provably-secure privacy-preserving data manipulations, among which the join operator is the most powerful in generating new data (relation). We pro...

In the early eighties, A. Huhn proved that if D, E are finite distributive lattices and ψ : D → E is a {0}-preserving join-embedding, then there are finite lattices K, L and there is a lattice homomorphism φ : K → L such that ConK (the congruence lattice of K) is isomorphic to D, ConL (the congruence lattice of L) is isomorphic to E, and the natural induced mapping extφ : ConK → ConL represents...

Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their corresponding order, objects are created together with their subparts and so on. The newly created data is then appended to the existing data. We present a new join algorithm, called DiagJoin, which exploits time-of-creation clust...