Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

EFFICIENT K-WORD PROXIMITY SEARCH

Gupta, Chirag

Abstract Details

2008, Master of Sciences, Case Western Reserve University, Computing and Information Science.
Proximity search is a very useful technique in narrowing down the results to more relevant ones and at the same time allows users to better express what they are looking for. Most of the current search engines provide limited proximity search behavior like allowing only two query terms. While there are many algorithms for doing k-word near proximity search, there is no significant work for doing k-word ordered proximity search. We have studied and analyzed this behavior of the various current search engines and hereby propose a new algorithm for k-word ordered proximity search which runs in O( nlogk) time. We have also studied ranking techniques related to proximity search and propose enhancements to it. We also propose an additional feature of suggesting frequent combinations of the query terms which might exist in the search document set to the users. This will help users to reach the desired document faster and efficiently.
Z. Meral Ozsoyoglu (Advisor)
80 p.

Recommended Citations

Citations

  • Gupta, C. (2008). EFFICIENT K-WORD PROXIMITY SEARCH [Master's thesis, Case Western Reserve University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=case1197213718

    APA Style (7th edition)

  • Gupta, Chirag. EFFICIENT K-WORD PROXIMITY SEARCH. 2008. Case Western Reserve University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=case1197213718.

    MLA Style (8th edition)

  • Gupta, Chirag. "EFFICIENT K-WORD PROXIMITY SEARCH." Master's thesis, Case Western Reserve University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=case1197213718

    Chicago Manual of Style (17th edition)