Article

Free access

Invited talk: automata theory for database theoreticians

Author:

M. Y. VardiAuthors Info & Claims

PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 83 - 92

https://doi.org/10.1145/73721.73729

Published: 29 March 1989 Publication History

PDF eReader

References

[1]

Afrati, F., Papadimitriou, C.H.: The parallel complexity of simple chain queries. Proc. 6th A CM Symp. on Principles of Database Systems, San Diego, 1987, pp. 210-213.

Digital Library

Google Scholar

[2]

Beeri, C., Kanellakis, P.C., Bancilhon, F., Ramakrishnan, R.: Bounds on the propagation of selection into logic programs. Proc. 6th A CM Symp. on Principles of Database Systems, San Diego, 1987, pp. 214- 226.

Digital Library

Google Scholar

[3]

Bancilhon, F., Ramakrishnan, R.: An amateur's introduction to recursive query processing strategies. Proc. A CM Conf. on Management of Data, Washington, 1986, pp. 16- 52.

Digital Library

Google Scholar

[4]

Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable Optimization Problems for Database Logic Programs. Proc. 20th ACM Syrup. on Theory of Computing, 1988, pp. 477-490.

Digital Library

Google Scholar

[5]

Doner, J.E.: Tree aeceptors and some of their applications. Y. Computer and System Science 4(1971), pp. 406-451.

Digital Library

Google Scholar

[6]

Galil, Z." Hierarchy of complete problems. Acta Informatica 6(1976), pp. 77-88.

Digital Library

Google Scholar

[7]

Gaifman, H., Mairson, H., Sagiv, Y., Vardi M.Y.: Undeeidable optimization problems for database logic programs. Proc. 2nd IEEE Syrup. on Logic in Computer Science, Ithaca, 1987, pp. 106-115.

Google Scholar

[8]

Gecseg, F., Steinby, M.: Tree automata. Akademiai Kiado, Budapest, 1984.

Google Scholar

[9]

Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison- Wesley, 1979.

Digital Library

Google Scholar

[10]

Ioannidis, Y.E.: A time bound on the materialization of some recursively defined views. Proc. 11th Int'l Conf. on Very Large Data Bases, Stockholm, 1985, pp. 219-226.

Google Scholar

[11]

ones, N.D.: Spacebounded reducibility among combinatorial problems. J. Computer and System Sciences 11(1975), pp. 68- 85.

Digital Library

Google Scholar

[12]

Kifer, M., Ramakrishnan, R., Silberschatz, A.: An axiomatic approach to deciding query safety in deductive databases. Proc. 7th A CM Symp. on Principles of Database Systems, Austin, 1988, pp. 52-60.

Digital Library

Google Scholar

[13]

Krishnamurthy, R., Ramakrishnan, R., Shmueli, O.: A framework for testing safety and effective computability of extended Datalog. Proc. A CM Symp. on Management of Data, Chicago, 1988, pp. 154-163.

Digital Library

Google Scholar

[14]

Naughton, j.F.: Data independent recursion in deductive databases. Proc. 5th A CM Symp. on Principles of Database Systems, Cambridge, 1986, pp. 267-279. To appear in J. Computer and System Sciences.

Digital Library

Google Scholar

[15]

Naughton, J.F., Sagiv, Y.: A decidable class of bounded reeursions. Proc. 6th A CM Symp. on Principles of Database Systems, San Diego, 1987, pp. 227-236.

Digital Library

Google Scholar

[16]

Rabin, M.O.: Weakly definable relations and special automata. Proc. Symp. on Mathematical Logic and Foundations of Set Theory (Y. Bar- Hilel, ed.), North-Holland, 1970, pp. 1-23.

Crossref

Google Scholar

[17]

Ramakrishnan, R., Bancilhon, F., Silberschatz, A." Safety of recursive Horn clauses with infinite relations. Proc. 6th A CM Syrup. on Principles of Database Systems, San Diego, 1987, pp. 328-339.

Digital Library

Google Scholar

[18]

Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Research and Development, 3(1959), pp. 114-125.

Digital Library

Google Scholar

[19]

Sagiv, Y.: On computing restricted projections of representative instances. Proc. 4th A CM Syrup. on Principles of Database Systems, Portland, 1985, pp. 171-180.

Digital Library

Google Scholar

[20]

Shepherdson, J.C.: The reduction on two-way automata to one-way automata. IBM J. Research and Development, 3(1959), pp. 199-201.

Digital Library

Google Scholar

[21]

Slutzki, G.: Alternating tree automata. Theoretical Computer Science 41(1985), pp. 305-318.

Digital Library

Google Scholar

[22]

Sagiv, Y., Vardi, M.Y.: Safety of Datalog queries over infinite databases. This volume.

Google Scholar

[23]

Thomas, W.: Automata on infinite objects. Research Report, RWTH Aachen Fachgruppe Informatik, 1988, to appear in Handbook of Theoretical Computer Science (J. v. Leeuwen, ed.), North-Holland.

Google Scholar

[24]

