Skip to main content
SpringerLink
Log in

Processing Cyclic Queries

  • Chapter
Book cover Query Processing in Database Systems

Part of the book series: Topics in Information Systems ((TINF))

Abstract

The major purpose of this chapter is to summarize existing methods for query graph modification, to give relationships among them and their applications to cyclic query processing. For processing a cyclic query, we first transform it into a tree query using various methods, and then a tree query processing procedure is applied. The tree query is determined by a spanning tree of the query graph. For processing tree queries, semi-joins can be used instead of joins. Procedures for selecting appropriate spanning trees and application to cyclic query processing procedures for distributed database systems are also discussed.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Apers PMG, Hevner AR, Yao SB, “Optimization algorithms for distributed queries”, IEEE Transactions on Software Engineering, SE-9,1, January 1983, 57–68

    Article  Google Scholar 

  2. Armstrong WW, Delobel C, “Decompositions and functional dependencies in relations”, ACM Transactions on Database Systems, 5,4, December 1980, 404–430

    Article  MATH  Google Scholar 

  3. Beeri C, Fagin R, Maier D, Mendelzon A, Ullman J, Yannakakis M, “Properties of acyclic database schemes”, Proc. of 13th ACM Symposium on Theory of Computing, 1981, 355–362

    Google Scholar 

  4. Bernstein PA, Goodman N, “Inequlity semi-joins”, Computer Corp. of America, CCA-79–28

    Google Scholar 

  5. Bernstein PA, Chiù DM, “Using semi-joins to solve relational queries”, Journal of the ACM, 28,1, January 1981, 25–40

    Article  MATH  Google Scholar 

  6. Bernstein PA, Goodman N, “Power of natural semi-joins”, SIAM Journal of Computing, 10,4, November 1981, 751–771

    Article  MATH  MathSciNet  Google Scholar 

  7. Fagin R, “Acyclic database schemes (of various degrees): a painless introduction”, IBM Research Report, RJ3800, February 1983

    Google Scholar 

  8. Garey MR, Johnson DS, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman WH and Company, 1979

    MATH  Google Scholar 

  9. Goodman N, Shmueli O, “The tree property is fundamental for query processing”, (Extended Abstract), Proc. 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 1982, 40–48

    Google Scholar 

  10. Goodman N, Shmueli O, “Transforming cyclic schémas into trees”, ACM SIGACT Symposium on Principles of Database Systems, March 1982, 49–54

    Google Scholar 

  11. Goodman N, Shmueli O, “Tree queries: a simple class of relational queries”, ACM Transactions on Database Systems, 7,4, December 1982, 653–677

    Google Scholar 

  12. Kambayashi Y, “Theory of relational database”, Japan Annual Reviews in Electronics, Computers & Telecommunications, Computer Science & Technologies, OHMSHA/North Holland, March 1982, 206–226

    Google Scholar 

  13. Kambayashi Y, Yoshikawa M, Yajima S, “Query processing for distributed databases using generalized semi-joins”, Proc. ACM SIGMOD International Conference on Management of Data, June 1982, 151–160

    Google Scholar 

  14. Kambayashi Y, Yoshikawa M, “Query processing utilizing dependencies and horizontal decomposition”, Proc. ACM SIGMOD Conference, San Jose, May 1983, 55–57

    Google Scholar 

  15. Sagiv Y, Delobel C, Parker DS Jr, Fagin R, “An equivalence between relational database dependencies and a fragment of prepositional logic”, J ACM, 28,3, July 1981, 435–453

    Google Scholar 

  16. Tanaka K, Le Viet C, Kamabyashi Y, Yajima S, “A file organization suitable for relational database operations”, Lecture Notes in Computer Science 75, Springer-Verlag, August 1978, 193–227

    Google Scholar 

  17. Wong E, Youssefi K, “Decomposition-a strategy for query processing”, ACM Transactions on Database Systems, 1, 3, September 1976, 223–241

    Article  Google Scholar 

  18. Yu CT, Ozsoyoglu MZ, “An algorithm for tree-query membership of a distributed query”, IEEE COMPSAC, Chicago, November 1979, 306–312

    Google Scholar 

Download references

Authors
  1. Yahiko Kambayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronics & Computer Technology Corporation, 9430 Research Boulevard, 78759, Austin, TX, USA

    Won Kim

  2. Computer Corporation of America, Four Cambridge Center, 02142, Cambridge, MA, USA

    David S. Reiner

  3. Department of Computer Science, The University of Texas at Austin, 78712, Austin, TX, USA

    Don S. Batory

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kambayashi, Y. (1985). Processing Cyclic Queries. In: Kim, W., Reiner, D.S., Batory, D.S. (eds) Query Processing in Database Systems. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82375-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82375-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82377-0

  • Online ISBN: 978-3-642-82375-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation