On Bounding-Schemas for LDAP Directories
As our world gets more networked, ever increasing amounts of information are being stored in LDAP directories. While LDAP directories have considerable flexibility in the modeling and retrieval of information for network applications, the notion of schema they provide for enabling consistent and coherent representation of directory information is rather weak. In this paper, we propose an expressive notion of bounding-schemas for LDAP directories, and illustrate their practical utility. Bounding-schemas are based on lower bound and upper bound specifications for the content and structure of an LDAP directory. Given a bounding-schema specification, we present algorithms to efficiently determine: (i) if an LDAP directory is legal w.r.t. the bounding-schema, and (ii) if directory insertions and deletions preserve legality. Finally, we show that the notion of bounding-schemas has wider applicability, beyond the specific context of LDAP directories
Unable to display preview. Download preview PDF.
- 1.Directory enabled networks ad hoc working group. http://www.murchiso.com/den/.
- 2.S. Abiteboul. Querying semi-structured data. In Proceedings of the International Conference on Database Theory, pages 1–18, 1997.Google Scholar
- 3.S. Abiteboul and V. Vianu. Regular path queries with constraints. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 122–133, 1997.Google Scholar
- 4.S. Amer-Yahia, H. V. Jagadish, L. V. S. Lakshmanan, and D. Srivastava. On bounding-schemas for LDAP directories. Tech. Report, Concordia University, Montreal, November 1999. http://www.cs.concordia.ca/~faculty/laks/edbt00Sub.ps.gz.
- 5.P. Buneman. Semistructured data. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 117–121, 1997.Google Scholar
- 6.P. Buneman, S. Davidson, M. Fernandez, and D. Suciu. Adding structure to un-structured data. In Proceedings of the International Conference on Database Theory, pages 336–350, Delphi, Greece, 1997.Google Scholar
- 7.P. Buneman, W. Fan, and S. Weinstein. Path constraints in semistructured and structured databases. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 129–138, 1998.Google Scholar
- 8.R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings Publishers, second edition, 1994.Google Scholar
- 9.R. Goldman and J. Widom. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the International Conference on Very Large Databases, 1997.Google Scholar
- 10.H. V. Jagadish, L. V. S. Lakshmanan, T. Milo, D. Srivastava, and D. Vista. Querying network directories. In Proceedings of the ACM SIGMOD Conference on Management of Data, Philadelphia, PA, June 1999.Google Scholar
- 11.A. Kemper and G. Moerkotte. Object-oriented database management applications in engineering and computer science. Prentice Hall, 1994.Google Scholar
- 12.S. Nestorov, S. Abiteboul, and R. Motwani. Extracting schema from semistructured data. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 295–306, 1998.Google Scholar
- 13.D. Suciu. Managing web data. SIGMOD’99 tutorial., 1999.Google Scholar
- 14.M. Wahl, A. Coulbeck, T. Howes, and S. Kille. Lightweight directory access protocol (v3): Attribute syntax definitions. Request for Comments 2252. Available from ftp://ds.internic.net/rfc/rfc2252.txt, Dec. 1997.
- 15.M. Wahl, T. Howes, and S. Kille. Lightweight directory access protocol (v3). Request for Comments 2251. Available from ftp://ds.internic.net/rfc/rfc2251.txt, Dec. 1997.
- 16.W. Yeong, T. Howes, and S. Kille. Lightweight directory access protocol. Request for Comments 1777. Available from ftp://ds.internic.net/rfc/rfc1777.txt, Mar. 1995