Skip to main content

User Relevancy Improvisation Protocol

  • Conference paper
Distributed Computing - IWDC 2003 (IWDC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2918))

Included in the following conference series:

  • 296 Accesses

Abstract

In the present web search, mining the web repository and yielding the most relevant result set that is minimal in size is the most sought after requirement. In this paper we proposed a new protocol namely User Relevancy Improvisation Protocol (URIP) that employs ”push” mechanism to obtain the most current and concise summary of the web sites. We strongly feel that context identification and relevancy characterization are best achieved through collaboration between web servers and search engines. Relevancy being user specific, we introduced two parameters, Knowledge Quotient (Kq) and Knowledge Factor (Kf) to rank the web pages. URIP clients at the respective web servers compute these parameters for each web page. Search Engine Server embodies the URIP server that gets the update notifications from all the web servers as and when the web sites are created or modified. User input contains query terms, his/her knowledge level (Kq() and domain expertise (Kf(). Relevant document set is retrieved with closely matching < Kq, Kq(> and < Kf, Kf(>. Apparent advantages of our proposal are, (1) Does not need constellation of thousands of systems to index the web data, (2) Search engine site need not maintain a snapshot of the web to respond to the users, (3) Eliminates spider activity and most importantly (4) Yields minimal and most relevant result set. We compare our results with the popular search engine Google. A Finite State Machine (FSM) based specification for the protocol is given and the protocol is analyzed using M/G/1 model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Satya Sai Prakash, K., Raghavan, S.V.: Web Recency Maintenance Protocol. In: Das, S.K., Bhattacharya, S. (eds.) IWDC 2002. LNCS, vol. 2571, pp. 35–44. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Pitcow, J., et al.: Personalized Search. Communications of ACM 45(9), 50–55 (2002)

    Google Scholar 

  3. Finkelstein, L., et al.: Placing Search in Context: The Concept Revisited. ACM Transactions on Information Systems 20(1), 116–131 (2002)

    Article  MathSciNet  Google Scholar 

  4. Glover, E.J., et al.: Web Search Your Way. Communications of the ACM 44(12), 97–102 (2001)

    Article  MathSciNet  Google Scholar 

  5. Castro, P., Muntz, R.: An Adaptive Approach to Indexing Pervasive Data. In: Second ACM international workshop on Data engineering for wireless and mobile access, California, May 2001, pp. 14–19 (2001)

    Google Scholar 

  6. Brewington, B.E., Cybenko, G.: How Dynamic is the Web. In: 9th World Wide Web Conference, Amsterdam, May 15-19 (2000), http://www9.org/w9cdrom/264/264.html

  7. Pretschner, Gauch, S.: Ontology based Personalized Search. In: Proceedings of the 11th IEEE International Conference on Tools with AI (ICTAI 1999), Chicago, November 1999, pp. 391–398 (1999)

    Google Scholar 

  8. Chan, P.: A non-invasive Approach to Build Web User Profiles. In: Proceedings of ACM SIGKDD International Conference, SanDiego, August 1999, pp. 7–12 (1999)

    Google Scholar 

  9. Brin, S., Page, L.: The Anatomy of Large Scale Hyper textual Web Search Engine. In: 7th World Wide Web Conference, Brisbane, Australia (April 14-18, 1998), http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm

  10. Riloff, E., Lehnert, W.: Information Extraction as a basis for High Precision Text Classification. ACM Transactions on Information Systems 12(3), 296–333 (1994)

    Article  Google Scholar 

  11. West, C.H.: Protocol Validation in complex Systems. In: Proceedings of ACM SIGCOMM 1989 Symposium: Communications, Architecture and Protocols, Austin (September 19-20, 1989); Computer communications Review, 19(4), 303– 312

    Google Scholar 

  12. Lin, F., Chu, P., Liu, M.: Protocol Verification and Using Reachability Analysis. In: Proceedings of ACM SIGCOMM 1987, pp. 126–135 (1987)

    Google Scholar 

  13. Tarny, K.: Protocol Specification and Testing. Plenum Press, New York ISBN: 0-306- 43574-8

    Google Scholar 

  14. Williamson, R.E.: Does Relevancy feed back Improve Document Retrieval Performance? In: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval, May 1978, pp. 151–170 (1978)

    Google Scholar 

  15. http://www.searcenginehguide.com/wi/2002/0211-wi1.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prakash, K.S.S., Raghavan, S.V. (2003). User Relevancy Improvisation Protocol. In: Das, S.R., Das, S.K. (eds) Distributed Computing - IWDC 2003. IWDC 2003. Lecture Notes in Computer Science, vol 2918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24604-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24604-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20745-0

  • Online ISBN: 978-3-540-24604-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics