On the computation of approximations of database queries
Abstract
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of queries to relational databases. The machines are equipped with a relational store which can be accessed by means of dynamically built first order logic queries. We initiate a study on approximations of computable queries, defining, for every natural k, the k-approximation of an arbitrary computable query q. This, in turn, motivates us to define a new variation of Reflective Relational Machines by considering two different logics to express dynamic queries: one for queries and a possibly different one for updates to the relational store. We prove several results relating k-approximations of queries with the new machines, and also with classes of queries defined in terms of preservation of equality of FOk theories. Finally, we summarize a few open problems related to our work.
References
[1]
Abiteboul S., Hull R., Vianu V. (1994), Foundations of Databases. Addison-Wesley.
[2]
Abiteboul S., Papadimitriou C. and Vianu V. (1994), The power of reflective relational machines. Proceedings 9th Symposium on Logic in Computer Science, pp. 230--240.
[3]
Abiteboul S., Papadimitriou C., Vianu V. (1998), Reflective Relational Machines. Information and Computation 143, pp. 110--136.
[4]
Abiteboul S., Vianu V. (1991), Generic computation and its complexity. Proc. 23rd ACM Symposium on Theory of Computing.
[5]
Abiteboul S., Vianu V. (1995), Computing with First-Order Logic. JCSS 50(2), pages 309--335.
[6]
Abiteboul S., Vardi M. Y., Vianu V. (1995), Computing with Infinitary Logic. Theoretical Computer Science 149(1), pp. 101--128.
[7]
Abiteboul S., Vardi M. Y., Vianu V. (1997), Fixpoint logic, relational machines, and computational complexity. Journal of ACM 44(1), pp. 30--56.
[8]
Aho A. V., Ullman J. D. (1979), Universality of Data Retrieval Languages. Proceedings 6th ACM Symp. on Principles of Programming Languages.
[9]
Chandra A. K., Harel D. (1980), Computable Queries for Relational Data Bases. Journal of Computer and System Sciences 21(2), pp. 156--178.
[10]
Dawar, A. (1993), Feasible Computation through Model Theory. Ph.D. thesis, University of Pennsylvania, Philadelphia.
[11]
Dawar, A., Lindell, S., Weinstein, S. (1995), Infinitary Logic and Inductive Definability over Finite Structures. Information and Computation 119(2), pp. 160--175.
[12]
Ebbinghaus H., Flum J. (1999), Finite Model Theory. Springer, 2nd. ed.
[13]
Ebbinghaus H., Flum J., Thomas W. (1984), Mathematical Logic. Springer.
[14]
Hella L., Kolaitis P., Luosto K. (1996), Almost Everywhere Equivalence of Logics in Finite Model Theory. The Bulletin of Symbolic Logic 2, 4 422--443.
[15]
Hopcroft J., Ullman J. (1979), Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
[16]
Immerman N. (1999), Descriptive Complexity. Springer.
[17]
Ioannidis Y., Poosala V. (1999), Histogram-Based Approximation of Set-Valued Query Answers, Proceedings of the 25th VLDB Conference, Edinburgh, Scotland.
[18]
Link S., Turull Torres J. M. (2003), Towards optimising query evaluation with quotient databases. Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Dresden, Germany, Local Proceedings, pp. 28--37.
[19]
Otto M. (1996), The Expressive Power of Fixed Point Logic with Counting. Journal of Symbolic Logic 61, 1 147--176.
[20]
Otto M. (1997), Bounded Variable Logics and Counting. Springer.
[21]
Pavlov D., Mannila H., Smyth P. (2001), Beyond independence: probabilistic methods for query approximation on binary transaction data. In Technical report ICS TR-01-09, Information and Computer Science Department, UC Irvine, 2001.
[22]
Turull Torres J. M. (2001), A Study of Homogeneity in Relational Databases. Annals of Mathematics and Artificial Intelligence, 33(2), p. 379--414.
[23]
Turull Torres J. M. (2002), Relational Databases and Homogeneity in Logics with Counting. Foundations of Information and Knowledge Systems: Second International Symposium, FoIKS 2002, Germany, February 2002, Springer LNCS.
[24]
Ullman J. D. (1988), Principles of database and knowledge Base Systems: Volume I and II. Computer Science Press.
Index Terms
- On the computation of approximations of database queries
Recommendations
Efficient approximations of conjunctive queries
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database SystemsWhen finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such ...
A study of homogeneity in relational databases
We define four different properties of relational databases which are related tothe notion of homogeneity in classical model theory. The main question for their definition is, for any given database to determine the minimum integer i>k, such that ...
Efficient Approximations of Conjunctive Queries
When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such ...
Comments
Information & Contributors
Information
Published In
Publisher
Australian Computer Society, Inc.
Australia
Publication History
Published: 01 January 2004
Author Tags
Qualifiers
- Article
Conference
ADC '04
Acceptance Rates
Overall Acceptance Rate 98 of 224 submissions, 44%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 309Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)10
Reflects downloads up to 19 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in