See this document in CiteSeerX!

First-Order Queries on Databases Embedded in an Infinite Structure (1995)  (Make Corrections)  (16 citations)
Martin Otto, Jan Van den Bussche
Information Processing Letters



  Home/Search   Context   Related

 
View or download:
luc.ac.be/~vdbuss/...ses_embedded.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  luc.ac.be/~vdbuss/pubs (more)
(Enter author homepages)

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

Abstract: We consider "generic" (isomorphism-invariant) queries on relational databases embedded in an infinite background structure. Assume a generic query is expressible by a first-order formula over the embedded domain that may involve both the relations of the database and the relations and functions of the background structure. Then this query is already expressible by a first-order formula involving just an auxiliary linear ordering as background structure. We present an elementary proof of... (Update)

Context of citations to this paper:   More

...use this result to get a new complexity upper bound on the evaluation of real arithmetic constraints. We also expand upon techniques in [21] and [4] for getting upper bounds on the expressiveness of constraint query languages, and apply it to a number of first order and second...

...isomorphism from fAD(f(s) f(a)g onto fAD(g(r) g(b)g. Q.E.D. As a side remark, note that this technique implies the result from [2] and [13] about the so called active semantics. Consider FO formulas over the signature L . Any quantifier free formula is called active. Let...

Cited by:   More
Relational Expressive Power of Constraint Query Languages - Benedikt, Dong, Libkin, Wong (1995)   (Correct)
First-Order Queries on Finite Structures Over the Reals - Paredaens, Van den.. (1995)   (Correct)
Extended Order-Generic Queries - Belegradek, Stolboushkin, Taitslin (1996)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Locally Compact Linearly Lindelöf Spaces - Kunen (2001)   (Correct)
0.1:   On O-Minimal Hybrid Systems - Brihaye, Michaux, Rivière, Troestler (2004)   (Correct)
0.1:   A CLP View of Logic Programming - Maher (1992)   (Correct)

Similar documents based on text:   More   All
0.1:   Embedded Finite Models, Stability, and the Impact of Order - Baldwin, Benedikt (1998)   (Correct)
0.1:   First-Order Conditional Logic Revisited - Friedman, Halpern, Koller   (Correct)
0.1:   Nonmonotonic Reasoning for FirstOrder Programs - Petukhin   (Correct)

Related documents from co-citation:   More   All
16:   Relational expressive power of constraint query languages - Benedikt, Dong et al. - 1995
16:   Constraint Query Languages - Kanellakis, Kuper et al. - 1990
14:   First-order queries on finite structures over the reals - Paredaens, Van den Bussche et al. - 1995

BibTeX entry:   (Update)

M. Otto and J. Van den Bussche. Firstorder queries on databases embedded in an infinite structure. Technical Report, University of Antwerp, October 1995. http://citeseer.ist.psu.edu/otto95firstorder.html   More

@article{ otto96firstorder,
    author = "Martin Otto and Jan Van den Bussche",
    title = "First-Order Queries on Databases Embedded in an Infinite Structure",
    journal = "Information Processing Letters",
    volume = "60",
    number = "1",
    pages = "37-41",
    year = "1996",
    url = "citeseer.ist.psu.edu/otto95firstorder.html" }
Citations (may not include all citations):
775   Foundations of Databases (context) - Abiteboul, Hull et al. - 1994
294   Finite Model Theory (context) - Ebbinghaus, Flum - 1995
163   Universality of data retrieval languages (context) - Aho, Ullman - 1979
133   Cambridge University Press (context) - Hodges - 1993
83   Relational expressive power of constraint query languages - Benedikt, Dong et al. - 1996
55   Classifying regular events in symbolic logic (context) - Thomas - 1982
44   Firstorder queries on finite structures over the reals - Paredaens, Van den Bussche et al. - 1995
40   Definable sets in ordered structures (context) - Pillay, Steinhorn - 1986
19   Properties of almost all graphs and complexes (context) - Blass, Harary - 1979
19   Computable queries for relational database systems (context) - Chandra, Harel - 1980
7   Third edition (context) - Chang, Keisler - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.luc.ac.be/~vdbuss/pubs.html):   More
Efficient on-Line Topological Simplification of.. - Geerts, Revesz, Van..   (Correct)
Solving Equations in the Relational Algebra - Biskup, Paredaens, Schwentick, ..   (Correct)
On Topological Elementary Equivalence of Spatial.. - Kuijpers, Paredaens.. (1997)   (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