Record Details

On bounding-schemas for LDAP directories

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title On bounding-schemas for LDAP directories
 
Creator AMER-YAHIA, S
JAGADISH, HV
LAKSHMANAN, LVS
SRIVASTAVA, D
 
Description 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.
 
Publisher SPRINGER-VERLAG BERLIN
 
Date 2011-10-23T13:12:40Z
2011-12-15T09:11:10Z
2011-10-23T13:12:40Z
2011-12-15T09:11:10Z
2000
 
Type Article; Proceedings Paper
 
Identifier ADVANCES IN DATABASE TECHNOLOGY-DEBT 2000, PROCEEDINGS,1777,287-301
3-540-67227-3
0302-9743
http://dspace.library.iitb.ac.in/xmlui/handle/10054/15138
http://hdl.handle.net/100/1893
 
Source 7th International Conference on Extending Database Technology,CONSTANCE, GERMANY,MAR 27-31, 2000
 
Language English