Thatcher, J.W., Wright, 3.B." Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical System Theory 2(1968), pp. 57-81.

Crossref

Google Scholar

[25]

Ullman, J .D.: Implementation of logical query languages for databases. A CM Trans. on Database Systems 10(1985), pp. 289--321.

Digital Library

Google Scholar

[26]

Ullman, J.D., Van Gelder, A." Parallel complexity of logical query programs. Proc. 27th IEEE Symp. on Foundations of Computer Science, Toronto, 1986, pp. 438-454.

Digital Library

Google Scholar

[27]

Vardi, M.Y.: Decidability and undecidability results for boundedness of linear recursive queries. Proc. 7th A CM Symp. on Principles of Database Systems, 1988, pp. 341- 351.

Digital Library

Google Scholar

Cited By

View all

Baader FBienvenu MLutz CWolter F(2010)Query and predicate emptiness in description logicsProceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031748.3031777(192-202)Online publication date: 9-May-2010
https://dl.acm.org/doi/10.5555/3031748.3031777
de Moor OSereni DAvgustinov PVerbaere MKolaitis PLenzerini M(2008)Type inference for datalog and its application to query optimisationProceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1376916.1376957(291-300)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1376916.1376957
Tao Y(2006)Infinity problems and countability problems for ω-automataInformation Processing Letters10.1016/j.ipl.2006.06.011100:4(151-153)Online publication date: 30-Nov-2006
https://dl.acm.org/doi/10.1016/j.ipl.2006.06.011
Show More Cited By

Index Terms

Invited talk: automata theory for database theoreticians

Recommendations

Database theory column

The 26th edition of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Databases (PODS), took place from 11 to 13 June 2007. As usual since 1991, the symposium was organized jointly with the ACM SIGMOD International Conference on Management of ...
Theory and practice of string solvers (invited talk abstract)
ISSTA 2019: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis

The paper titled "Hampi: A Solver for String Constraints" was published in the proceedings of the International Symposium on Software Testing and Analysis (ISSTA) 2009, and has been selected to receive the ISSTA 2019 Impact Paper Award. The paper ...
Database theory column: report on PODS 2006

The 25th edition of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Databases (PODS), took place from 26 to 29 June 2006, at the Renaissance Chicago Hotel in Chicago. As usual since 1991, the symposium was organized jointly with the ACM SIGMOD ...

Comments

Information & Contributors

Information

Published In

PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

March 1989

401 pages

ISBN:0897913086

DOI:10.1145/73721

Chairman:
Avi Silberschatz
Univ. of Texas, Austin

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 March 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODS '89

Sponsor:

PODS '89: Principles of database systems

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
670
Total Downloads

Downloads (Last 12 months)88
Downloads (Last 6 weeks)19

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Baader FBienvenu MLutz CWolter F(2010)Query and predicate emptiness in description logicsProceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031748.3031777(192-202)Online publication date: 9-May-2010
https://dl.acm.org/doi/10.5555/3031748.3031777
de Moor OSereni DAvgustinov PVerbaere MKolaitis PLenzerini M(2008)Type inference for datalog and its application to query optimisationProceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1376916.1376957(291-300)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1376916.1376957
Tao Y(2006)Infinity problems and countability problems for ω-automataInformation Processing Letters10.1016/j.ipl.2006.06.011100:4(151-153)Online publication date: 30-Nov-2006
https://dl.acm.org/doi/10.1016/j.ipl.2006.06.011
Vardi M(2005)Model checking for database theoreticiansProceedings of the 10th international conference on Database Theory10.1007/978-3-540-30570-5_1(1-16)Online publication date: 5-Jan-2005
https://dl.acm.org/doi/10.1007/978-3-540-30570-5_1
Bernholtz OGrumberg O(2005)Branching time temporal logic and amorphous tree automataCONCUR'9310.1007/3-540-57208-2_19(262-277)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-57208-2_19
Lakshmanan LNonen D(2005)Superfiniteness of query answers in deductive databases: An automata-theoretic approachFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-56287-7_104(176-190)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-56287-7_104
Tsukamoto MNishio SFujio M(2005)DOT: A term representation using DOT algebra for knowledge-basesDeductive and Object-Oriented Databases10.1007/3-540-55015-1_21(391-410)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-55015-1_21
Catania BBertino E(2003)Static Analysis of Logical Languages with Deferred Update SemanticsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2003.118584115:2(386-404)Online publication date: 1-Feb-2003
https://dl.acm.org/doi/10.1109/TKDE.2003.1185841
Vianu V(2003)Logic as a Query Language: From Frege to XMLSTACS 200310.1007/3-540-36494-3_1(1-12)Online publication date: 17-Feb-2003
https://doi.org/10.1007/3-540-36494-3_1
Neven F(2002)Automata theory for XML researchersACM SIGMOD Record10.1145/601858.60186931:3(39-46)Online publication date: 1-Sep-2002
https://dl.acm.org/doi/10.1145/601858.601869
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Database theory column

Theory and practice of string solvers (invited talk abstract)

Database theory column: report on PODS 2006