Advertisement

Fast User Notification in Large-Scale Digital Libraries: Experiments and Results

  • Hannen Belhaj Frej
  • Phillippe Rigaux
  • Nicolas Spyratos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4690)

Abstract

We are interested in evaluating the performance of new matching algorithms for user notification in digital libraries (DL). We consider a subscription system which continuously evaluates queries over a large repository containing document descriptions. The subscriptions and the document descriptions rely on a taxonomy that is a hierarchically organized set of terms. The digital library supports insertion, update and removal of a document. Each of these operations is seen as an event that must be notified only to those users whose subscriptions match the document’s description. The paper proposes a notification algorithm dedicated to taxonomy-based DLs, addresses computational issues and report a full set of experiments illustrating the advantages of the approach.

Keywords

Digital libraries personalization publish/subscribe systems notifications matching algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The ACM computing classification system, www.acm.org/class
  2. 2.
    Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proc. of the Intl. Conf. on Management of Data (SIGMOD), pp. 253–262 (1989)Google Scholar
  3. 3.
    Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching events in a content-based subscription system. In: PODC. Proc. of the ACM Intl. Symposium on Principles of Distributed Computing, pp. 53–61. ACM Press, New York (1999)CrossRefGoogle Scholar
  4. 4.
    Altinel, M., Franklin, M.J.: Efficient filtering of xml documents for selective dissemination of information. In: Proc. of the Intl. Conf. on Very Large Data Bases (VLDB), pp. 53–64 (2000)Google Scholar
  5. 5.
    Campailla, A., Chaki, S., Clarke, E.M., Jha, S., Veith, H.: Efficient Filtering in Publish-Subscribe Systems Using Binary Decision. In: Proc. of the Intl. Conf. on Software Engineering (ICSE), pp. 443–452 (2001)Google Scholar
  6. 6.
    Chirita, P.-A., Idreos, S., Koubarakis, M., Nejdl, W.: Publish/subscribe for rdf-based p2p networks. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol. 3053, pp. 182–197. Springer, Heidelberg (2004)Google Scholar
  7. 7.
    Christophides, V., Plexousakis, D., Scholl, M., Tourtounis, S.: On labeling schemes for the semantic web. In: Proc. Intl. Conf. on World Wide Web (WWW), pp. 544–555 (2003)Google Scholar
  8. 8.
    Fabret, F., Jacobsen, H.A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish subscribe systems. In: Proc. of the Intl. Conf. on Management of Data (SIGMOD), pp. 115–126 (2001)Google Scholar
  9. 9.
    Frej, H.B., Rigaux, P., Spyratos, N.: User notification in taxonomy based digital libraries. In: Intl. Symposium on Design of Communication (2006)Google Scholar
  10. 10.
    Furer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proc. of the ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York (1992)Google Scholar
  11. 11.
    Gough, J., Smith, G.: Efficient recognition of events in a distributed system. In: Proc. of the Australasian Computer Science Conference (1995)Google Scholar
  12. 12.
    Hou, S., Jacobsen, H.-A.: Predicate-based filtering of xpath expressions. In: ICDE. Proc. of the IEEE Intl Conf. on Data Engineering, p. 53. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  13. 13.
    Leung, H.K.Y.: Subject space: a state-persistent model for publish/subscribe systems. In: Proc. of the Conf. of the IBM Centre for Advanced Studies on Collaborative research (CASCON) (2002)Google Scholar
  14. 14.
    Leung, H.K.Y., Jacobsen, H.-A.: Efficient matching for state-persistent publish/subscribe systems. In: Proc. of the Conf. of the IBM Centre for Advanced Studies on Collaborative research (CASCON), pp. 182–196 (2003)Google Scholar
  15. 15.
    Pereira, J., Fabret, F., Llirbat, F., Preotiuc-Pietro, R., Ross, K.A., Shasha, D.: Publish/subscribe on the web at extreme speed. In: Proc. of the Intl. Conf. on Very Large Data Bases (VLDB), pp. 627–630 (2000)Google Scholar
  16. 16.
    Pereira, J., Fabret, F., Llirbat, F., Shasha, D.: Efficient matching for web-based publish/subscribe systems. In: Proc. of the Conf. on Cooperative Information Systems, pp. 162–173 (2000)Google Scholar
  17. 17.
    Pettie, S., Ramachandran, V.: An optimal minimum spanning tree algorithm. Journal of the ACM 49(1), 16–34 (2002)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Rigaux, P., Spyratos, N.: Metadata inference for document retrieval in a distributed repository. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 418–436. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Tryfonopoulos, C., Koubarakis, M., Drougas, Y.: Filtering algorithms for information retrieval models with named attributes and proximity operators. In: SIGIR. Proc. of the ACM Intl. Conf. on Research and development in information retrieval, pp. 313–320. ACM Press, New York (2004)CrossRefGoogle Scholar
  20. 20.
    Wang, J., Jin, B., Li, J.: An ontology-based publish/subscribe system. In: Proc. of the ACM/IFIP/USENIX Intl. Conf. on Middleware, pp. 232–253 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Hannen Belhaj Frej
    • 1
  • Phillippe Rigaux
    • 2
  • Nicolas Spyratos
    • 1
  1. 1.LRI, Univ. Paris-Sud, 91400 Orsay 
  2. 2.Lamsade, Univ. Paris-Dauphine,75016 Paris 

Personalised recommendations