Skip to main content
SpringerLink
Log in

Declarative Constrained Language for Semistructured Data

  • Conference paper
Flexible Query Answering Systems

Part of the book series: Advances in Soft Computing ((AINSC,volume 7))

  • 142 Accesses

Abstract

In this paper we consider how constraint-based technology can be used to query semistructured data. We present a formalism based on feature logics for querying semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. S. Abiteboul. Querying Semi-Structured Data. In Proceedings of the International Conference on Database Theory (ICDT’97), Delphi, Greece,pages 1–18,Janvier 1997.

    Google Scholar 

  2. S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel Query Language for Semistructured Data. International Journal on Digital Libraries1(1):68–88, 1997.

    Google Scholar 

  3. S. Abiteboul and V. Vianu. Regular Path Queries with Constraints. In Proceedings of PODS’97 Conference Tucson Arizonapages 122–133. ACM Press, May 1997.

    Google Scholar 

  4. H. Aït-Kaci. An Algebraic Semantics Approach to the Effective Resolution of Type Equations. Theoretical Computer Science, 45: 293–351, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  5. H. Ait-Kaci and R. Nasr. LOGIN: A Logic Programming Language with Built-in Inheritance. Journal of Logic Programming, 3 (3): 185–215, 1986.

    Article  Google Scholar 

  6. H. Aït-Kaci, A. Podelski, and G. Smolka. A Feature-Based Constraint System for Logic Programming witn Entailment. Theoretical Computer Science122:263–283, 1994.

    Google Scholar 

  7. R. Backofen. Regular Path Expressions in Feature Logic. Journal of Symbolic Computation, 17: 421–455, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  8. P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A Query Language and Optimization Techniques for Unstructured Data. In Proceedings of SIGMOD’96 Conference Montreal Canadapages 505–516, June 1996.

    Google Scholar 

  9. P. Buneman, W. Fan, and S. Weinstein. Path Constraints on Semistructured and Structured Data. In Proceedings of PODS’98, Seattle, Washington, pages 129–138. ACM Press, 1998.

    Google Scholar 

  10. H.-J. Bürckert. A Resolution Principle for Constrained Logics. Artificial Intelligence, 66: 235–271, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  11. R. Cattel. The Object Database Standard: ODMG-93. Morgan Kaufmann, San Mateo, CA, 1994.

    Google Scholar 

  12. C. Decleir, M.-S. Hacid, and J. Kouloumdjian. A Database Approach for Modeling and Querying Video Data. In In Proceedings of the 15th International Conference on Data Engineering (ICDE’99) Sydney Australiapages 6–13, Mar. 1999.

    Google Scholar 

  13. K. Govindarajan, B. Jayaraman, and S. Mantha. Optimization and Relaxation in Constraint Logic Languages. In In Proceedings of POPL’96 Conferencepages 91–103, 1996.

    Google Scholar 

  14. M. Höhfeld and G. Smolka. Definite relations over constraint languages. LILOG Report 53, IWBS, IBM Deutschland, Postfach 80 08 80, 7000 Stuttgart 80, Germany, Oct. 1988.

    Google Scholar 

  15. Y. Kanza, W. Nutt, and Y. Sagiv. Queries with Incomplete Answers over Semistructured Data. In Proceedings of PODS’99 Conference Philadelphia Pennsylvaniapages 227–236. ACM Press, May 1999.

    Google Scholar 

  16. R. M. Kaplan and J. Bresnan. Lexical-Functional Grammar: A Formal System for Grammatical Representation. In J. Bresnan, editor The mental Representation of Grammatical Relationspages 173–381. MIT Press, Cambridge (MA), 1982

    Google Scholar 

  17. D. Konopnicki and O. Shmueli. W3QS: A Query System for the World-Wide Web. In U. Dayal, P. M. D. Gray, and S. Nishio, editors, Proceedings of VLDB’95 Conference, Zurich, Switzerland, pages 54–65. Morgan Kaufmann, Sept. 1995.

    Google Scholar 

  18. L. V. S. Lakshmanan, F. Sadri, and I. N. Subramanian. A Declarative Approach to Querying and Restructuring the World-Wide-Web. In In Proceedings of Post-ICDE Workshop on Research Issues in Data Engineering (RIDE’96) New Orleans USApages 12–21, Mar. 1996.

    Google Scholar 

  19. K. Mariott and P. Stuckey. Semantics of Constraint Logic Programs with Optimization. In ACM Lett. Program. Lang. Syste., volume 2, pages 197–212, 1993.

    Google Scholar 

  20. G. Mecca and A. J. Bonner. Sequences, Datalog and Transducers. In Proceedings of the 1995 Symposium on Principles of Database Systems (PODS’95) San Jose Californiapages 23–35, May 1995

    Google Scholar 

  21. A. O. Mendelzon, G. A. Mihaila, and T. Milo. Querying the World Wide Web. International Journal on Digital Libraries, 1 (1): 54–67, 1996.

    Google Scholar 

  22. S. Nestorov, S. Abiteboul, and R. Motwani. Extracting Schema from Semistructured Data. In L. M. Haas and A. Tiwary, editors Proceedings of SIGMOD’98 Conferencepages 295–306, Seattle, Washington, USA, June 1998. ACM Press.

    Google Scholar 

  23. R. L. Schwartz. Learning Perl. O’Reilly & Associates, Inc., 1993. Ch. Regular expressions.

    Google Scholar 

  24. S. M. Shieber. An Introduction to Unification-Based Approaches to Grammar. volume 4 of CSLI Lecture Notes. Center for the Study of Language and Information Stanford University1986.

    Google Scholar 

  25. G. Smolka. Feature Constraint Logics for Unification Grammars. Journal of Logic Programming, 12 (1–2): 51–87, 1992.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Purdue University, West Lafayette, IN, 47907, USA

    Mohand-Saïd Hacid

  2. Campus des Cezeaux, LIMOS-ISIMA, B.P. 125, 63173, Aubiere, France

    Farouk Toumani

Authors
  1. Mohand-Saïd Hacid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Farouk Toumani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Roskilde University, P.O. Box 260, 4000, Roskilde, Denmark

    Henrik L. Larsen , Troels Andreasen  & Henning Christiansen ,  & 

  2. Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, 01-447, Warsaw, Poland

    Janusz Kacprzyk  & Sławomir Zadrożny  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hacid, MS., Toumani, F. (2001). Declarative Constrained Language for Semistructured Data. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadrożny, S. (eds) Flexible Query Answering Systems. Advances in Soft Computing, vol 7. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1834-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1834-5_34

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1347-0

  • Online ISBN: 978-3-7908-1834-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation