Skip to main content
SpringerLink
Log in

Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders

  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2215))

Included in the following conference series:

  • 254 Accesses

Abstract

This paper demonstrates the generation of a linear time query processing algorithm based on the constructive proof of Higman’s lemma described by Murthy-Russell (IEEE LICS 1990). A linear time evaluation of a fixed disjunctive monadic query in an indefinite database on a linearly ordered domain, first posed by Van der Meyden (ACM PODS 1992), is used as an example. Van der Meyden showed the existence of a linear time algorithm, but an actual construction has, until now, not been published elsewhere.

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. J. Chomicki. Temporal query languages: a survey. In D.M. Gabbay and H.J. Ohlbach, editors, Temporal Logic: (ICTL’94), pages 506–534, 1994. Lecture Notes in Artificial Intelligence, Vol. 827, Springer-Verlag.

    Google Scholar 

  2. T. Coquand and D. Fridlender. A proof of Higman’s lemma by structural induction, November 1993. available at http://www.md.chalmers.se/~coquand/intuitionism.html.

  3. R.M. Fellows and M.A. Langston. Nonconstructive tools for proving polynomialtime decidability. Journal of the ACM, 35(3):727–739, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Fridlender. Higman’s lemma in type theory. In E. Gimnez and C. P.-Mohring, editors, Types for Proofs andPr ograms, TYPES’96, pages 112–133, 1996. Lecture Notes in Computer Science, Vol. 1512, Springer-Verlag.

    Google Scholar 

  5. A. Geser. A proof of Higman’s lemma by open induction. Technical Report MIP-9606, Passau University, April 1996.

    Google Scholar 

  6. A. Gupta. A constructive proof that tree are well-quasi-ordered under minors. In A. Nerode and M. Taitslin, editors, Logical foundations of computer science-Tver’92, pages 174–185, 1992. Lecture Notes in Computer Science, Vol. 620, Springer-Verlag.

    Chapter  Google Scholar 

  7. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Mathematical Society, 2:326–336, 1952.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Koubarakis. The complexity of query evaluation in indefinite temporal constraint databases. Theoretical Computer Science, 171:25–60, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  9. C.R. Murthy and J.R. Russell. A constructive proof of Higman’s lemma. In Proc. 5th IEEE sympo. on Logic in Computer Science, pages 257–267, 1990.

    Google Scholar 

  10. C.ST.J.A. Nash-Williams. On well-quasi-ordering finite trees. Proc. Cambridge Phil. Soc., 59:833–835, 1963.

    Article  MATH  MathSciNet  Google Scholar 

  11. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465–476, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  12. L. Perković and B. Reed. An improved algorithm for finding tree decompositions of small width. In et.al. Widmayer, editor, WG’99, pages 148–154, 1999. Lecture Notes in Computer Science, Vol. 1665, Springer-Verlag.

    Google Scholar 

  13. F. Richman and G. Stolzenberg. Well quasi-ordered sets. Advances in Mathematics, 97:145–153, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  14. N. Robertson and P.D. Seymour. Graph minors XX. Wagner’s conjecture, 1988. Manuscript.

    Google Scholar 

  15. N. Robertson and P.D. Seymour. Graph minors XIII. the disjoint path problem. Journal of Combinatorial Theory Series B, 63:65–110, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  16. S.G. Simpson. Ordinal numbers and the Hilbert basis theorem. Journal of Symbolic Logic, 53(3):961–974, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  17. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133–192. Elsevier Science Publishers, 1990.

    Google Scholar 

  18. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. Journal of Computer andSystem Science, 54(1):113–135, 1997. Previously presented at 11th ACM sympo. on Principles of Database Systems, pp.331-345, 1992.

    Article  MATH  Google Scholar 

  19. W. Veldman. An intuitionistic proof of Kruskal’s theorem. Technical Report 17, Department of Mathematics, University of Nijmegen, April 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Communication Science Laboratories, 3-1 Morinosato-Wakamiya Atsugi Kanagawa, 243-0198, Japan

    Mizuhito Ogawa

Authors
  1. Mizuhito Ogawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Tokyo Institute of Technology Graduate School of Information Science and Engineering, 2-12-1 Oo-okayama, Meguro-ku, Tokyo, 152-8552, Japan

    Naoki Kobayashi

  2. Department of Computer and Information Science, University of Pennsylvania, 200 S. 33rd St., Philadelphia, PA, 19104, USA

    Benjamin C. Pierce

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ogawa, M. (2001). Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders. In: Kobayashi, N., Pierce, B.C. (eds) Theoretical Aspects of Computer Software. TACS 2001. Lecture Notes in Computer Science, vol 2215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45500-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45500-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42736-0

  • Online ISBN: 978-3-540-45500-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation