Skip to main content
SpringerLink
Log in
Book cover

International Conference on Conceptual Modeling

ER 2001: Conceptual Modeling for New Information Systems Technologies pp 306–319Cite as

A Formal Analysis of the Lightweight Directory Access Protocol

  • Conference paper
  • First Online:

  • 442 Accesses

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

Abstract

LDAP (Lightweight Directory Access Protocol) directories are being widely used on the Web, for white pages information, user profiles, etc. The advantages LDAP offers are (i) the support for highly distributed data on the Web while still keeping a uniform data model; (ii) the flexibility of a semi-structured data model, i.e. a flexible data type definition enabling the presentation and manipulation of heterogeneous data entries in a natural manner. Although many implementations of the LDAP protocol exist, the still lacking logical formalization prohibits a formal analysis and makes it difficult to make use of the numerous results developed for relational databases. In this paper, we give a firstorder logic semantics of LDAP and discuss the expressive power of LDAP. In particular, schema typing constraints are interpreted as semantic integrity constraints. We apply our framework to the containment problem of LDAP queries with schema constraints; we reduce this problem to the containment problem of Datalog in the presence of integrity constraints.

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. A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.

    Google Scholar 

  2. S. Abiteboul, P. Buneman, and D. Suciu. Data on the web. Morgan Kaufmann, 2000.

    Google Scholar 

  3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Publishing Company, 1995.

    Google Scholar 

  4. S. Amer-Yahia, H. Jagadish, L. Lakshmanan, and D. Srivastava. On Boundingschemas for LDAP Directories. Tech. Report, Concordia University, 1999.

    Google Scholar 

  5. E. P. F. Chan. Containment and Minimization of Positive Conjunctive Queries in OODB’s. In PODS’92. ACM Press, 1992.

    Google Scholar 

  6. S. Chaudhuri and M. Y. Vardi. On the Equivalence of Recursive and Nonrecursive Datalog Programs. In PODS’92. ACM Press, 1992.

    Google Scholar 

  7. S. Cluet, O. Kapitskaia, and D. Srivastava. Using LDAP Directory Caches. In PODS’99. ACM Press, 1999.

    Google Scholar 

  8. P. Godfrey, J. Grant, J. Gryz, and J. Minker. Integrity constraints: Semantics and applications. In Jan Chomicki and Gunter Saake, editors, Logics for Databases and Information Systems. Kluwer, 1998.

    Google Scholar 

  9. A. Halevy. Answering Queries Using Views: A Survey. To appear in VLDB Journal, 2001.

    Google Scholar 

  10. T. Howes, M. Smith, and G. Good. Understanding and Deploying LDAP Directory Services. Macmillan Technical Publishing, 1999.

    Google Scholar 

  11. Innosoft. Innosoft’s Resources for Directory Deployments. http://www.innosoft.com/ldap_survey.

  12. H. V. Jagadish, Laks V. S. Lakshmanan, Tova Milo, Divesh Srivastava, and Dimitra Vista. Querying Network Directories. In SIGMOD’99. ACM Press, 1999.

    Google Scholar 

  13. A. Klug. On conjunctive queries containing inequalities. In J. ACM 35:1, pp. 146–160, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  14. A. Y. Levy and Y. Sagiv. Queries Independent of Updates. In VLDB’93, 1993.

    Google Scholar 

  15. P. J. Marron and G. Lausen. On Processing XML in LDAP. In Proceedings of the VLDB’01, 2001.

    Google Scholar 

  16. Y. Papakonstantinou. Query processing in heterogeneous information sources. PhD thesis, Dept. of Computer Science, Stanford University, 1996.

    Google Scholar 

  17. J. Shanmugasundaram, K. Tufte, C. Zhang, G. He, D. J. DeWitt, and J. F. Naughton. Relational Databases for Querying XML Documents: Limitations and Opportunities. In VLDB’99, 1999.

    Google Scholar 

  18. S. S. B. Shi, E. Stokes, D. Byrne, C. F. Corn, D. Bachmann, and T. Jones. An enterprise directory solution with DB2. IBM Systems Journal, 39(2):360–383, 2000.

    Article  Google Scholar 

  19. O. Shmueli. Decidability and Expressiveness of Logic Queries. In PODS’87. ACM, 1987.

    Google Scholar 

  20. I. Tatarinov, Zachary Ives, Alon Halevy, and Dan Weld. Updating XML. In Proc. of ACM SIGMOD Conf. on Management of Data, 2001.

    Google Scholar 

  21. R. van der Meyden. The Complexity of Querying Indefinite Information: Defined Relations. Ph.D thesis, Rutgers University, 1992.

    Google Scholar 

  22. M. Wahl, T. Howes, and S. Kille. Lightweight Directory Access Protocol (v3). Request for Comments 2251. http://www3.innosoft.com/ldapworld/rfc2251.txt, 1997.

  23. F. Wei and G. Lausen. Conjuctive query containment in the presence of disjunctive integrity constraints. Submitted.

    Google Scholar 

  24. F. Wei and G. Lausen. Query Containment for Conjunctive Queries and Datalog with Negation. Technical Report. http://www.informatik.uni-freiburg.de/fwei/paper/containment.ps

  25. X. Zhang and Z. Meral Özsoyoglu. Implication and referential constraints: A new formal reasoning. TKDE, 9(6):894–910, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computer Science, University of Freiburg, Germany

    Fang Wei & Georg Lausen

Authors
  1. Fang Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Lausen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate school of environment and information sciences, Yokohama National University, 79-7, Tokiwadai, Hodogaya-ku, yokohama, 240-8501, Japan

    Hiroshi Arisawa

  2. Department of Social Informatics, Graduate School of Informatics, Kyoto University, Yoshida, Sakyo, Kyoto, 606-8501, Japan

    Yahiko Kambayashi

  3. SICE Computer Networking, University of Missouri-Kansas City, 5100 Rockhill Road, Kansas City, MO, 64110, USA

    Vijay Kumar

  4. University of Klagenfurt, Universitätsstraße 65-67, 9020, Klagenfurt, Austria

    Heinrich C. Mayr

  5. VP Industry Services DAMA International, PO Box 5786, Bellevue, WA, 98006-5786, USA

    Ingrid Hunt

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, F., Lausen, G. (2002). A Formal Analysis of the Lightweight Directory Access Protocol. In: Arisawa, H., Kambayashi, Y., Kumar, V., Mayr, H.C., Hunt, I. (eds) Conceptual Modeling for New Information Systems Technologies. ER 2001. Lecture Notes in Computer Science, vol 2465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46140-X_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-46140-X_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44122-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation