We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theory that includes arithmetic, tuples, and sets, and translate the generation problem into a satisfiability or model generation problem modulo the background theory. We use the satisfiability modulo theories (SMT) solver Z3 in the...

The arboricity of a hypergraph H is the minimum number of acyclic hypergraphs that partition H . The determination of the arboricity of hypergraphs is a problem motivated by database theory. The exact arboricity of the complete k-uniform hypergraph of order n is previously known only for k ∈ {1, 2, n − 2, n − 1, n}. The arboricity of the complete k-uniform hypergraph of order n is determined as...

ion levels that can be objectively distinguished and can be applied to smaller units. For example, current definitions of the conceptual level as a level for communications between user and analyst are not fully objective. Well-trained users and analysts may find the relational model easy for communication (Siau, 2004). Or people may simply have different opinions and preferences on the models ...

Author's Present Address: William Kent, International Business Machines Corporation, General Products Division, Santa Teresa Laboratory, San Jose, CA Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice ...

A new method that aims to automatically classify a set of objects in spite of the imperfection and the uncertainty of their heterogeneously-assigned data is proposed in this paper. This method is based essentially on possibility theory to estimate the similarity among the objects, and on belief theory and multidimensional scaling methods to construct the compatible evidential class partition. T...

This paper presents the treatment, of quantitication as it was imI)lemented in a prototyl)c of a natural language relational database interface for l)utch 1. It is shown how the theoretical 'generalized (tuantifier' apl ) ; t ra t l t s introduced in formM semantics by Barwise and (]oot)er can be I, uned to irrq)lementational feasi" ( bility. ( ,ompm ~d to the t, raditional tl'(~atl'flellt of (...

Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. Many database completions have been proposed to remedy this problem, but a clear understanding of their properties and differences is still needed. In this paper, a general framework is proposed for studying database co...

Database schema design is seen as to decide on formats for time-varying instances, on rules for supporting inferences and on semantic constraints. Schema design aims at both faithful formalization of the application and optimization at design time. It is guided by four heuristics: Separation of Aspects, Separation of Specializations, Infer-ential Completeness and Unique Flavor. A theory of sche...