A database view is a portion of the data structured in way suitable to specific application. Updates on views must be translated into updates underlying database. This paper studies translation process relational model. The procedure as follows: first, “complete” set defined such that together with every update contains “return” update, is, one brings back original state; given two set, their composition also set. To translate complete we define mapping called “translator,” associates each...

We present a new database model in which each attribute is modeled by family of disjoint subsets an underlying population objects. Such called partitioning, and the set all partitionings turned into lattice appropriately defining product sum. A seen as function from sublattice partitionings. The combines following features: (1) syntactic simplicity (essentially that relational model), (2) powerful means for specification semantic information (in form equations), (3) deductive capability...

The calculation of the probability that communication between two nodes in a given network is disrupted difficult when number channels large or configuration complex. This paper presents an efficient method, formalized as algorithm, for calculating this using subnetworks are smaller than original one. algorithm should prove useful practice since it permits possibility choosing subnetwork decomposition one considers best suited specific problem.

Preference queries are crucial for various applications (e.g. digital libraries) as they allow users to discover and order data of interest in a personalized way. In this paper, we define preferences preorders over relational attributes their respective domains. Then, rely on appropriate linearizations provide natural semantics the block sequence answering preference query. Moreover, introduce two novel rewriting algorithms (called LBA TBA) which exploit expressions constructing...

We propose a model for providing integrated and unified access to multiple information sources of the kind Web catalogs. assume that each source comprises two parts: (a) an ontology i.e. set terms structured by subsumption relation, (b) database stores objects interest under ontology. these belong underlying domain is common all (e.g. pages interest), different may use ontologies with correspond natural languages or levels granularity. Information integration obtained through mediator...

The continuous accumulation of multi-dimensional data and the development Semantic Web Linked Data published in Resource Description Framework (RDF) bring new requirements for analytics tools. Such tools should take into account special features RDF graphs, exploit semantics support flexible aggregate queries. In this paper, we present an approach applying to based on a high-level functional query language, called HIFUN. According that each analytical is considered be well-formed expression...

Although semantic data models provide expressive conceptual modeling mechanisms, they do not support context, i.e. providing controlled partial information on entities by viewing them from different viewpoints or in situations. The authors present a model for representing contexts bases along with set of operations manipulating contexts. These creating, updating, combining, and comparing contributes to the efficient handling information, especially distributed, cooperative environments, as...

Growing number of evolving systems creates demand for system evolution analytics with modern computational intelligence algorithms and tools. In this paper, we introduce new measures stability changeability analysis over time. We proposed a Stable Network Evolution Rule Mining Changeability Metric an system. For this, use two different characteristics Rules (NERs). First, given network state S <sub xmlns:mml="http://www.w3.org/1998/Math/MathML"...

In this paper we study the problem of mining all frequent queries in a given database table, known to be intractable even for conjunctive queries. We restrict our attention projection-selection queries, and assume that table mined satisfies set functional dependencies. Under these assumptions define pre-ordering ≺ over show following: (a) support measure is anti-monotonic (with respect ≺), (b) if q q' iff then an equivalence class have same support.

We address the problem of defining semantics for logic programs in presence incomplete and contradictory information coming from different sources. The consists facts that a central server collects tries to combine using (a) set logical rules, is, program, (b) hypothesis representing server's own estimates. In such setting source or sources necessitate use many-valued logics which can be evaluated hypotheses tested. To carry out activities we propose formal framework based on bilattices as...