MATCHING FOR MOBILE USERS IN THE PUBLISH/SUBSCRIBE PARADIGM

A. M. Roumani, D. B. Skillicorn

Abstract

In a mobile publish/subscribe paradigm, user service discovery and recommendation requires matching user preferences with properties of published services. For example, a user may want to find if there is a moderately priced Chinese restaurant that does not require reservations close by. To generate accurate recommendations, the properties of each user subscription must be matched with those of existing services as accurately as possible. This is a difficult problem when users are mobile, wirelessly connected to a network, and dynamically roaming to different locations. The available data is very large, and the matching must be computed in real time. Existing heuristics are quite ineffective. We propose novel algorithms that use singular value decomposition as a dimension-reduction technique. We introduce “positive” nearest-neighbor matching to find services whose attribute values exceed those of a new user subscription. Making this idea effective requires careful attention to details such as normalization. Performance and quality of matches are reported for datasets representing applications in the mobile publish/subscribe paradigm. For n services and m preference attributes, reasonable matches can be found in time O (m log n), using O (nm) storage.

References

  1. Babu, S. and Widom, J. (2001). Continuous queries over data streams. In ACM SIGMOD, pages 109-120, NY, USA.
  2. Burcea, I., Jacobsen, H.-A., DeLara, E., Muthusam, V., and Petrovic, M. (2004). Disconnected operations in publish/subscribe. In IEEE MDM, pages 39-50, CA, USA.
  3. Dobkin, D. and Lipton, R. (1976). Multidimensional search problems. SIAM Journal on Computing, 5:181-186.
  4. Fabret, F., Jacobsen, H.-A., Llirbat, F., Pereira, J., Ross, K. A., and Shasha, D. (2001). Filtering algorithms and implementation for very fast publish/subscribe systems. In ACM SIGMOD, pages 115-126, CA, USA.
  5. Fabret, F., Llirbat, F., Pereira, J., and Shasha, D. (2000). Efficient matching for content-based publish/subscribe systems. Technical report, INRIA. http://wwwcaravel.inria.fr/pereira/matching.ps.
  6. Golub, G. H. and Loan, C. F. V. (1989). Matrix Computations. Johns Hopkins Press, MD, USA.
  7. Kleinberg, J. (1997). Two algorithms for nearest-neighbour search in high dimensions. In 29th ACM STOC, pages 599-608.
  8. Leung, H. (2002). Subject space: A state-persistent model for publish/subscribe systems. In CASCON, pages 7- 17, Toronto, Canada.
  9. Leung, H. and Jacobsen, H.-A. (2003). Efficient matching for state-persistent publish/subscribe systems. In CASCON, pages 182-196, Toronto, Canada.
  10. RSS (2006). RSS: RDF site summary. www-106.ibm.com/ developerworks/library/w-rss.html?dwzone= web.
  11. Samet, H. (1990). The Design and Analysis of Spatial Data Structures. Addison-Wesley, Boston, MA, USA.
  12. TIBCO (2006). TIBCO rendezvous. www.tibco.com/ software/messaging/rendezvous.jsp.
Download


Paper Citation


in Harvard Style

M. Roumani A. and B. Skillicorn D. (2007). MATCHING FOR MOBILE USERS IN THE PUBLISH/SUBSCRIBE PARADIGM . In Proceedings of the Second International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2007) ISBN 978-989-8111-14-2, pages 173-180. DOI: 10.5220/0002147401730180


in Bibtex Style

@conference{winsys07,
author={A. M. Roumani and D. B. Skillicorn},
title={MATCHING FOR MOBILE USERS IN THE PUBLISH/SUBSCRIBE PARADIGM},
booktitle={Proceedings of the Second International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2007)},
year={2007},
pages={173-180},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002147401730180},
isbn={978-989-8111-14-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2007)
TI - MATCHING FOR MOBILE USERS IN THE PUBLISH/SUBSCRIBE PARADIGM
SN - 978-989-8111-14-2
AU - M. Roumani A.
AU - B. Skillicorn D.
PY - 2007
SP - 173
EP - 180
DO - 10.5220/0002147401730180