Optimal garbage collection policies for a database in a computer system
Parallel probabilistic searching and sorting algorithms
Picture languages in automatic radiological palm interpretation
The paper presents a new technique for cognitive analysis and recognition of pathological wrist bone lesions. This method uses AI techniques and mathematical linguistics allowing us to automatically evaluate the structure of the said bones, based on palm radiological images. Possibilities of computer interpretation of selected images, based on the methodology of automatic medical image understanding, as introduced by the authors, were created owing to the introduction of an original relational description...
Probabilistic databases and decision problems: Results and a conjecture
Properties and pre-processing strategies to enhance the discovery of functional dependency with degree of satisfaction
Providing Help in a Natural Language Query Interface to Relational Databases
Reasoning Methods for Designing and Surveying Relationships Described by Sets of Functional Constraints
This work is supported by the Hungarian Scientific Research Fund (OTKA), grant T042706.Current methods of database schema design are usually based on modeling the real world as entity (or object) classes with relationships among them. Properties of relationships can be described by semantical database constraints. One of them is functional dependency, which has a key role in traditional database design. The three basic types of binary relationships that can be described by functional dependencies...
Repetitions and permutations of columns in the semijoin algebra
Codd defined the relational algebra [E.F. Codd, Communications of the ACM 13 (1970) 377–387; E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the...
Repetitions and permutations of columns in the semijoin algebra
Codd defined the relational algebra [E.F. Codd, Communications of the ACM13 (1970) 377–387; E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, ...
STAR, un langage de manipulation de résumés statistiques structurés
Stronger association rules for positive attributes.
Structural testing of active databases.
SXCCP+: Simple XML Concurrency Control Protocol for XML Database Systems
The application of generalised constraints to object-oriented database models.
A formal framework for a generalised object-oriented database model is presented, which is able to cope with fuzzy and uncertain information. This model is obtained as a generalisation of a crisp object-oriented database model, which is consistent with the ODMG de facto standard and is built upon an algebraic type system and a constraint system. Generalised constraints have been used to enforce integrity rules and to specify the formal semantics of the database model.
The calculus of an unnormalized relational model of data
The complexity of classification problems
The entropy and redundancy of normalized database structures
The star clustering algorithm for static and dynamic information organization.
The sum-product algorithm: algebraic independence and computational aspects
The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of probability-theoretic...
Using fuzzy relational databases to represent agricultural and environmental information. An example within the scope of olive cultivation in Granada.
A query system for several types of users and for information retrieval about olive cultivation and its environmental support in the province of Granada (Spain) is introduced. The system is based on fuzzy data and is flexible. The main problems which this model solves are those relating to uncertain and imprecise data processing (as in the case of environmental and cultivation information), spatial and punctual data representation, and fusion of cultivation-resulting and scientific-experimental...