Issue No.04 - April (2004 vol.16)
Sihem Amer-Yahia , IEEE Computer Society
<p><b>Abstract</b>—This paper describes novel efficient techniques for the distributed evaluation of hierarchical aggregate selection queries over LDAP directory data, distributed across multiple autonomous directory servers. Such queries are useful for emerging applications like the Directory Enabled Networks initiative. Our techniques follow the LDAP approach of distributed query evaluation by referrals, where each relevant server computes answers locally, and the LDAP client coordinates between directory servers. We make a conceptual separation between the identification of relevant servers and the distributed computation of answers. We focus on the challenging task of generating an efficient plan for evaluating hierarchical aggregate selection queries, which involves correlating directory entries across multiple servers. The key features of our plan are: 1) the network traffic consists of query answers, and auxiliary messages that depend only on the number of servers and the size of the query (not on the data size), 2) the coordination effort at the client is independent of the data size, and 3) potentially expensive server-to-server communication and coordination is avoided. We complement our analysis with experiments that show the robustness and scalability of our techniques for highly distributed directory query processing.</p>
LDAP directories, hierarchical aggregate selection, distributed query evaluation, aggregate value cache, topology identification.
Sihem Amer-Yahia, Dan Suciu, "Distributed Evaluation of Network Directory Queries", IEEE Transactions on Knowledge & Data Engineering, vol.16, no. 4, pp. 474-486, April 2004, doi:10.1109/TKDE.2004.1269671