The Experts below are selected from a list of 573 Experts worldwide ranked by ideXlab platform

Ronald R. Yager - One of the best experts on this subject based on the ideXlab platform.

  • Implementing Quotient Operators in Fuzzy Data Bases Using OWA Operators
    Fuzziness in Database Management Systems, 1995
    Co-Authors: Ronald R. Yager
    Abstract:

    We provide for an extension of the Relational Algebra Operation of quotient to fuzzy Relational-data. bases. This extension not only allows for the application of the quotient operator in these fuzzy data bases but provides for a fuzzification of the notion of quotient. Central to the development is the realization that the classic quotient Operation is essentially an application of the universal quantifier, for all. In this work we take advantage of the linguistic quantifiers and their close relationship OWA operators.

Ashley Blake - One of the best experts on this subject based on the ideXlab platform.

  • A.: Teaching Relational Algebra and Relational Calculus: A Programming Approach
    2014
    Co-Authors: Kirby Mcmaster, Nicole Anderson, Ashley Blake
    Abstract:

    This paper describes how Relational Algebra and Relational calculus can be taught using a programming approach. This is in contrast to the mathematical presentation of these topics in most database textbooks. For Relational Algebra, a function library implemented with Visual FoxPro allows queries to be written as a sequence of function calls--one call per Relational Algebra Operation. For Relational calculus, Prolog can be used to write non-procedural programs for queries. In each programming environment, database students experience the power and versatility of these query languages by watching their programs run. In doing so, they gain a greater understanding of the Relational model and SQL

Zhang Zheng - One of the best experts on this subject based on the ideXlab platform.

Kirby Mcmaster - One of the best experts on this subject based on the ideXlab platform.

  • A.: Teaching Relational Algebra and Relational Calculus: A Programming Approach
    2014
    Co-Authors: Kirby Mcmaster, Nicole Anderson, Ashley Blake
    Abstract:

    This paper describes how Relational Algebra and Relational calculus can be taught using a programming approach. This is in contrast to the mathematical presentation of these topics in most database textbooks. For Relational Algebra, a function library implemented with Visual FoxPro allows queries to be written as a sequence of function calls--one call per Relational Algebra Operation. For Relational calculus, Prolog can be used to write non-procedural programs for queries. In each programming environment, database students experience the power and versatility of these query languages by watching their programs run. In doing so, they gain a greater understanding of the Relational model and SQL

Margaret H. Eich - One of the best experts on this subject based on the ideXlab platform.

  • Join processing in Relational databases
    ACM Computing Surveys, 1992
    Co-Authors: Priti Mishra, Margaret H. Eich
    Abstract:

    The join Operation is one of the fundamental Relational database query Operations. It facilitates the retrieval of information from two different relations based on a Cartesian product of the two relations. The join is one of the most diffidult Operations to implement efficiently, as no predefined links between relations are required to exist (as they are with network and hierarchical systems). The join is the only Relational Algebra Operation that allows the combining of related tuples from relations on different attribute schemes. Since it is executed frequently and is expensive, much research effort has been applied to the optimization of join processing. In this paper, the different kinds of joins and the various implementation techniques are surveyed. These different methods are classified based on how they partition tuples from different relations. Some require that all tuples from one be compared to all tuples from another; other algorithms only compare some tuples from each. In addition, some techniques perform an explicit partitioning, whereas others are implicit.