See this document in CiteSeerX!

Implementation of Constraint Database Systems Using a Compile-Time Rewrite Approach (1996)  (Make Corrections)  
Roman Gross-Brunschwiler



  Home/Search   Context   Related

 
View or download:
inf.ethz.ch/pub/publica...th11656.ps.gz
inf.ethz.ch/research/pu...th11656.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dinis.inf.ethz.ch/publi...diss.de (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The declarative style of database query languages is an important aspect of deductive or relational database systems. However, the declarative spirit is usually restricted to the specification of derived relations (views) and sets of answers satisfying specified queries. Base predicates are explicit enumerations of tuples that satisfy the relations, i.e. the extension of these predicates. Such systems do not allow the representation of infinite extensions, which arise for example in temporal or ... (Update)

Active bibliography (related documents):   More   All
0.5:   A Database Approach for Modeling and Querying Video Data - Cyril Decleir.. (1999)   (Correct)
0.5:   Subsumption-Free Bottom-Up Evaluation of Logic.. - Somogyi, Kemp.. (1994)   (Correct)
0.5:   Reconciling Point-based and Interval-based Semantics in.. - Terenziani, Snodgrass (2001)   (Correct)

Similar documents based on text:   More   All
0.3:   A Network Architecture Based On Market Principles - Fankhauser (2000)   (Correct)
0.3:   Entropy Measures and Unconditional Security in Cryptography - Cachin (1997)   (Correct)
0.2:   Efficiency and Security of Cryptosystems based on Number Theory - Bleichenbacher (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ gross-brunschwiler-implementation,
  author = "Roman Gross-Brunschwiler",
  title = "Implementation of Constraint Database Systems Using a Compile-Time Rewrite
    Approach",
  url = "citeseer.ist.psu.edu/gross-brunschwiler96implementation.html" }
Citations (may not include all citations):
634   A machine oriented logic based on the resolution principle (context) - Robinson - 1965
440   The Art of Prolog (context) - Sterling, Shapiro - 1994
395   An abstract Prolog instruction set (context) - Warren - 1993
312   The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
248   The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
139   fold transformations of logic programs (context) - Tamaki, Sato - 1986
115   Magic Templates: A spellbinding approach to logic programs - Ramakrishnan
88   Principles of Database and Knowledge Base Systems (context) - Ullman - 1989
87   Towards a theory of spatial database queries (context) - Paredaens, van den Bussche et al.
77   Constructive negation for constraint logic programming (context) - Stuckey - 1991
58   A closed form for datalog queries with integer order (context) - Revesz
55   CONSTRAINTS - a language for expressing almost hierarchical .. (context) - Steele, Sussman - 1980
41   an efficient purely declarative logic programming language (context) - Somogyi, Henderson et al. - 1995
35   Subsumption and indexing in constraint query languages with .. - Srivastava - 1993
35   Safety and translation of relational calculus queries (context) - van Gelder, Topor - 1991
28   A Man-Machine Graphical Communication System (context) - Sutherland - 1963
26   Datalog with integer periodicity constraints - Toman, Chomicki et al.
25   on Management of Data (context) - Conf - 1989
23   Preparata and Michael (context) - Franco - 1985
21   Unfounded sets and well-founded semantics for general logic .. (context) - van Gelder, Ross et al.
19   The benefits of global dataflow analysis for an optimizing p.. (context) - van Roy, Despain
14   Negation by constraints: A sound and efficient implementatio.. (context) - Wallace - 1987
12   Compiling query constraints (context) - Stuckey, Sudarshan
11   Top-down beats bottom-up for constraint based extensions of .. (context) - Toman - 1995
4   Bottom-up beats top-down for datalog (context) - Ullmann - 1989
3   Multiple sip strategies and bottom-up adorning in logic quer.. (context) - Sippu, Soisalon-Soininen
3   Cummings Publishing Company (context) - Tansel, Clifford et al. - 1993
2   Subsumption-free bottom-up evaluation of logic programs with.. - Somogyi, Kemp et al. - 1994
2   Adding valid time --- part - Snodgrass, ohlen et al. - 1995
2   Raghu Ramakrishnan (context) - Srivastava
1   Design and Implementation of the Rule Language RL (context) - van Denneheuvel, on - 1991
1   chapter The Simplex Method (context) - Schrijver, Linear et al. - 1986
1   Weak equivalence for constraint sets (context) - van Denneheuvel, Kwast - 1991
1   Implementation of logical query languages for databases (context) - Ullmann - 1985
1   A preliminary version appeared in [POD (context) - Srivastava, Ramakrishnan et al. - 1993

Documents on the same site (http://dinis.inf.ethz.ch/publications/diss.de.html):   More
Efficiency and Security of Cryptosystems Based on Number Theory - Bleichenbacher (1996)   (Correct)
Extending a Library for Geometric Computation to Provide.. - De Lorenzi (1995)   (Correct)
Design of Neural Networks Using a Priori Knowledge - Cozzio-Büeler (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC