Visualizing Query Occurrence in Search Result Lists

2006 ◽  
Author(s):  
T. Heimonen ◽  
N. Jhaveri
Keyword(s):  
Search Result

Query expansion based on context of document and search result

2009 ◽  
Vol 29 (3) ◽  
pp. 852-853
Author(s):  
Hui JIANG ◽  
Xiao-hua YANG
Keyword(s):  
Query Expansion ◽  
Search Result

An Efficient Match Search Approach Using Two-Dimensional Hash Function in Hardware-Based Dictionary Compression

2019 ◽  
Vol 28 (06) ◽  
pp. 1950106
Author(s):  
Qian Dong ◽  
Bing Li
Keyword(s):  
Compression Ratio ◽  
Hash Function ◽  
High Speed ◽  
Two Dimensional ◽  
Time Data ◽  
Search Result ◽  
Compression Speed ◽  
Real Time Data ◽  
Real Time Data Processing ◽  
Search Approach

The hardware-based dictionary compression is widely adopted for high speed requirement of real-time data processing. Hash function helps to manage large dictionary to improve compression ratio but is prone to collisions, so some phrases in match search result are not true matches. This paper presents a novel match search approach called dual chaining hash refining, which can improve the efficiency of match search. From the experimental results, our method showed obvious advantage in compression speed compared with other approach that utilizes single hash function described in the previous publications.

Sign in / Sign up

Export Citation Format

Share Document