Results 11  20
of
113
Using semijoins to solve relational queries
 Journal of the ACM
, 1981
"... ABSTRACT. The semijoin is a relational algebraic operation that selects a set of tuples in one relation that match one or more tuples of another relation on the joining domains. Semijoins have been used as a basic ingredient in query processing strategies for a number of hardware and software data ..."
Abstract

Cited by 99 (1 self)
 Add to MetaCart
ABSTRACT. The semijoin is a relational algebraic operation that selects a set of tuples in one relation that match one or more tuples of another relation on the joining domains. Semijoins have been used as a basic ingredient in query processing strategies for a number of hardware and software database systems. However, not all queries can be solved entirely using semijoins. In this paper the exact class of relational queries that can be solved using semijoins is shown. It is also shown that queries outside of this class may not even be partially solvable using "short " semijoin programs. In addition, a lineartime membership test for this class is presented.
Computable Queries for Relational Databases
, 1980
"... this paper is to settle the question of maximal expressiveness of query languages. This is done in two steps. First, the set of computable queries is defined. These correspond to partial recursive functions which satisfy a consistency criterion reflecting the fact that the computation is on a data b ..."
Abstract

Cited by 83 (0 self)
 Add to MetaCart
this paper is to settle the question of maximal expressiveness of query languages. This is done in two steps. First, the set of computable queries is defined. These correspond to partial recursive functions which satisfy a consistency criterion reflecting the fact that the computation is on a data base rather than, say, on a natural number
Horn clauses and database dependencies
 Journal of the ACM
, 1982
"... Abstract. Certain firstorder sentences, called "dependencies, " about relations in a database are defined and studied. These dependencies seem to include all prewously defined dependencies as special cases A new concept is mtroduced, called "faithfulness (with respect to direct produ ..."
Abstract

Cited by 60 (6 self)
 Add to MetaCart
Abstract. Certain firstorder sentences, called "dependencies, " about relations in a database are defined and studied. These dependencies seem to include all prewously defined dependencies as special cases A new concept is mtroduced, called "faithfulness (with respect to direct product), " which enables powerful results to be proved about the existence of "Armstrong relations " in the presence of these new dependencies. (An Armstrong relaUon is a relation that obeys precisely those dependencies that are the logical consequences of a given set of dependencies.) Results are also obtained about characterizing the class of projections of those relations that obey a given set of dependencies.
A polygen model for Heterogeneous Database Systems: The Source Tagging Perspective
 WP # 311990 MSA. (Sloan School of Management, MIT
, 1990
"... This paper studies heterogeneous database systems from the multiple (poly) source @rrt) perspective. It aims at addressing issues such as “where is the data from ” and “which intermediate data sources were used to arrive at that data ” issues which are critical to many users in utilizing informatio ..."
Abstract

Cited by 55 (9 self)
 Add to MetaCart
This paper studies heterogeneous database systems from the multiple (poly) source @rrt) perspective. It aims at addressing issues such as “where is the data from ” and “which intermediate data sources were used to arrive at that data ” issues which are critical to many users in utilizing information composed from multiple sources. Specifically, it presents a polygen model for resolving the Data Source Tagging and Intermediate Source Tagging problems. Secondly, it presents a datadriven query translation mechanism for mapping a polygen query into a set of local queries dynamically. A concrete example is also provided to exemplify polygen query processing. The significance of this paper lies not only in a precise characterization of a practical problem and a solution per se, but also in the establishment of a foundation for resolving many other critical research issues such as domain mismatch, semantic reconciliation, and data conflict amongst data retrieved from different sources. In a federated database environment with hundreds of databases, all of these issues are critical to their effective USt!. I.
Temporal Logic in Information Systems
 Logics for Databases and Information Systems
, 1997
"... Temporal logic is obtained by adding temporal connectives to a logic language. Explicit references to time are hidden inside the temporal connectives. Different variants of temporal logic use different sets of such connectives. In this chapter, we survey the fundamental varieties of temporal logic a ..."
Abstract

Cited by 54 (12 self)
 Add to MetaCart
