Abstract
12 We define four different properties of relational databases which are related to the notion of homogeneity in classical Model Theory. The main question for their definition is, for any given database, which is the minimum integer k, such that whenever two k-tuples satisfy the same properties which are expressible in First Order Logic with up to k variables (FOk), then there is an automorphism which maps each of these k-tuples onto each other? We study these four properties as a means to increase the computational power of sub-classes of Reflective Relational Machines (RRM) of bounded variable complexity. For this sake we give first a semantic characterization of the sub-classes of total RRM with variable complexity k, for every natural k, with the classes of queries which we denote as \( \mathcal{Q}\mathcal{C}\mathcal{Q}^k \). We prove that these classes form a strict hierarchy in a strict sub-class of total\( \left( {\mathcal{Q}\mathcal{C}} \right) \). And it follows that it is orthogonal with the usual classification of computable queries in Time and Space complexity classes. We prove that the computability power of RRMk machines is much bigger when working with classes of databases which are homogeneous, for three of the properties which we define. As to the fourth one, we prove that the computability power of RRM with sub-linear variable complexity also increases when working on databases which satisfy that property. The strongest notion, pairwise k-homogeneity, allows RRMk machines to achieve completeness.
The work presented here was partially done during a visit to the Department of Mathematics of the University of Helsinki.
This work has been partially supported by Grant 1011049 of the Academy of Finland and by Grants of Universidad CAECE and Universidad de Luján, Argentina.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Papadimitriou, C. and Vianu, V.: The Power of the Reflective Relational Machine. Proc. of 9th IEEE Symposium on Logic in Computer Science (1994)
Abiteboul, S. and Vianu, V.: Generic Computation and its Complexity. Proc. of 23th ACM Symposium on Theory of Computing (1991) 209–219
Abiteboul, S., Vianu, V.: Computing with first-order logic. Journal of Computer and System Sciences (1994)
Abiteboul, S., Vardi, M. and Vianu, V.: Fixpoint Logics, Relational Machines, and Computational Complexity. Proc. of 7th IEEE Conference on Structure in Complexity Theory (1992) 156–168
Abiteboul, S., Vardi, M. and Vianu, V.: Computing with Infinitary Logic. Proc. of International Conference on Database Theory (1992)
Chandra, A. and Harel, D.: Computable Queries for Relational Data Bases. Journal of Computer and System Sciences 21 (1980) 156–178
Chandra, A. and Harel, D.: Structure and Complexity of Relational Queries. Journal of Computer and System Sciences 25 (1982) 99–128
Chang, C. and Keisler, H.: Model Theory. 3rd edn. Elsevier North Holland (1992)
Dawar, A.: Feasible Computation Through Model Theory. PhD Thesis. University of Pennsylvania, Philadelphia (1993)
Gurevich, Y.: Logic and the Challenge of Computer Science. Trends in Theoretical Computer Science. Computer Science Press (1988)
Immerman, N.: Upper and Lower Bounds for First Order Expressibility. Journal of Computer and System Sciences 25 (1982) 76–98
Kolaitis, P. and Vardi, M.: 0–1 Laws for Infinitary Logic. Proc. of 5th IEEE Symposium on Logic in Computer Science (1990)
Seth, A.: When do Fixed Point Logics Capture Complexity Classes?. Proc. of 10th IEEE Symposium on Logic in Computer Science (1995)
Turull Torres, J.M.: Query Completeness, Distinguishability and Relational Machines. Models, Algebras and Proofs: Selected Papers from the X Latin American Symposium on Mathematical Logic, Bogotá 1995. Marcel-Dekker (1998) 135–163
Turull Torres, J.M.: Partial Distinguishability and Query Computability on Finite Structures. Communicated in the XI Brazilean Symposium on Logic, Salvador, Brazil, 1996. Abstract published in Bulletin of the IGPL 3 (1996)
Turull Torres, J.M.: Reflective Relational Machines of Bounded Variable Complexity. Proc. of Short Papers, Third East-European Conference on Advances in Databases and Information Systems, edited by University of Maribor, Slovenia (1999) 193–199
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maria, J., Torres, T. (2000). Reflective Relational Machines Working on Homogeneous Databases. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_18
Download citation
DOI: https://doi.org/10.1007/3-540-46564-2_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67100-8
Online ISBN: 978-3-540-46564-5
eBook Packages: Springer Book Archive