Oleg V. Belegradek, Alexei P. Stolboushkin  @ NUS Home/Search
Context
Related
| rutgers.edu/pub/dimacs/Te...9556.ps.gz Cached: PS.gz PS PDF Image Update Help From: rutgers.edu/TechnicalRepor...1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider a scheme of databases Q and two signatures: L 0 = f!g, L = f!g[ where\Omega is a finite relational signature. For a database scheme SC = fR 1 ; : : : ; R n g, denote L + 0 = L 0 [SC and L + = L [ SC. FO is the first-order language. FO in L + 0 is called restricted. FO in L + is called extended. Consider a countable universe U in L. Assume CH. It is possible to reconstruct the proofs of corollaries into ones not using CH. Let V be a saturated elementary extension of U in power... (Update)
Similar documents (at the sentence level):
33.7%: On Order-Generic Queries - Belegradek, Stolboushkin (1996) (Correct)
29.8%: Linear vs. Order Constraint Queries Over Rational Databases - Exte Nd Ed (Correct)
Active bibliography (related documents): More All
0.1: On Problems Of Databases Over A Fixed Infinite Universe - Belegradek, Stolboushkin.. (1998) (Correct)
0.1: Extended Order-Generic Queries - Belegradek, Stolboushkin, Taitslin (1996) (Correct)
0.1: Relational Queries over Interpreted Structures - Benedikt, Libkin (Correct)
Similar documents based on text: More All
0.4: Normalizable Linear Orders and Generic Computations in.. - Stolboushkin, Taitslin (Correct)
0.3: Safe Stratified Datalog With Integer Order Does not Have.. - Alexei Stolboushkin.. (1997) (Correct)
0.2: Finite Queries do not Have Effective Syntax - Stolboushkin, Taitslin (1995) (Correct)
BibTeX entry: (Update)
@misc{ belegradek-relational,
author = "Oleg V. Belegradek and Alexei P. Stolboushkin",
title = "Relational Expressive Power of Local Generic Queries",
url = "citeseer.comp.nus.edu.sg/102725.html" }
Citations (may not include all citations):315 Constraint query languages - Kanellakis, Kuper et al. - 1990
315 Constraint query languages - Kanellakis, Kuper et al. - 1995
227 North Holland (context) - Chang, Keisler - 1990
83 Relational expressive power of constraint query languages - Benedikt, Dong et al. - 1995
72 Finitely representable databases - Grumbach, Su - 1994
64 Constraint programming and database query languages - Kanellakis, Goldin - 1994
44 First-order queries on finite structures over reals - Paradaens, Van den Bussche et al. - 1995
31 Linear constraint databases (context) - Grumbach, Su et al. - 1995
28 Dense-order constraint databases (context) - Grumbach, Su - 1995
16 First-order queries on databases embedded in an infinite str.. - Otto, Van den Bussche - 1995
Documents on the same site (http://dimacs.rutgers.edu/TechnicalReports/1995.html): More
Localizing a Robot with Minimum Travel - Dudek, Romanik, Whitesides (1995) (Correct)
On a Metric Generalization of Ramsey's Theorem - Erdös, Hajnal, Pach (1995) (Correct)
On the Approximability of Numerical Taxonomy.. - Agarwala, Bafna.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.