Results 1 
7 of
7
Query optimization in database systems
 ACM Computing Surveys
, 1984
"... Efficient methods of processing unanticipated queries are a crucial prerequisite for the success of generalized database management systems. A wide variety of approaches to improve the performance of query evaluation algorithms have been proposed: logicbased and semantic transformations, fast imple ..."
Abstract

Cited by 207 (0 self)
 Add to MetaCart
Efficient methods of processing unanticipated queries are a crucial prerequisite for the success of generalized database management systems. A wide variety of approaches to improve the performance of query evaluation algorithms have been proposed: logicbased and semantic transformations, fast implementations of basic operations, and combinatorial or heuristic algorithms for generating alternative access plans and choosing among them. These methods are presented in the framework of a general query evaluation procedure using the relational calculus representation of queries. In addition, nonstandard query optimization issues such as higher level query evaluation, query optimization in distributed databases, and use of database machines are addressed. The focus, however, is on query optimization in centralized database systems.
Hypothetical Datalog: Complexity and Expressibility
 Theoretical Computer Science
, 1988
"... We present an extension of Hornclause logic which can hypothetically add and delete tuples from a database. Such logics have been discussed in the literature, but their complexities and expressibilities have remained an open question. This paper examines two such logics in the functionfree, predic ..."
Abstract

Cited by 36 (15 self)
 Add to MetaCart
We present an extension of Hornclause logic which can hypothetically add and delete tuples from a database. Such logics have been discussed in the literature, but their complexities and expressibilities have remained an open question. This paper examines two such logics in the functionfree, predicate case. It is shown, in particular, that augmenting Hornclause logic with hypothetical addition increases its datacomplexity from PTIME to PSPACE. When deletions are added as well, complexity increases again, to EXPTIME. We then augment the logic with negationasfailure and develop the notion of stratified hypothetical rulebases. It is shown that negation does not increase complexity. To establish expressibility, we view the logic as a query language for relational databases. It is shown that any typed generic query that is computable in PSPACE can be expressed as a stratified rulebase of hypothetical additions. Similarly, any typed generic query that is computable in EXPTIME can be exp...
The Expressiveness of a Family of Finite Set Languages
 IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
, 1991
"... In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple syntactic restrictions on it, we are able to express exactly the classes, P and LOGSPACE. We also discuss the role of orde ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple syntactic restrictions on it, we are able to express exactly the classes, P and LOGSPACE. We also discuss the role of ordering in database query languages and show that the hom operator of Machiavelli language in [OBB89] does not capture all the orderindependent properties.
Guarded open answer set programming
 LPNMR
, 2005
"... Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a fixed point logic (FPL) extension of Clark’s completion such that open answer sets correspond to models of FPL formulas and ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a fixed point logic (FPL) extension of Clark’s completion such that open answer sets correspond to models of FPL formulas and identify a syntactic subclass of programs, called (loosely) guarded programs. Whereas reasoning with general programs in OASP is undecidable, the FPL translation of (loosely) guarded programs falls in the decidable (loosely) guarded fixed point logic (µ(L)GF). Moreover, we reduce normal closed ASP to loosely guarded OASP, enabling a characterization of an answer set semantics by µLGF formulas. Finally, we relate guarded OASP to Datalog LITE, thus linking an answer set semantics to a semantics based on fixed point models of extended stratified Datalog programs. From this correspondence, we deduce 2EXPTIMEcompleteness of satisfiability checking w.r.t. (loosely) guarded programs.
Guarded Open Answer Set Programming with Generalized Literals
 In Fourth International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2006
, 2005
"... Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infinity axioms EPs that have but infinite answer sets. However, reasoning under the open answer set semantics, in particul ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infinity axioms EPs that have but infinite answer sets. However, reasoning under the open answer set semantics, in particular satisfiability checking of a predicate w.r.t. a program, is already undecidable for programs without generalized literals. In order to regain decidability, we restrict the syntax of EPs such that both rules and generalized literals are guarded. Viaa translation to guarded fixed point logic (µGF), in which satisfiability checking is 2EXPTIMEcomplete, we deduce 2EXPTIMEcompleteness of satisfiability checking in such guarded EPs (GEPs). Bound GEPs are restricted GEPs with EXPTIMEcomplete satisfiability checking, but still sufficiently expressive to optimally simulate computation tree logic (CTL). We translate Datalog LITE programs to GEPs, establishing equivalence of GEPs under an open answer set semantics, alternationfree µGF, and Datalog LITE. Finally, we discuss ωrestricted logic programs under an open answer set semantics. 1
A Universal Model For NonProcedural Database Languages
, 1995
"... We propose a language which can express every computable query. The language is syntactically based on the firstorder predicate calculus, but semantically is interpreted as postconditions, unlike the customary calculus query languages. The language has a capability to restrict itself to reasonab ..."
Abstract
 Add to MetaCart
We propose a language which can express every computable query. The language is syntactically based on the firstorder predicate calculus, but semantically is interpreted as postconditions, unlike the customary calculus query languages. The language has a capability to restrict itself to reasonable queries, accepting criteria of reasonability as a parameter.