Temporal logic is obtained by adding temporal connectives to a logic language. Explicit references to time are hidden inside the temporal connectives. Different variants of temporal logic use different sets of such connectives. In this chapter, we survey the fundamental varieties of temporal logic and describe their applications in information systems. Several features of temporal logic make it especially attractive as a query and integrity constraint language for temporal databases. First, because the references to time are hidden, queries and integrity constraints are formulated in an abstract, representationindependent way. Second, temporal logic is amenable to efficient implementation. Temporal logic queries can be translated to an algebraic language. Temporal logic constraints can be efficiently enforced using auxiliary stored information. More general languages, with explicit references to time, do not share these properties. Recent research has proposed various implementation t...
Conditional XPath
 ACM Trans. Database Syst
, 2005
"... Abstract. XPath 1.0 is a variable free language designed to specify paths between nodes in XML documents. Such paths can alternatively be specified in firstorder logic. The logical abstraction of XPath 1.0, usually called Navigational or Core XPath, is not powerful enough to express every firstord ..."
Abstract

Cited by 45 (4 self)
 Add to MetaCart
Abstract. XPath 1.0 is a variable free language designed to specify paths between nodes in XML documents. Such paths can alternatively be specified in firstorder logic. The logical abstraction of XPath 1.0, usually called Navigational or Core XPath, is not powerful enough to express every firstorder definable path. In this paper we show that there exists a natural expansion of Core XPath in which every firstorder definable path in XML document trees is expressible. This expansion is called Conditional XPath. It contains additional axis relations of the form (child::n[F])+, denoting the transitive closure of the path expressed by child::n[F]. The difference with XPath’s descendant::n[F] is that the path (child::n[F])+ is conditional on the fact that all nodes in between should be labeled by n and should make the predicate F true. This result can be viewed as the XPath analogue of the expressive completeness of the relational algebra with respect to firstorder logic. 1
Fixpoint Logics, Relational Machines, and Computational Complexity
 In Structure and Complexity
, 1993
"... We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1storder operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have t ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1storder operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have the complexity classes between P and EXPTIME. Our parameterized fixpoint logics capture the complexity classes P, NP, PSPACE, and EXPTIME, but equality is achieved only over ordered structures. There is, however, an inherent mismatch between complexity and logic  while computational devices work on encodings of problems, logic is applied directly to the underlying mathematical structures. To overcome this mismatch, we develop a theory of relational complexity, which bridges tha gap between standard complexity and fixpoint logic. On one hand, we show that questions about containments among standard complexity classes can be translated to questions about containments among relational complex...
Conditional functional dependencies for capturing data inconsistencies
 TODS
"... We propose a class of integrity constraints for relational databases, referred to as conditional functional dependencies (cfds), and study their applications in data cleaning. In contrast to traditional functional dependencies (fds) that were developed mainly for schema design, cfds aim at capturing ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
We propose a class of integrity constraints for relational databases, referred to as conditional functional dependencies (cfds), and study their applications in data cleaning. In contrast to traditional functional dependencies (fds) that were developed mainly for schema design, cfds aim at capturing the consistency of data by enforcing bindings of semantically related values. For static analysis of cfds we investigate the consistency problem, which is to determine whether or not there exists a nonempty database satisfying a given set of cfds, and the implication problem, which is to decide whether or not a set of cfds entails another cfd. We show that while any set of transitional fds is trivially consistent, the consistency problem is npcomplete for cfds, but it is in ptime when either the database schema is predefined or no attributes involved in the cfds have a finite domain. For the implication analysis of cfds, we provide an inference system analogous to Armstrong’s axioms for fds, and show that the implication problem is conpcomplete for cfds in contrast to the lineartime complexity for their traditional counterpart. We also present an algorithm for computing a minimal cover of a set of cfds. Since cfds allow data bindings, in some cases cfds may be physically large, complicating detection of constraint violations. We develop techniques for detecting cfd violations in sql as well as novel techniques for checking multiple
Managing Reference: Ensuring Referential Integrity of Ontologies for the Semantic Web
, 2002
"... The diversity and distributed nature of the resources available in the semantic web poses significant challenges when these are used to help automatically build an ontology. One persistent and pervasive problem is that of the resolution or elimination of coreference that arises when more than one id ..."
Abstract

Cited by 27 (15 self)
 Add to MetaCart
The diversity and distributed nature of the resources available in the semantic web poses significant challenges when these are used to help automatically build an ontology. One persistent and pervasive problem is that of the resolution or elimination of coreference that arises when more than one identifier is used to refer to the same resource. Tackling this problem is crucial...