Skip to main content
SpringerLink
Log in

Linearly Bounded Reformulations of Unary Databases

  • Conference paper
  • First Online:
Abstraction, Reformulation, and Approximation (SARA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1864))

Abstract

Database reformulation is the process of rewriting the data and rules of a deductive database in a functionally equivalent manner. We focus on the problem of automatically reformulating a database in a way that reduces query processing time while satisfying strong storage space constraints.

In this paper we consider one class of deductive databases — those where all stored relations are unary. For this class of so-called unary databases, we show that the database reformulation problem is decidable if all rules can be expressed in nonrecursive datalog with negation; moreover, we show that for such databases there always exists an “optimal” reformulation. We also suggest how this solution for unary databases might be extended to the general case, i.e., to that of reformulating databases with stored relations of arbitrary arity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Serge Abiteboul and Oliver Duschka. Complexity of answering queries using materialized views. In PODS-98, pages 254–263.

    Google Scholar 

  2. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, Reading, Mass., 1995.

    MATH  Google Scholar 

  3. F.N. Afrati, M. Gergatsoulis, and T.G. Kavalieros. Answering queries using materialized views with disjunctions. In ICDT-99, pages 435–452.

    Google Scholar 

  4. P. Atzeni, G. Ausiello, C. Batini, and M. Moscarini. Inclusion and equivalence between relational database schemata. Theoretical Computer Science, 19:267–285, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  5. E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in a multidimensional database. In VLDB-97, pages 156–165.

    Google Scholar 

  6. C. Batini, M. Lenzerini, and S.B. Navathe. A comparative analysis of methodologies for database schema integration. ACM Computing Surveys, 18(4):323–364, 1986.

    Article  Google Scholar 

  7. C. Beeri, A.O. Mendelzon, Y. Sagiv, and J.D. Ullman. Equivalence of relational database schemes. SIAM J. Comput., 10(2):352–370, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  8. E.F. Codd. A relational model of data for large shared data banks. Comm. ACM, 13(6):377–387, June 1970.

    Google Scholar 

  9. Oliver M. Duschka and Michael R. Genesereth. Answering recursive queries using views. In PODS-97, pages 109–116.

    Google Scholar 

  10. Oliver M. Duschka and Michael R. Genesereth. Query planning with disjunctive sources. In AAAI-98 Workshop on AI and Information Integration.

    Google Scholar 

  11. Herbert B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.

    MATH  Google Scholar 

  12. Fausto Giunchiglia and Toby Walsh. A theory of abstraction. Artificial Intelligence, 57(2–3):323–389, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  13. Himanshu Gupta. Selection of views to materialize in a data warehouse. In ICDT-97, pages 98–112.

    Google Scholar 

  14. Himanshu Gupta and Inderpal Singh Mumick. Selection of views to materialize under a maintenance cost constraint. In ICDT-99, pages 453–470.

    Google Scholar 

  15. Richard Hull. Managing semantic heterogeneity in databases: a theoretical perspective. In PODS-97, pages 51–61.

    Google Scholar 

  16. Richard Hull. Relative information capacity of simple relational database schemata. SIAM J. Comput., 15(3):856–886, August 1986.

    Google Scholar 

  17. Won Kim, editor. Modern Database Systems. ACM Press, New York, New York, 1995.

    MATH  Google Scholar 

  18. Yannis Kotidis and Nick Roussopoulos. Dynamat: a dynamic view management system for data warehouses. In SIGMOD-99.

    Google Scholar 

  19. Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, and Oded Shmueli. Equivalence, query-reachability and satisfiability in datalog extensions. In PODS-93, pages 109–122.

    Google Scholar 

  20. Alon Y. Levy and P. Pandurang Nayak. A semantic theory of abstractions. In IJCAI-95, pages 196–203.

    Google Scholar 

  21. A.Y. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS-95, pages 95–104.

    Google Scholar 

  22. Jack Minker. Logic and databases: a 20 year retrospective. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases, pages 3–57. Springer, 1996. (Proceedings of the LID’96 international workshop).

    Google Scholar 

  23. Raghu Ramakrishnan and Jeffrey D. Ullman. A survey of deductive database systems. J. Logic Progr., 23(2):125–149, May 1995.

    Google Scholar 

  24. J. Rissanen. On equivalences of database schemes. In PODS-82, pages 23–26.

    Google Scholar 

  25. K.A. Ross, D. Srivastava, and S. Sudarshan. Materialized view maintenance and integrity constraint checking: trading space for time. In SIGMOD-96, pages 447–458.

    Google Scholar 

  26. Devika Subramanian. A theory of justified reformulations. PhD thesis, Stanford University, 1989.

    Google Scholar 

  27. D. Theodoratos and T. Sellis. Data warehouse configuration. In VLDB-97, pages 126–135.

    Google Scholar 

  28. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume I. Computer Science Press, New York, 1988.

    Google Scholar 

  29. J. Yang, K. Karlapalem, and Q. Li. Algorithms for materialized view design in data warehousing environment. In VLDB-97, pages 136–145.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, CA, 94305, USA

    Rada Chirkova & Michael R. Genesereth

Authors
  1. Rada Chirkova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael R. Genesereth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Nebraska - Lincoln, 115 Ferguson Hall, Lincoln, NE, 68588-0115

    Berthe Y. Choueiry

  2. Department of Computer Science, University of York, Heslington, York, Y010 5DD, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chirkova, R., Genesereth, M.R. (2000). Linearly Bounded Reformulations of Unary Databases. In: Choueiry, B.Y., Walsh, T. (eds) Abstraction, Reformulation, and Approximation. SARA 2000. Lecture Notes in Computer Science(), vol 1864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44914-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44914-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67839-7

  • Online ISBN: 978-3-540-44914-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation