Skip to main content
SpringerLink
Log in
Book cover

International Conference on Flexible Query Answering Systems

FQAS 2002: Flexible Query Answering Systems pp 44–55Cite as

Recursive Queries in Product Databases

  • Conference paper
  • First Online:

  • 278 Accesses

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

Abstract

The relational data model does not offer query language solutions for recursive applications. A missing semantic update operation is the fundamental reason for this failure. It is shown that a semantic data model can solve these applications using simple linear constructs for definition and manipulation, without explicit recursion, nesting, iteration or navigation. The new implementation technique is reliable and efficient for application in end user environments. It is based on semantic query specification and metadata processing. Experiments with the semantic Xplain DBMS have confirmed the linear time complexity for product database applications.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. A. Bakker and J. H. ter Bekke, Foolproof Query Access to Search Engines, Proc. 3rd Int. Conf. on Information Integration and Web-based Applications & Services (IIWAS 2001), Linz, Austria (2001), 389–394.

    Google Scholar 

  2. J. A. Bouma and J. H. ter Bekke, Getting Information from Dispersed Databases through Hyperqueries, Proc. Int. Conf. on Applied Informatics (AI 2002), Innsbruck, Austria (2002), 443–447.

    Google Scholar 

  3. M. Davis, Unsolvable Problems, In: Handbook of Mathematical Logic, J. Barwise (ed.), North-Holland, Amsterdam (1977), 568–593.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman, New York (1979).

    Google Scholar 

  5. D. M. Kroenke, Database Processing: Fundamentals, Design, and Implementation (8th edition), Prentice Hall, Upper Sadle River, NJ (2002).

    Google Scholar 

  6. F. Rolland, The Essence of Databases, Prentice Hall, Hemel Hemstead (1998).

    Google Scholar 

  7. P. Schauble and B. Wuthrich, On the Expressive Power of Query Languages, ACM Trans. on Information Systems, Vol 12., No. 1, January 1994, 69–91.

    Article  Google Scholar 

  8. D. Suciu, J. Paredaens, Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure, Proc. 13th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (1994), page 201.

    Google Scholar 

  9. J.H. ter Bekke, Semantic Data Modeling, Prentice Hall, Hemel Hempstead (1992).

    Google Scholar 

  10. J.H. ter Bekke, Advantages of a Compact Semantic Meta Model, Proc. 2nd IEEE Metadata Conference, Silver Spring (1997).

    Google Scholar 

  11. J. H. ter Bekke, Can We Rely on SQL?, Proc. DEXA Workshop, Toulouse (1997), IEEE Computer Society, 378–383.

    Google Scholar 

  12. J.H. ter Bekke and J. A. Bakker, Limitations of Relationships from Coinciding Data, Proc. Int. Conf. Intelligent Systems and Control (ICSC 2001), Clearwater, Florida (2001), 247–252.

    Google Scholar 

  13. J. H. ter Bekke and J. A. Bakker, Content-driven Specifications for Recursive Project Planning Applications, Proc. Int. Conf. on Applied Informatics (AI 2002), Innsbruck, Austria (2002), 448–452.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology and Systems, Delft University of Technology, Mekelweg 4, 2628CD Delft, The Netherlands

    J.H. ter Bekke & J.A. Bakker

Authors
  1. J.H. ter Bekke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J.A. Bakker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, PA, USA

    Jaime G. Carbonell

  2. University of Saarland, Saabrücken, Germany

    Jörg Siekmann

  3. Roskilde University, Building 42-1, P.O. Box 260, 4000, Roskilde, Denmark

    Troels Andreasen  & Henning Christiansen  & 

  4. Department of Information and Software Engineering School of Information Technology and Engineering, George Mason University, Fairfax, 22030-4444, Virginia, USA

    Amihai Motro

  5. Dept. of Computer Science and Engineering, Aalborg University Esbjerg, Niels Bohrs Vej 8, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

ter Bekke, J., Bakker, J. (2002). Recursive Queries in Product Databases. In: Carbonell, J.G., Siekmann, J., Andreasen, T., Christiansen, H., Motro, A., Legind Larsen, H. (eds) Flexible Query Answering Systems. FQAS 2002. Lecture Notes in Computer Science(), vol 2522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36109-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-36109-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36109-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation