Results 1  10
of
791
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 126 (1 self)
 Add to MetaCart
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
Conjugate Gradient Methods for Toeplitz Systems
 SIAM Review
, 1996
"... In this expository paper, we survey some of the latest developments on using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of solving a large class of nbyn Toeplitz systems is reduced to O(n log n) operations as compared to O ..."
Abstract

Cited by 174 (40 self)
 Add to MetaCart
In this expository paper, we survey some of the latest developments on using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of solving a large class of nbyn Toeplitz systems is reduced to O(n log n) operations as compared
Outerjoins as Disjunctions
"... The outerjoin operator is currently available in the query language of several major DBMSs, and it is included in the proposed SQL2 standard draft. However, "associativity problems" of the operator have been pointed out since its introduction. In this paper we propose a shift in the int ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
be evaluated by means of binary outerjoins, and give alternative procedures to evaluate those queries. We also explore several evaluation strategies for outerjoin queries, including the use of semijoin programs to reduce base relations. CR Subject Classification (1991): [H.2.4] Database Systems, Query
Learning polynomials with queries: The highly noisy case
, 1995
"... Given a function f mapping nvariate inputs from a finite Kearns et. al. [21] (see also [27, 28, 22]). In the setting of agfieldFintoF, we consider the task of reconstructing a list nostic learning, the learner is to make no assumptions regarding of allnvariate degreedpolynomials which agree withf ..."
Abstract

Cited by 97 (17 self)
 Add to MetaCart
. In this case the providing an explanation which fits only part of it is better than nothing. Interestingly, Kearns et. al. did not consider the use of running time of our algorithm is bounded by a polynomial queries (but rather examples drawn from an arbitrary distribuand exponential ind. Our algorithm
Automatic Termination Analysis of Logic Programs
 Proceedings of the Fourteenth International Conference on Logic Programming
, 1997
"... This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be nontermination. The system can use any norm of a wide family of norms. It ca ..."
Abstract

Cited by 63 (3 self)
 Add to MetaCart
This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be nontermination. The system can use any norm of a wide family of norms
Using multiset discrimination to solve language processing problems without hashing
 Theoretical Computer Science
, 1995
"... It is generally assumed that hashing is essential to solve many language processing problems efficiently; e.g., symbol table formation and maintenance, grammar manipulation, basic block optimization, and global optimization. This paper questions this assumption, and initiates development of an effi ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
for detecting duplicate elements occurring in a multiset of varying length strings. The technique was used to develop an improved algorithm for lexicographic sorting, whose importance stems largely from its use in solving a variety of isomorphism problems [2]. The current paper and a related paper [23] show
A Model for Equijoin Query Processing in Distributed Relational Databases*
, 1981
"... We develop a mathematical model to compute the minimum communication cost of a joinsemijoin program for processing a given equijoin query. Some definitions and conditions uponwhich this paper is based are stated. We define a query processing graph for each equijoin query and characterize the set ..."
Abstract
 Add to MetaCart
of joinsemijoin programs which solve this query. A rule for estimating the size of the derived relation is derived. The parameters for estimating the size of derived relation form a consistent parameter system. With the assumption of communication cost dominance, the cost functions are linear in the size
Towards A Deductive ObjectOriented Database Language
 Data & Knowledge Engineering
, 1990
"... A language for databases with sets, tuples, lists, object identity and structural inheritance is proposed. The core language is logicbased with a fixpoint semantics. Methods with overloading and methods evaluated externally providing extensibility of the language are considered. Other important iss ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
issues such as updates and the introduction of explicit control are discussed. 1 INTRODUCTION The success of the relational database model [19, 38, 27] is certainly due to technological advances such as fast query processing or reliable concurrency control. However, we believe that a major factor
Compressed Text Indexes: From Theory to Practice
"... A compressed fulltext selfindex represents a text in a compressed form and still answers queries efficiently. This represents a significant advancement over the (full)text indexing techniques of the previous decade, whose indexes required several times the size of the text. Although it is relativ ..."
Abstract

Cited by 63 (22 self)
 Add to MetaCart
A compressed fulltext selfindex represents a text in a compressed form and still answers queries efficiently. This represents a significant advancement over the (full)text indexing techniques of the previous decade, whose indexes required several times the size of the text. Although
Results 1  10
of
791