The Glue-Nail deductive database system: Design, implementation, and evaluation

Derr, Marcia A.; Morishita, Shinichi; Phipps, Geoffrey

doi:10.1007/bf01228879

Cited by 20 publications

(13 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have compared Ross's method and our technique. The performance results can be found in Derr et al [11] and Morishita [17]. The results show that, although one can write a modularly stratified program for which our method runs slower than Ross's technique, the converse is also true, depending on the properties of the EDB relations.…”

Section: Techniques For Modularly Stratified Programsmentioning

confidence: 65%

“…Actually, we prohibited unsafe usage of negation when we incorporated our method into the Glue Nail deductive database system [10,11].…”

Section: Each Rule In Pmentioning

confidence: 99%

“…We have incorporated our method into the Glue Nail database system [10,11]. An earlier version of the system employed Ross's method [23].…”

Section: Techniques For Modularly Stratified Programsmentioning

confidence: 99%

See 2 more Smart Citations

An Extension of Van Gelder's Alternating Fixpoint to Magic Programs

Morishita

1996

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

We study the application of the magic-sets transformation technique to Datalog c (function-free programs with negation) that may not have two-valued well-founded models. In this general setting, the wellfounded model of the original program does not always agree with the well-founded model of the magic program derived by commonly used left-to-right sideways information-passing strategies on the query. In order to correct this disagreement we present a novel method that is obtained by slightly and naturally tailoring Van Gelder's alternating fixpoint technique to any magic program. ]

show abstract

Section: Techniques For Modularly Stratified Programsmentioning

confidence: 65%

“…Actually, we prohibited unsafe usage of negation when we incorporated our method into the Glue Nail deductive database system [10,11].…”

Section: Each Rule In Pmentioning

confidence: 99%

See 1 more Smart Citation

An Extension of Van Gelder's Alternating Fixpoint to Magic Programs

Morishita

1996

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…The purely declarative semantics of Dedalus, based on the reification of logical time into facts, are closer in spirit and interpretation to Statelog [29] and the languages proposed by Cleary and Liu [15,30,33] than to languages that admit procedural semantics to deal with update and deletion over time [12,16]. Previous work in temporal deductive databases attempted to compute finite representations for periodic phenomena [13]: we reuse many of these results in Dedalus.…”

Section: Related Workmentioning

confidence: 99%

Confluence Analysis for Distributed Programs: A Model-Theoretic Approach

Marczak¹,

Alvaro²,

Conway³

et al. 2011

View full text Add to dashboard Cite

Building on recent interest in distributed logic programming, we take a model-theoretic approach to analyzing confluence of asynchronous distributed programs. We begin with a model-theoretic semantics for Dedalus and develop the concept of ultimate models to capture the non-deterministic eventual outcomes of distributed programs. After demonstrating the undecidability of checking confluence for Dedalus programs, we look for restricted sub-languages that guarantee confluence while providing adequate expressivity. We observe that a simple semipositive restriction called Dedalus + guarantees confluence while capturing PTIME, but demonstrate that the limited use of negation in Dedalus + makes certain simple and practical programs very difficult to express. To remedy this, we introduce Dedalus S , a restriction of Dedalus that allows a natural use of negation in the spirit of stratified negation, but retains the confluence of Dedalus + and similarly captures PTIME.

show abstract

“…Many deductive database systems, including LDL [7] and GlueNail [10], admit procedural semantics to deal with updates using an assignment primitive. In contrast, languages proposed by Cleary and Liu [9,18,22] retain a purely logical interpretation by admitting temporal extensions into their syntax and interpreting assignment or update as a composite operation across timesteps [18] rather than as a primitive.…”

Section: Updateable Statementioning

confidence: 99%

Dedalus: Datalog in Time and Space

et al. 2011

View full text Add to dashboard Cite

Recent research has explored using Datalog-based languages to express a distributed system as a set of logical invariants [2,19]. Two properties of distributed systems proved difficult to model in Datalog. First, the state of any such system evolves with its execution. Second, deductions in these systems may be arbitrarily delayed, dropped, or reordered by the unreliable network links they must traverse. Previous efforts addressed the former by extending Datalog to include updates, key constraints, persistence and events, and the latter by assuming ordered and reliable delivery while ignoring delay. These details have a semantics outside Datalog, which increases the complexity of the language or its interpretation, and forces programmers to think operationally. We argue that the missing component from these previous languages is a notion of time.In this paper we present Dedalus, a foundation language for programming and reasoning about distributed systems. Dedalus reduces to a subset of Datalog [30] with negation, aggregate functions, successor and choice, and admits an explicit representation of time into the logic language. We show that Dedalus provides a declarative foundation for the two signature features of distributed systems: mutable state, and asynchronous processing and communication. Given these two features, we address three important properties of programs in a domain-specific manner: a notion of safety appropriate to non-terminating computations, stratified monotonic reasoning with negation over time, and efficient evaluation over time via a simple execution strategy. We also provide conservative syntactic checks for our temporal notions of safety and stratification. Our experience implementing full-featured systems in variants of Datalog suggests that Dedalus is well-suited to the specification of rich distributed services and protocols, and provides both cleaner semantics and richer tests of correctness.

show abstract

The Glue-Nail deductive database system: Design, implementation, and evaluation

Cited by 20 publications

References 23 publications

An Extension of Van Gelder's Alternating Fixpoint to Magic Programs

An Extension of Van Gelder's Alternating Fixpoint to Magic Programs

Confluence Analysis for Distributed Programs: A Model-Theoretic Approach

Dedalus: Datalog in Time and Space

Contact Info

Product

Resources

About